System and method for iteratively traversing a hierarchical circuit design
AssigneeHewlett-Packard Development Company, L.P.
InventorsS. Brandon Keller, Gregory Dennis Rogers, George Harold Robbert
Life of this patent
Estimating the term…
Abstract
Systems, methods, and software products iteratively traverse a hierarchical circuit design. An initial net and an instance history that uniquely defines the initial net within the design are selected. The initial net and the instance history are appended to a list of nets to be processed. The initial net and the instance history are inserted into a set of visited nets. Each additional net connected to the initial net is visited in response to a first request from a user. The initial net and each additional net are returned in response to a second request from the user.
Claims20
A method for iteratively traversing a hierarchical circuit design, comprising:
- selecting an initial net and an instance history that uniquely defines the initial net within the circuit design;
- appending, to a list of nets to be processed, the initial net and the instance history;
- inserting, into a set of visited incomplete trace objects, the initial net and the instance history;
- visiting, in response to a first request from a user, each additional net connected to the initial net;
- and
- returning, in response to a second request from the user, the initial net and each additional net.
A system for iteratively traversing a hierarchical circuit design, comprising:
- means for selecting an initial net and an instance history that uniquely defines the initial net within the design;
- means for appending, to a list of nets to be processed, the initial net and the instance history;
- means for inserting, into a set of visited incomplete trace objects, the initial net and the instance history;
- and
- means for visiting, in response to a first request from a user, each additional net connected to the initial net.
A system for iteratively traversing a hierarchical circuit design, comprising:
- an iterator function;
- an incomplete trace object;
- a processor for executing the iterator function and invoking the incomplete trace object, wherein the iterator function:
- selects an initial net and an instance history that uniquely defines the initial net within the circuit design;
- appends, to a list of nets to be processed, the initial net and the instance history;
- inserts, into a set of visited incomplete trace objects, the initial net and the instance history;
- and wherein the incomplete trace object:
- visits, in response to a first request from a user, each additional net connected to the initial net;
- and
- returns, in response to a second request from the user, the initial net and each additional net.
A software product comprising instructions, stored on computer-readable media, wherein the instructions, when executed by a computer, iteratively traverse a hierarchical circuit design, comprising:
- instructions for selecting an initial net and an instance history that uniquely defines the initial net within the circuit design;
- instructions for appending, to a list of nets to be processed, the initial net and the instance history;
- instructions for inserting, into a set of visited incomplete trace objects, the initial net and the instance history;
- instructions for visiting, on a first request from a user, each additional net connected to the initial net;
- and
- instructions for returning, on a second request from the user, the initial net and each additional net.
Dependencies are inferred from the claim text.