Circuit static time sequence analysis method and device, equipment, storage medium and program product
By determining the target circuit timing chart and designated node collection information in the circuit static timing analysis, timing path searches and calculating time margins, the problem of low timing analysis efficiency in the prior art is solved, and efficient timing analysis is achieved.
Patent Information
- Application Number
- CN202410950575.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-16
- Publication Date
- 2024-12-03
AI Technical Summary
In the system-level circuit static timing analysis, each node in the timing chart is accessed, resulting in a significant increase in timing analysis time in the case of multiple flip-flops in the design, affecting efficiency.
By determining the target circuit timing chart, obtaining the set information of the specified nodes, searching the target timing path, including the longest timing path and the shortest timing path, determining the total delay of the data transmission and the total delay of the clock transmission of the clock propagation path, and calculating the target time margin to improve the efficiency of timing analysis.
This method can quickly obtain timing analysis results and improve the efficiency of timing analysis, especially when there are many triggers in the design.
Smart Images

Figure CN119067026A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of timing analysis, and in particular to a circuit static timing analysis method, device, equipment, storage medium and program product. Background Art
[0002] For static timing analysis of system-level circuits, when performing analysis in the prior art, each node in the timing diagram is visited. When the number of triggers included in the designed circuit is large, the timing analysis time will be significantly increased, thereby affecting the efficiency of the timing analysis. Summary of the invention
[0003] The present invention provides a circuit static timing analysis method, device, equipment, storage medium and program product, which can improve the efficiency of circuit static timing analysis.
[0004] In a first aspect, an embodiment of the present disclosure provides a circuit static timing analysis method, comprising: determining a target circuit timing diagram based on a netlist file in a circuit to be analyzed; obtaining specified node set information based on a set static timing analysis constraint command; performing a target timing path search based on the specified node set information and the target circuit timing diagram to obtain a target timing path; wherein the target timing path includes a longest timing path and a shortest timing path; determining a target time margin based on a total data transmission delay corresponding to the target timing path and a total clock transmission delay corresponding to a set target clock propagation path; wherein the target time margin includes a setup time margin and a hold time margin; and determining a timing analysis result based on the target time margin.
[0005] In the second aspect, the embodiment of the present disclosure also provides a circuit static timing analysis device, including: a target circuit timing diagram determination module, used to determine the target circuit timing diagram according to the netlist file in the circuit to be analyzed; a specified node set information acquisition module, used to acquire the specified node set information based on the set static timing analysis constraint command; a target timing path determination module, used to search for the target timing path according to the specified node set information and the target circuit timing diagram, and obtain the target timing path; wherein the target timing path includes the longest timing path and the shortest timing path; a target time margin determination module, used to determine the target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path; wherein the target time margin includes a setup time margin and a hold time margin; a timing analysis result determination module, used to determine the timing analysis result according to the target time margin.
[0006] In a third aspect, an embodiment of the present disclosure further provides an electronic device, comprising: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the circuit static timing analysis method as described in the embodiment of the present disclosure.
[0007] In a fourth aspect, an embodiment of the present disclosure further provides a storage medium comprising computer executable instructions, which, when executed by a computer processor, are used to execute the circuit static timing analysis method as described in the embodiment of the present disclosure.
[0008] In a fifth aspect, an embodiment of the present disclosure further provides a computer program product, including a computer program, which, when executed by a processor, implements the circuit static timing analysis method as described in the embodiment of the present disclosure.
[0009] The technical solution of the disclosed embodiment is to determine the target circuit timing diagram according to the netlist file in the circuit to be analyzed; obtain the specified node set information based on the set static timing analysis constraint command; search the target timing path according to the specified node set information and the target circuit timing diagram to obtain the target timing path; wherein the target timing path includes the longest timing path and the shortest timing path; determine the target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path; wherein the target time margin includes the setup time margin and the hold time margin; determine the timing analysis result according to the target time margin. The disclosed embodiment obtains the specified node set information based on the set static timing analysis constraint command, searches the target timing path according to the specified node set information and the target circuit timing diagram, and obtains the target timing path, so that the target time margin can be quickly obtained, thereby improving the efficiency of timing analysis. BRIEF DESCRIPTION OF THE DRAWINGS
[0010] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale.
[0011] Figure 1 A schematic diagram of a flow chart of a circuit static timing analysis method provided by an embodiment of the present invention;
[0012] Figure 2 A gate-level network diagram provided for an embodiment of the present invention;
[0013] Figure 3A timing diagram of a target circuit provided by an embodiment of the present invention;
[0014] Figure 4 A combinational logic loop provided by an embodiment of the present invention;
[0015] Figure 5 A loop detection flow chart provided for an embodiment of the present invention;
[0016] Figure 6 Another gate-level network diagram provided for an embodiment of the present invention;
[0017] Figure 7 A schematic diagram of multiple different candidate constraint sub-paths provided by an embodiment of the present invention;
[0018] Figure 8 A multi-FPGA timing path diagram provided for an embodiment of the present invention;
[0019] Fig. 9 A schematic diagram of the structure of a circuit static timing analysis device provided by an embodiment of the present disclosure;
[0020] Fig.10 The present invention is a schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0021] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.
[0022] It should be understood that the various steps recorded in the method implementation of the present disclosure can be performed in different orders and / or in parallel. In addition, the method implementation may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect. The term "including" and its variations used herein are open inclusions, that is, "including but not limited to". It should be noted that the concepts of "first", "second", etc. mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units. It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative and not restrictive, and those skilled in the art should understand that unless otherwise clearly stated in the context, it should be understood as "one or more". It is understandable that the data involved in the present technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of the corresponding laws, regulations and relevant provisions.
[0023] Figure 1 A schematic flow chart of a circuit static timing analysis method provided by an embodiment of the present invention is provided. The embodiment of the present disclosure is applicable to a situation where a static timing analysis is performed on a designed circuit to check whether the setup time and hold time meet the requirements, thereby verifying whether the designed circuit meets the timing performance requirements. The method can be performed by a circuit static timing analysis device, which can be implemented in the form of software and / or hardware, and optionally, by an electronic device, which can be a mobile terminal, a PC, or a server, etc. Figure 1 As shown, the method includes:
[0024] S110, determining a target circuit timing diagram according to a netlist file in the circuit to be analyzed.
[0025] In this embodiment, the designed circuit can be represented by a netlist file, which can be a file that describes the topological structure between circuit elements, and describes information such as units, pins, ports, and connections. The netlist file can refer to a gate-level netlist generated after the register transfer level (RTL) circuit design is logically synthesized. The target circuit timing diagram can be understood as a directed acyclic graph. The target circuit timing diagram describes the topological connection relationship in the circuit design, and can also be understood as a graph structure in the data structure. The inputs and outputs of the logic units in the netlist file in the circuit to be analyzed, as well as the inputs and outputs of the triggers, can be abstracted as nodes in the target circuit timing diagram, and the internal timing arcs of the logic units and the connections between the basic units can be abstracted as edges of the target circuit timing diagram.
[0026] In this embodiment, the timing diagram can be converted according to the locatable points on the netlist file. Specifically, the inputs and outputs of the logic units, triggers, etc. in the netlist file of the circuit to be analyzed can be used as nodes of the timing diagram of the target circuit; the internal timing arcs of the logic units and the lines between the basic units can be used as edges of the timing diagram of the target circuit. For example, Figure 2 A gate-level network diagram is provided for an embodiment of the present invention. Figure 2 It includes triggers and 3 logic units ( Figure 2 The AND gate in can be a logic unit), Figure 2Clock in FF0 is a clock signal, FF0 and FF1 are both triggers, D in FF0 is pin D of trigger FF0 (can be used as node 10), and Q in FF0 is pin Q of trigger FF0 (can be used as node 11). D in FF1 is pin D of trigger FF1 (can be used as node 12), Q in FF1 is pin Q of trigger FF1 (can be used as node 13), the next node of node 13 in FF1 can be node Q2, and the next node of node 11 in FF0 can be node Q1. The input of one of the logic units includes nodes 4 and 5, and the output includes node 6. The previous node of node 4 can be node In1. The input and output of other logic units are similar and will not be repeated. Figure 3 A timing diagram of a target circuit provided by an embodiment of the present invention. Figure 3 It can be understood as Figure 2 The converted target circuit timing diagram is Figure 3 As can be seen in Figure 1, the target circuit timing diagram abstracts the topological connection relationship of the netlist file into timing nodes and timing edges. For example, the input and output of the logic unit, the input and output of the trigger are converted into nodes of the timing diagram.
[0027] Optionally, determining a target circuit timing diagram based on a netlist file in a circuit to be analyzed includes: converting the netlist file in the circuit to be analyzed into a corresponding circuit timing diagram; performing a loop detection on the circuit timing diagram to obtain a loop detection result; if the loop detection result includes a loop, removing an edge of any node in the loop to obtain a target circuit timing diagram; if the loop detection result does not include a loop, using the circuit timing diagram as the target circuit timing diagram.
[0028] In this embodiment, in the process of converting the netlist file in the circuit to be analyzed into the corresponding circuit timing diagram, loop detection can be performed on the circuit timing diagram. If the loop detection result does not include a loop, the circuit timing diagram can be directly used as the target circuit timing diagram.
[0029] In this embodiment, if the loop detection result includes a loop, the loop needs to be broken, and the circuit timing diagram after the breaking is used as the target circuit timing diagram. The operation of breaking the loop may be: removing an edge of any node in the loop. Figure 4 A combinational logic loop is provided in an embodiment of the present invention. Figure 4 The connection path of the S0, S1, S2, and S3 nodes in the network forms a logical loop. in1 and in2 are both input ports, and out is an output port. Specifically, loop detection can be performed using any search algorithm, such as a depth-first search algorithm and a breadth-first search algorithm.
[0030] Figure 5A loop detection flow chart provided for an embodiment of the present invention. S501. Initialize all nodes in the circuit timing diagram to white. Among them, white nodes indicate unvisited. S502. Select an unvisited node as the starting node and mark it in gray. Among them, gray nodes indicate that they are being visited. S503. Visit the adjacent nodes of the corresponding node. S504. Determine whether the color of the adjacent node is gray or black. If the color of the adjacent node is gray, execute S505; if the color of the adjacent node is not gray, execute S506.
[0031] S505: There is a loop in the circuit timing diagram, and the loop is cracked.
[0032] In this embodiment, during the detection process, if a loop is detected, the specific nodes of the loop can be recorded first, and the loop can be cracked after the loop detection is completed.
[0033] S506: Use a depth-first search algorithm to access adjacent nodes of the corresponding node.
[0034] In this embodiment, for the current gray node, an unvisited adjacent node is marked gray, and it is recursively visited. The specific steps are as follows: starting from the current gray node, visit an unvisited (white) adjacent node of the current gray node, mark this unvisited adjacent node as gray, indicating that it is being visited. Recursively perform a depth-first search on this newly marked gray node.
[0035] S507: Determine whether the adjacent nodes of the corresponding node have been visited. If the adjacent nodes of the corresponding node have not been visited, continue to execute S503. If the adjacent nodes of the corresponding node have been visited, execute S508.
[0036] The corresponding node is the current gray node. If all the adjacent nodes of the corresponding node are visited, it means there is no white adjacent node.
[0037] S508, mark the corresponding node in black. S509, determine whether all nodes in the circuit timing diagram have been visited. If all nodes in the circuit timing diagram have been visited, it means that there is no loop in the circuit timing diagram, and the process ends. If all nodes in the circuit timing diagram have not been visited, return to S502.
[0038] Among them, judging whether all nodes in the circuit timing diagram have been visited means judging whether there are unvisited nodes in the circuit timing diagram, that is, white nodes. If there are, return to S502 to select the next starting node; otherwise, it means that the circuit timing diagram has been completely traversed.
[0039] In this embodiment, loop detection by using a depth-first search algorithm combined with color attribute settings can effectively and accurately detect whether there is a loop in the circuit timing diagram.
[0040] S120 . Obtain designated node set information based on the set static timing analysis constraint command.
[0041] Among them, the static timing analysis constraint command is pre-set. The specified node set information is used to specify the nodes or paths that the target timing path needs to pass through, and can also be used to specify the longest timing path search or the shortest timing path search. The static timing analysis constraint command may include the specified node set information. The specified node set information may include the starting node, the middle point, the end point, and may also include the edges between the nodes. It may also include an establishment time identifier and a retention time identifier. The establishment time identifier is used to specify the longest timing path search. The retention time identifier is used to specify the shortest timing path search.
[0042] S130 , performing a target timing path search according to the designated node set information and the target circuit timing diagram to obtain a target timing path.
[0043] The target timing path includes the longest timing path and the shortest timing path.
[0044] In this embodiment, if the specified node set information includes the establishment time mark, the target timing path includes the longest timing path, that is, the target timing path search is performed according to the longest path concept. If the specified node set information includes the retention time mark, the target timing path includes the shortest timing path, that is, the target timing path search is performed according to the shortest path concept.
[0045] In this embodiment, multiple candidate constraint paths can be determined based on the specified node set information and the target circuit timing diagram, the distance from each node on the multiple candidate constraint paths to the starting node is determined, and the target timing path is selected from the multiple candidate constraint paths based on the distance from each node to the starting node.
[0046] Optionally, a target timing path search is performed based on the specified node set information and the target circuit timing diagram, including: determining at least one candidate constraint path based on the specified node set information and the target circuit timing diagram; if there is one candidate constraint path, then using the candidate constraint path as the target timing path; if there are multiple candidate constraint paths and there are no identical sub-paths between the multiple candidate constraint paths, then determining the target timing path based on the multiple candidate constraint paths.
[0047] In this embodiment, the corresponding candidate constraint paths may be found from the target circuit timing diagram according to the nodes specified in the specified node set information, and the candidate constraint paths include all the nodes specified in the specified node set information.
[0048] In this embodiment, there may be one or more candidate constraint paths. If there is one candidate constraint path, the candidate constraint path is used as the target timing path; if there are multiple candidate constraint paths, and there are no identical subpaths among the multiple candidate constraint paths, the distance from each node on the multiple candidate constraint paths to the starting node is determined, and the target timing path is selected from the multiple candidate constraint paths according to the distance from each node to the starting node.
[0049] Optionally, a target timing path search is performed based on the specified node set information and the target circuit timing diagram, including: if there are multiple candidate constraint paths and there are identical sub-paths among the multiple candidate constraint paths, then multiple different candidate constraint sub-paths are determined based on the multiple candidate constraint paths and the identical sub-paths; a target timing sub-path is determined based on the multiple different candidate constraint sub-paths; and the target timing sub-path and the identical sub-path are combined into a target timing path.
[0050] For example, Figure 6 Another gate-level network diagram provided for an embodiment of the present invention. F1, F2, and F3 are different field programmable gate arrays (FPGA). F1 includes 5 initiation triggers, represented by r1, r2, r3, r4, and r5, respectively. F1 also includes 5 different AND gates, represented by AND1, AND2, AND3, AND4, and AND5, respectively; F1 also includes a transmitting module time-division multiplexing (Time-Division Multiplexing, TDM) Tx1, which is used to perform TDM signal transmission with the receiving module TDM Rx1 in F2. The combinational logic LUT is located in F2, and the combinational logic LUT is represented by Pin1. F3 includes 5 capture triggers, represented by r6, r7, r8, r9, and r10, respectively. D in each trigger represents a data input pin, Q in each trigger represents a data output pin, and C in each trigger represents a clock pin. The transmitting module TDMTx2 in F2 performs TDM signal transmission with the receiving module TDM Rx2 in F3.
[0051] The existence of the same sub-path among multiple candidate constraint paths can be understood as the existence of the same sub-path among all candidate constraint paths.
[0052] For example, Figure 7Schematic diagram of multiple different candidate constraint subpaths provided for the embodiment of the present invention. If the content in the static timing analysis constraint command includes "from[get_cells r3]-through[get_pins F2 / LUT / Pin1]-to[get_cells r6]", that is, the starting node r3, the intermediate node (F2 / LUT / Pin1), and the end point r6 are specified. According to the static timing analysis constraint command and Figure 6 Three candidate constraint paths can be obtained, namely: r3->AND2->AND5-TDM Tx1->TDM R*1->TDM T*2->TDM R*2->r6, r3->AND4->TDM Tx1->TDM R*1->TDM T*2->TDM R*2->r6 and r3->AND5->TDM Tx1->TDM R*1->TDM T*2->TDM R*2->r6. The three candidate constraint paths have the same subpath, namely TDM Tx1->TDM R*1->TDM T*2->TDM R*2->r6, that is, the paths are the same on F2 and F3, but different on F1. Multiple different candidate constraint subpaths can be: r3->AND2->AND5-TDMTx1, r3->AND4->TDM Tx1 and r3->AND5->TDM Tx1.
[0053] Still Figure 7 For example, the process of determining the shortest timing sub-path is as follows: add the starting node r3 of the candidate constraint path to the queue; initialize the distances from the AND4 node, AND2 node, AND5 node, and TDM Tx1 node on all candidate constraint sub-paths to the starting node, and the initial distances are all set to infinity, and the distance from the starting node r3 to the starting node r3 is 0. When the queue is not empty, dequeue the first element r3 in the queue, the distance from the starting node r3 to the starting node r3 is 0, the distance from the starting node r3 to the adjacent node AND2 of r3 is 1, and their sum is 1, which is equal to the distance from the starting node r3 to AND2, and the distance from the AND2 node to the starting node is updated to 1 (that is, updated from infinity to 1). Add the AND2 node to the queue. The distance from the starting node r3 to the adjacent node AND4 of r3 is 3, and their sum is 3, which is equal to the distance from the starting node r3 to AND4, and the distance from the AND4 node to the starting node is updated to 3 (that is, updated from infinity to 3). Add the AND4 node to the queue. The distance from the starting node r3 to the adjacent node AND5 of r3 is 5, and their sum is 5, which is equal to the distance from the starting node r3 to AND5. The distance from the AND5 node to the starting node is updated to 5 (ie, updated from infinity to 5). The AND5 node is added to the queue.
[0054] Dequeue the first element AND2 in the queue. The distance between the starting node r3 and the AND2 node is 1, the distance from the AND2 node to the adjacent node of the AND2 node is 2, and their sum is 3. The distance from the starting node to the adjacent node AND5 of the AND2 node is 5, that is, 3 is less than 5. Update the distance from AND5 to the starting node to 3 (from 5 to 3).
[0055] Dequeue the first element AND4 in the queue. The distance between the starting node r3 and the AND4 node is 3, the distance from the AND4 node to the adjacent node of the AND4 node is 7, and their sum is 10. The distance from the starting node to the adjacent node TDM Tx1 of the AND4 node is infinity, that is, 10 is less than infinity. Update the distance from TDM Tx1 to the starting node to 10 (from infinity to 10).
[0056] Remove the first element AND5 from the queue. The distance between the starting node r3 and the AND5 node is 3. The distance between the AND5 node and the adjacent node TDM Tx1 of the AND5 node is 6. Their sum is 9. The distance between the starting node and the adjacent node TDMTx1 of the AND5 node is 10, which means 9 is less than 10. Update the distance from TDM Tx1 to the starting node to 9 (from 10 to 9). Add TDMTx1 to the queue.
[0057] Dequeue the first element TDM Tx1 of the queue. Since TDM Tx1 has no degree edge, no operation is performed and no update is required.
[0058] At this time, the queue is empty, the updated distance (ie, the shortest distance) from TDM Tx1 to the starting node r3 is 9, the shortest distance from AND5 to the starting node is 3, and the shortest distance from AND2 to the starting node is 1, so r3->AND2->AND5-TDM Tx1 is the shortest timing sub-path.
[0059] After obtaining the shortest timing sub-path, r3->AND2->AND5-TDM Tx1 and TDM Tx1->TDM R*1->TDM T*2->TDM R*2->r6 are combined into the target timing path r3->AND2->AND5-TDM Tx1->TDM R*1->TDM T*2->TDM R*2->r6.
[0060] Still Figure 7Taking as an example, the process of determining the longest timing sub-path is as follows: add the starting node r3 of the candidate constraint path to the queue; initialize the distances from the AND4 node, AND2 node, AND5 node, and TDM Tx1 node on all candidate constraint sub-paths to the starting node, and the initial distances are all set to 0, and the distance from the starting node r3 to the starting node r3 is 0.
[0061] When the queue is not empty, the first element r3 in the queue is dequeued, the distance from the starting node r3 to the starting node r3 is 0, the distance from the starting node r3 to the adjacent node AND2 of r3 is 1, and their sum is 1, which is equal to the distance from the starting node r3 to AND2, and the distance from the AND2 node to the starting node is updated to 1 (i.e., updated from 0 to 1). The AND2 node is added to the queue. The distance from the starting node r3 to the adjacent node AND4 of r3 is 3, and their sum is 3, which is equal to the distance from the starting node r3 to AND4, and the distance from the AND4 node to the starting node is updated to 3 (i.e., updated from 0 to 3). The AND4 node is added to the queue. The distance from the starting node r3 to the adjacent node AND5 of r3 is 5, and their sum is 5, which is equal to the distance from the starting node r3 to AND5, and the distance from the AND5 node to the starting node is updated to 5 (i.e., updated from 0 to 5). The AND5 node is added to the queue.
[0062] Dequeue the first element AND2 in the queue. The distance between the starting node r3 and the AND2 node is 1, the distance between the AND2 node and the adjacent node of the AND2 node is 2, and their sum is 3. The distance from the starting node to the adjacent node AND5 of the AND2 node is 5, that is, 3 is less than 5, so no update is required and no operation is performed.
[0063] The first element AND4 in the queue is dequeued. The distance between the starting node r3 and the AND4 node is 3, the distance between the AND4 node and the adjacent node of the AND4 node is 7, and their sum is 10. The distance from the starting node to the adjacent node TDM Tx1 of the AND4 node is 0, that is, 10 is greater than 0. The distance from TDM Tx1 to the starting node is updated to 10 (from 0 to 10).
[0064] Remove the first element AND5 from the queue. The distance between the starting node r3 and the AND5 node is 5, and the distance between the AND5 node and the adjacent node TDM Tx1 of the AND5 node is 6. Their sum is 11. The distance between the starting node and the adjacent node TDMTx1 of the AND5 node is 10, that is, 11 is greater than 10. Update the distance from TDM Tx1 to the starting node to 11 (from 10 to 11). Add TDM Tx1 to the queue.
[0065] Dequeue the first element TDM Tx1 of the queue. Since TDM Tx1 has no degree edge, no operation is performed and no update is required.
[0066] At this time, the queue is empty, the updated distance (ie, the longest distance) from TDM Tx1 to the starting node r3 is 11, and the longest distance from AND5 to the starting node is 5, so r3->AND5->TDMTx1 is the longest timing sub-path.
[0067] After obtaining the longest timing sub-path, r3->AND5->TDMTx1 and TDM Tx1->TDM R*1->TDM T*2->TDM R*2->r6 are combined into the target timing path r3->AND5->TDMTx1>TDM R*1->TDM T*2->TDM R*2->r6.
[0068] In this embodiment, when there is an identical sub-path between multiple candidate constraint paths, the target timing sub-path is determined based on the multiple different candidate constraint sub-paths; and then the target timing sub-path and the identical sub-path are combined into a target timing path. There is no need to calculate the distance between the nodes on the same sub-path and the starting node, thereby reducing the amount of calculation, speeding up the search speed, and improving the search efficiency, thereby improving the efficiency of determining the target timing path.
[0069] Optionally, a target timing path is determined based on multiple candidate constraint paths, including: adding the starting node of the candidate constraint path to a queue; initializing the distance from the node on the candidate constraint path to the starting node; when the queue is not empty, dequeuing the first element in the queue; if the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is less than or equal to the distance from the starting node to the adjacent node of the first element, updating the distance from the adjacent node of the first element to the starting node; adding the adjacent node to a queue; wherein the adjacent node is a node on the candidate constraint path; if the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is greater than the distance from the starting node to the adjacent node of the first element, or the first element has no out-degree edge, no operation is performed; when the queue is empty, determining the shortest timing path based on the distance from the node on the updated candidate constraint path to the starting node.
[0070] It should be noted that since the process of determining the shortest timing path according to the multiple different candidate constraint paths is similar to the process of determining the shortest timing sub-path according to the multiple different candidate constraint sub-paths, it will not be repeated in this embodiment. The difference is that the distances of all nodes on the multiple different candidate constraint paths to the starting node need to be calculated (including updating), and the shortest timing path can be directly obtained based on the distances from the nodes on the updated candidate constraint paths to the starting node. The shortest timing path includes all specified nodes in the specified node set information.
[0071] In this embodiment, the starting node of the candidate constraint path is added to a queue, and the first element in the queue is removed from the queue. The distance from the adjacent node of the first element to the starting node is updated by judging whether the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is less than or equal to the distance from the starting node to the adjacent node of the first element, and the adjacent point is added to the queue, that is, the shortest distance between the node on the candidate constraint path and the starting node is calculated, so that the shortest timing path can be found quickly and accurately.
[0072] Optionally, a target timing path is determined based on multiple candidate constraint paths, including: adding the starting node of the candidate constraint path to a queue; initializing the distance from the node on the candidate constraint path to the starting node; when the queue is not empty, dequeuing the first element in the queue; if the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is greater than or equal to the distance from the starting node to the adjacent node of the first element, updating the distance from the adjacent node of the first element to the starting node; adding the adjacent node to a queue; wherein the adjacent node is a node on the candidate constraint path; if the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is less than the distance from the starting node to the adjacent node of the first element, or the first element has no out-degree edge, no operation is performed; when the queue is empty, determining the longest timing path based on the distance from the node on the updated candidate constraint path to the starting node.
[0073] It should be noted that since the process of determining the longest timing path according to the multiple different candidate constraint paths is similar to the process of determining the longest timing sub-path according to the multiple different candidate constraint sub-paths, it will not be repeated in this embodiment. The difference is that the distances from the starting node to the nodes on all the multiple different candidate constraint paths need to be calculated (including updating), and the longest timing path can be directly obtained based on the distances from the nodes on the updated candidate constraint paths to the starting node. The longest timing path includes all the specified nodes in the specified node set information.
[0074] In this embodiment, the starting node of the candidate constraint path is added to a queue, and the first element in the queue is removed from the queue. The distance from the adjacent node of the first element to the starting node is updated by judging whether the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is greater than or equal to the distance from the starting node to the adjacent node of the first element, and the adjacent point is added to the queue, that is, the longest distance between the node on the candidate constraint path and the starting node is calculated, so that the longest timing path can be found quickly and accurately.
[0075] S140, determining a target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path.
[0076] Wherein, the target time margin includes a setup time margin and a hold time margin. Wherein, the target clock propagation path includes a minimum clock propagation path and a maximum clock propagation path. The minimum clock propagation path can be understood as the shortest path for the clock signal to reach the capture trigger. The maximum clock propagation path can be understood as the longest path for the clock signal to reach the capture trigger.
[0077] In this embodiment, if the target timing path is the longest timing path, the set target clock propagation path is the minimum clock propagation path. Therefore, the setup time margin can be determined according to the total data transmission delay corresponding to the longest timing path and the total clock transmission delay corresponding to the set minimum clock propagation path.
[0078] In this embodiment, if the target timing path is the shortest timing path, the set target clock propagation path is the maximum clock propagation path. The hold time margin is determined according to the total data transmission delay corresponding to the shortest timing path and the total clock transmission delay corresponding to the set maximum clock propagation path.
[0079] Optionally, the target time margin is determined based on the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path, including: determining the establishment time margin based on the total data transmission delay corresponding to the longest timing path and the total clock transmission delay corresponding to the set minimum clock propagation path.
[0080] Exemplarily, the setup time margin formula is as follows:
[0081] T setup_stack =T require (min)-T arrival (Max)
[0082] Among them, T setup_slack For the setup time margin, T require(min) represents the total clock transmission delay corresponding to the set minimum clock propagation path, T arrival (Max) represents the total data transmission delay corresponding to the longest timing path. Among them, the minimum clock propagation path can be directly obtained according to the shortest path algorithm.
[0083] Optionally, the target time margin is determined based on the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path, including: determining the hold time margin based on the total data transmission delay corresponding to the shortest timing path and the total clock transmission delay corresponding to the set maximum clock propagation path.
[0084] Exemplarily, the hold time margin formula is as follows:
[0085] T hold_slack =T arrival (min)-T require1 (max)
[0086] Among them, T hold_slack For the setup time margin, T require1 (max) represents the total clock transmission delay corresponding to the set maximum clock propagation path, T arrival (min) represents the total data transmission delay corresponding to the shortest timing path. Among them, the maximum clock propagation path can be directly obtained according to the longest path algorithm. The idea of the shortest path algorithm is opposite to that of the longest path algorithm.
[0087] S150: Determine a timing analysis result according to the target time margin.
[0088] In this embodiment, the timing analysis result can be determined by judging whether the target time margin is a positive value. The timing analysis result includes hold time timing analysis passing, setup time timing analysis passing, hold time timing analysis failing, and setup time timing analysis failing.
[0089] Optionally, determining the timing analysis result based on the target time margin includes: if the target time margin is the setup time margin, and the target time margin is a positive value, then the timing analysis result includes that the setup time timing analysis passes; if the target time margin is the hold time margin, and the target time margin is a positive value, then the timing analysis result includes that the hold time timing analysis passes.
[0090] In this embodiment, if the target time margin is the setup time margin and the target time margin is a positive value, the timing analysis result includes that the setup time timing analysis passes; if the setup time margin is not a positive value, the timing analysis result includes that the setup time timing analysis fails.
[0091] In this embodiment, if the target time margin is the hold time margin and the target time margin is a positive value, the timing analysis result includes that the hold time timing analysis passes; if the hold time margin is not a positive value, the timing analysis result includes that the hold time timing analysis fails.
[0092] For example, Figure 8 A multi-FPGA timing path diagram provided for an embodiment of the present invention. Figure 8 The timing path from the launch trigger to the capture trigger in multiple FPGAs. Figure 8 Only two FPGAs are shown, namely FPGA1 and FPGA2. The two flip-flops are located on different FPGAs. FPGA1 includes a launch flip-flop responsible for sending data, referred to as FF0, and FF0 includes a data input pin D and a data output pin Q. FPGA2 includes a capture flip-flop responsible for receiving data, referred to as FF1, and FF1 includes a data input pin D and a data output pin Q. Figure 8 Medium T launch is the delay from the clock source CLK to the clock end of the trigger FF0, T c2q is the propagation delay from the clock end to the output end of the trigger FF0, T dp1 It is the propagation delay from the data end of the trigger FF0 through the combinational logic (Logic) to the transmitter module TDM. TX and RX are the internal delays of the transmitter and receiver of the TDM module respectively. Twire is the wire delay between the transmitter module TDM and the receiver module TDM. dp2 It is the propagation delay from the receiving module TDM through the combinational logic to the data input of the capture trigger FF1. capture The delay from the clock source CLK to the clock terminal of the capture trigger FF1. A represents the input port and Z represents the output port. Figure 8 The yellow paths in the figure represent the target timing paths, and the blue paths represent the target clock propagation paths.
[0093] It should be noted that the following formula and Figure 8 The main purpose is to facilitate the explanation of the components of setup time margin, hold time margin, T arrival 、T require and T require1 rather than specific embodiments.
[0094] The setup time refers to the shortest time that the data should remain stable before the effective clock edge arrives. The data arrival time T arrival is the time it takes for data to reach the capture trigger, and the corresponding Tarrival The formulas include:
[0095] T arrival =T launch +T c2q +T dp1 +T tx +T wire +T rx +T dp2
[0096] Among them, T tx Indicates the internal delay of the TDM module transmitter. rx Indicates the internal delay of the TDM module receiving end.
[0097] The latest time allowed to meet the establishment time requirement can be expressed as T require , the corresponding T require The formula includes:
[0098] T require =T capture +T cycle -T setup
[0099] Among them, T cycle Represents the clock period, T setup Indicates the establishment time.
[0100] The setup time margin is the latest data arrival time minus the data arrival time. The formula for the setup time margin is:
[0101] T setup_slack =T require -T arrival
[0102] When T require Minimum, T arrival Maximum, and the setup time margin T setup_slack When it is a positive value, the setup time requirement is met, that is, the setup time timing analysis passes.
[0103] Hold time can be referred to as the minimum time that the data input signal must remain stable after the clock valid edge.
[0104] The shortest time allowed to meet the hold time requirement can be expressed as T require1 , the corresponding T require1 The formula includes: T require1 =T capture +T hold
[0105] Among them, T hold Indicates the hold time.
[0106] The hold time margin is the data arrival time minus the earliest data arrival time. The formula for the hold time margin is:
[0107] T hold_slack =T arrival -T require1
[0108] When T arrival Minimum, T require1 Maximum, and hold time margin T hold_slack When it is a positive value, the hold time requirement is met, that is, the hold time timing analysis passes.
[0109] The technical solution of the disclosed embodiment is to determine the target circuit timing diagram according to the netlist file in the circuit to be analyzed; obtain the specified node set information based on the set static timing analysis constraint command; search the target timing path according to the specified node set information and the target circuit timing diagram to obtain the target timing path; wherein the target timing path includes the longest timing path and the shortest timing path; determine the target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path; wherein the target time margin includes the setup time margin and the hold time margin; determine the timing analysis result according to the target time margin. The disclosed embodiment obtains the specified node set information based on the set static timing analysis constraint command, searches the target timing path according to the specified node set information and the target circuit timing diagram, and obtains the target timing path, so that the target time margin can be quickly obtained, thereby improving the efficiency of timing analysis.
[0110] Fig. 9 A schematic diagram of the structure of a circuit static timing analysis device provided by an embodiment of the present disclosure is shown in FIG. Fig. 9 As shown, the device includes: a target circuit timing diagram determination module 910, a designated node set information acquisition module 920, a target timing path determination module 930, a target time margin determination module 940 and a timing analysis result determination module 950;
[0111] A target circuit timing diagram determination module 910 is used to determine the target circuit timing diagram according to the netlist file in the circuit to be analyzed;
[0112] The designated node set information acquisition module 920 is used to acquire the designated node set information based on the set static timing analysis constraint command;
[0113] A target timing path determination module 930 is used to search for a target timing path according to the specified node set information and the target circuit timing diagram to obtain a target timing path; wherein the target timing path includes a longest timing path and a shortest timing path;
[0114] A target time margin determination module 940 is used to determine a target time margin according to a total data transmission delay corresponding to the target timing path and a total clock transmission delay corresponding to a set target clock propagation path; wherein the target time margin includes a setup time margin and a hold time margin;
[0115] The timing analysis result determination module 950 is used to determine the timing analysis result according to the target time margin.
[0116] The technical solution of the disclosed embodiment is to determine the target circuit timing diagram according to the netlist file in the circuit to be analyzed through the target circuit timing diagram determination module; obtain the specified node set information based on the set static timing analysis constraint command through the specified node set information acquisition module; search the target timing path according to the specified node set information and the target circuit timing diagram through the target timing path determination module to obtain the target timing path; wherein the target timing path includes the longest timing path and the shortest timing path; determine the target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path through the target time margin determination module; wherein the target time margin includes the setup time margin and the hold time margin; determine the timing analysis result according to the target time margin through the timing analysis result determination module. In the disclosed embodiment, the target time margin can be quickly obtained by obtaining the specified node set information based on the set static timing analysis constraint command, searching the target timing path according to the specified node set information and the target circuit timing diagram, and obtaining the target timing path, thereby improving the efficiency of timing analysis. The circuit static timing analysis device provided in the embodiments of the present disclosure can execute the circuit static timing analysis method provided in any embodiment of the present disclosure, and has the corresponding functional modules and beneficial effects of the execution method.
[0117] Fig.10A schematic diagram of the structure of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.
[0118] like Fig.10 As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.
[0119] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.
[0120] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The processor 11 performs the various methods and processes described above, such as method circuit static timing analysis.
[0121] In some embodiments, the method circuit static timing analysis may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the method circuit static timing analysis described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the method circuit static timing analysis in any other appropriate manner (e.g., by means of firmware).
[0122] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.
[0123] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0124] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0125] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).
[0126] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.
[0127] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.
[0128] An embodiment of the present invention further provides a computer program product, including a computer program, which, when executed by a processor, implements a circuit static timing analysis method as provided in any embodiment of the present application.
[0129] In the process of implementation, the computer program product can be written in one or more programming languages or a combination thereof to perform the computer program code of the present invention, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (for example, using an Internet service provider to connect through the Internet).
[0130] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims
1. A circuit static timing analysis method, It is characterized in that include: Determine the timing diagram of the target circuit according to the netlist file in the circuit to be analyzed; Get the specified node set information based on the set static timing analysis constraint command; Performing a target timing path search according to the designated node set information and the target circuit timing diagram to obtain a target timing path; wherein the target timing path includes a longest timing path and a shortest timing path; Determine a target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path; wherein the target time margin includes a setup time margin and a hold time margin; A timing analysis result is determined according to the target time margin.
2. The method according to claim 1, It is characterized in that Determine the target circuit timing diagram based on the netlist file in the circuit to be analyzed, including: Converting the netlist file in the circuit to be analyzed into a corresponding circuit timing diagram; Performing loop detection on the circuit timing diagram to obtain a loop detection result; If the loop detection result includes a loop, an edge of any node in the loop is removed to obtain a target circuit timing diagram; If the loop detection result does not include a loop, the circuit timing diagram is used as the target circuit timing diagram.
3. The method according to claim 1, It is characterized in that Performing a target timing path search according to the designated node set information and the target circuit timing diagram includes: Determine at least one candidate constraint path according to the specified node set information and the target circuit timing diagram; If there is one candidate constraint path, the candidate constraint path is used as the target timing path; If there are multiple candidate constraint paths, and there are no identical subpaths among the multiple candidate constraint paths, then the target timing path is determined according to the multiple candidate constraint paths.
4. The method according to claim 3, It is characterized in that Performing a target timing path search according to the designated node set information and the target circuit timing diagram includes: If there are multiple candidate constraint paths, and there are identical subpaths among the multiple candidate constraint paths, then determining multiple different candidate constraint subpaths according to the multiple candidate constraint paths and the identical subpaths; Determine a target timing subpath according to the plurality of different candidate constraint subpaths; The target timing sub-path and the same sub-path are combined into a target timing path.
5. The method according to claim 3, It is characterized in that Determine the target timing path based on multiple candidate constraint paths, including: Adding the starting node of the candidate constraint path to a queue; Initialize the distance from the node on the candidate constraint path to the starting node; When the queue is not empty, dequeue the first element in the queue; If the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is less than or equal to the distance from the starting node to the adjacent node of the first element, then update the distance from the adjacent node of the first element to the starting node; add the adjacent node to the queue; wherein the adjacent node is a node on the candidate constraint path; If the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is greater than the distance from the starting node to the adjacent node of the first element, or the first element has no out-degree edge, no operation is performed; When the queue is empty, the shortest sequential path is determined according to the distance from the node on the updated candidate constraint path to the start node.
6. The method according to claim 3, It is characterized in that Determine the target timing path based on multiple candidate constraint paths, including: Adding the starting node of the candidate constraint path to a queue; Initialize the distance from the node on the candidate constraint path to the starting node; When the queue is not empty, dequeue the first element in the queue; If the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is greater than or equal to the distance from the starting node to the adjacent node of the first element, then update the distance from the adjacent node of the first element to the starting node; add the adjacent node to the queue; wherein the adjacent node is a node on the candidate constraint path; If the sum of the distance from the starting node to the first element and the distance from the first element to the adjacent node of the first element is less than the distance from the starting node to the adjacent node of the first element, or the first element has no out-degree edge, no operation is performed; When the queue is empty, the longest sequential path is determined according to the distance from the node on the updated candidate constraint path to the start node.
7. The method according to claim 1, It is characterized in that in, The target clock propagation path includes a minimum clock propagation path; Determining a target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path includes: The setup time margin is determined according to the total data transmission delay corresponding to the longest timing path and the total clock transmission delay corresponding to the set minimum clock propagation path.
8. The method according to claim 1, It is characterized in that in, The target clock propagation path includes a maximum clock propagation path; Determining a target time margin according to the total data transmission delay corresponding to the target timing path and the total clock transmission delay corresponding to the set target clock propagation path includes: The hold time margin is determined according to the total data transmission delay corresponding to the shortest timing path and the total clock transmission delay corresponding to the set maximum clock propagation path.
9. The method according to claim 1, It is characterized in that Determine a timing analysis result according to the target time margin, including: If the target time margin is a setup time margin, and the target time margin is a positive value, the timing analysis result includes that the setup time timing analysis passes; If the target time margin is a hold time margin, and the target time margin is a positive value, the timing analysis result includes that the hold time timing analysis is passed.
10. A circuit static timing analysis device, It is characterized in that include: A target circuit timing diagram determination module is used to determine the target circuit timing diagram according to the netlist file in the circuit to be analyzed; A designated node set information acquisition module is used to acquire designated node set information based on a set static timing analysis constraint command; A target timing path determination module, configured to search for a target timing path according to the specified node set information and the target circuit timing diagram, and obtain a target timing path; wherein the target timing path includes a longest timing path and a shortest timing path; A target time margin determination module, used to determine a target time margin according to a total data transmission delay corresponding to the target timing path and a total clock transmission delay corresponding to a set target clock propagation path; wherein the target time margin includes a setup time margin and a hold time margin; The timing analysis result determination module is used to determine the timing analysis result according to the target time margin.
11. An electronic device, It is characterized in that The electronic device comprises: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the circuit static timing analysis method as described in any one of claims 1 to 9.
12. A storage medium comprising computer executable instructions, wherein the computer executable instructions are used to perform the circuit static timing analysis method according to any one of claims 1 to 9 when executed by a computer processor.
13. A computer program product comprising a computer program, It is characterized in that When the computer program is executed by a processor, the computer program implements the circuit static timing analysis method according to any one of claims 1 to 9.
Citation Information
Cited By
Time sequence path searching method based on label, electronic equipment and medium
CN122196058A
