System and method for analyzing a circuit
A system and method for analyzing a circuit. In one embodiment, a tool generates path information based upon a netlist that describes the circuit. A synthesizer generates a nodal data structure responsive to the path information. A parser is operable to parse a nodal query to provide a tree structure such that each leaf of the tree structure comprises a segmented expression of the nodal query. A resolver accesses the nodal data structure and tree structure in order to generate a solution set that satisfies at least one of the segmented expressions.
1 . A system for analyzing a circuit, comprising:
a tool for generating path information based upon a netlist that describes said circuit;
a synthesizer for generating a nodal data structure responsive to said path information;
a parser operable to parse a nodal query to provide a tree structure, wherein each leaf of said tree structure comprises a segmented expression of said nodal query; and
a resolver, responsive to said nodal data structure and tree structure, for generating a solution set that satisfies at least one of said segmented expressions.
2 . The system as recited in claim 1 , wherein said path information comprises an electrical route coupling a plurality of nodes of said circuit.
3 . The system as recited in claim 1 , wherein said nodal data structure comprises a plurality of tuples associated with a circuit node, each tuple having multiple path object and a position object.
4 . The system as recited in claim 1 , wherein said nodal query comprises an expression having one or more nodes joined by one or more logical operators.
5 . The system as recited in claim 4 , wherein said logical operators are selected from the group consisting of AND, OR, and NOT.
6 . The system as recited in claim 4 , wherein said logical operators comprise operators that express a position of a node with respect to a position of another node.
7 . The system as recited in claim 1 , wherein said solution set comprises a null set.
8 . The system as recited in claim 1 , wherein said solution set comprises at least one path.
9 . A method for analyzing a circuit, comprising:
generating path information based upon a netlist that describes said circuit;
responsive to said path information, synthesizing a nodal data structure;
parsing a nodal query to provide a tree structure, wherein each leaf of said tree structure comprises a segmented expression of said nodal query; and
resolving, responsive to said nodal data structure and tree structure, a solution set that satisfies at least one of said segmented expressions.
10 . The method as recited in claim 9 , wherein generating said path information comprises generating a list of electrical routes that each couple a plurality of nodes of said circuit.
11 . The method as recited in claim 9 , wherein synthesizing said nodal data structure comprises generating a plurality of tuples associated with a circuit node, each tuple having a path object and a position object associated with said circuit node.
12 . The method as recited in claim 9 , wherein parsing said nodal query is performed by a recursive descent parser.
13 . The method as recited in claim 9 , wherein parsing said nodal query is performed by a shift-reduce parser.
14 . The method as recited in claim 9 , wherein parsing said nodal query comprises utilizing a logical syntax that includes operators selected from the group consisting of AND, OR, and NOT.
15 . The method as recited in claim 9 , wherein parsing said nodal query comprises utilizing a logical syntax that includes operators that express a position of a node with respect to a position of another node.
16 . The method as recited in claim 9 , wherein said solution set comprises a null set.
17 . The method as recited in claim 9 , wherein said solution set comprises at least one path.
18 . A system for analyzing a circuit, comprising:
means for generating path information based upon a netlist that describes said circuit;
means, responsive to said path information, for synthesizing a nodal data structure;
means for parsing a nodal query to provide a tree structure, wherein each leaf of said tree structure comprises a segmented expression of said nodal query; and
means, responsive to said nodal data structure and tree structure, for resolving a solution set that satisfies at least one of said segmented expressions.
19 . The system as recited in claim 18 , wherein said path information comprises a list of electrical routes that each couple a plurality of nodes of said circuit.
20 . The system as recited in claim 18 , wherein said nodal data structure comprises a plurality of tuples associated with a circuit node, each tuple having a path object and a position object.
21 . The system as recited in claim 18 , wherein said nodal query comprises an expression having one or more nodes joined by one or more logical operators.
22 . The system as recited in claim 21 , wherein said logical operators are selected from the group consisting of AND, OR, and NOT.
23 . The system as recited in claim 21 , wherein said logical operators comprise operators that express a position of a node with respect to a position of another node.
24 . The system as recited in claim 18 , wherein said solution set comprises a null set.
25 . The system as recited in claim 18 , wherein said solution set comprises at least one path.