Layout processing method and device and computer readable storage medium

By sorting and traversing the processing module based on the call information in the layout processing, the problem of large amount of data in the layout leveling processing is solved, and efficient leveling processing is achieved, reducing duplicate calculations and reducing data volume.

CN118940711AActive Publication Date: 2024-11-12SEMITRONIX
View PDF 11 Cites 0 Cited by

Patent Information

Application Number
CN202411428046.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-14
Publication Date
2024-11-12
Estimated Expiration
2044-10-14

AI Technical Summary

Technical Problem

In ultra-large-scale integrated circuit design, there are a large number of repeated calculations during the layout leveling process, resulting in a large amount of data, and the existing technology has failed to effectively solve this problem.

Method used

By obtaining layout information, sorting based on the module's call information, traversal obtaining the information of each module, and transforming the submodules according to the sorting results, reducing duplicate processing, realizing traversal to level multiple modules at one time, and reducing the amount of data.

Benefits of technology

Through this method, the number of repeated calculations during the leveling process is reduced, the amount of data is reduced, and the processing efficiency is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118940711A_ABST
    Figure CN118940711A_ABST
Patent Text Reader

Abstract

The invention relates to a layout processing method and device and a computer readable storage medium, and the method comprises the steps: obtaining layout information which comprises a plurality of modules and calling information of the plurality of modules; sorting the plurality of modules based on the calling information to obtain a sorting result; traversing to obtain module information of each module; according to the sorting result, the modules are traversed in sequence for planishing processing, and a processing result is obtained; wherein the planishing processing comprises the following steps: acquiring a sub-module called by the module and calling information, and performing transformation processing on the module information of the sub-module based on the calling information to obtain a transformation result; and adding the conversion result to the module information of the module for updating. The layout is planarized in a manner of shifting the called module, so that the data volume in the planarizing process is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of integrated circuit design, and in particular to a layout processing method, device and computer-readable storage medium. Background Art

[0002] EDA (Electronic Design Automation) tools in the field of integrated circuits use a flattening mode for inter-layer Boolean operations or DRC (design rule check) checks. Therefore, in actual graphics operations, it is often necessary to flatten the hierarchy to obtain the relevant connections between graphics, that is, the layout layers need to be quickly flattened.

[0003] However, in the prior art of VLSI design, a common method for flattening layout data files is mainly based on loop recursion, but this method involves a large amount of repeated calculations, resulting in a large amount of data in the flattening process.

[0004] With regard to the problem of large amount of data in the layout flattening process in related technologies, no effective solution has been proposed so far. Summary of the invention

[0005] In this embodiment, a layout processing method, device and computer-readable storage medium are provided to solve the problem of large amount of data in the layout flattening process in the related art.

[0006] In a first aspect, a layout processing method is provided in this embodiment, and the method includes: Acquire layout information, wherein the layout information includes multiple modules and call information of the multiple modules; Based on the call information, the multiple modules are sorted to obtain a sorting result; Traverse and obtain the module information of each module; According to the sorting result, traverse the multiple modules in sequence to perform leveling processing to obtain a processing result; The flattening process includes: obtaining the submodule and calling information called by the module, transforming the module information of the submodule based on the calling information to obtain a transformation result; and adding the transformation result to the module information of the module for updating.

[0007] In some embodiments, the module information includes basic pixels in the module and offset information corresponding to the basic pixels; and the transforming the module information of the submodule based on the calling information to obtain the transformation result includes: Based on the calling information of the module to the submodule, the basic pixels and offset information of the submodule are correspondingly transformed to obtain the transformed pixels and the transformed offset information; The transformation result includes the transformation pixel and the transformation offset information. In some embodiments, adding the transformation result to the module information of the module for updating includes: Adding the transformed pixel to the base pixel of the module to update the base pixel; The transformed offset information is added to the offset information of the module to update the offset information.

[0008] In some of the embodiments, obtaining the processing result includes: The basic pixels and offset information of the module sorted last in the sorting result are output as the processing result.

[0009] In some of the embodiments, the traversing and obtaining module information of each module includes: According to the sorting result, the module information of each module is traversed and obtained.

[0010] In some of the embodiments, the calling information includes the location information of the submodule, and the information of offset, rotation, magnification and mirroring processing of the submodule; The basic graphic element includes at least one of a polygon, a path, a circle and a rectangle; The offset information includes at least one of offset, rotation, magnification and mirror processing information.

[0011] In some embodiments, the sorting of the multiple modules based on the call information to obtain the sorting result includes: According to a preset sorting strategy and the call information, the multiple modules are sorted to determine the module vector of the layout; The sorting result is determined according to the module vector.

[0012] In some embodiments, the sorting of the multiple modules to obtain a sorting result further includes: Acquire a first module and a second module; the second module calls the first module; Acquire calling information of the first module, and determine the order of the first modules according to the calling information; Determine the order of the second modules according to the order of the first modules and the calling information of the second modules, and obtain a sorting result; Among them, in the sorting result, the order of the first module is before the order of the second module.

[0013] In some of the embodiments, after obtaining the processing result, the method further includes: Based on different layout processing requirements and based on the processing results, at least one of design rule checking, layout parameter extraction, layout interface display and layout layer operation is performed on the layout.

[0014] In a second aspect, a layout processing device is provided in this embodiment, the device comprising: a sorting module, a traversal module and a processing module; The sorting module is used to obtain layout information, the layout information includes multiple modules and calling information of the multiple modules; and is also used to sort the multiple modules based on the calling information to obtain a sorting result; The traversal module is used to traverse and obtain module information of each module; The processing module is used to traverse the multiple modules in turn according to the sorting result to perform flattening processing and obtain a processing result; wherein the flattening processing includes: obtaining the sub-module and calling information called by the module, transforming the module information of the sub-module based on the calling information to obtain a transformation result; and adding the transformation result to the module information of the module to update it.

[0015] According to a third aspect, a computer storage medium is provided in this embodiment, on which a computer program is stored, and when the program is executed by a processor, the layout processing method described in the first aspect is implemented.

[0016] Compared with the related art, a layout processing method, device and computer-readable storage medium are provided in this embodiment. After acquiring layout information, the modules are sorted according to the calling information of the modules in the layout information, and the sorting result is obtained; then the module information of each module is traversed to establish the index of the basic pixels and corresponding offset information of the module, and multiple modules are traversed according to the sorting result; based on the sub-modules and calling information called by the module, the module information of the sub-module is transformed to obtain the transformation result, and the module information of multiple modules is updated according to the transformation result to realize the flattening processing of multiple modules, and then the flattening processing result of the layout is obtained. By traversing and flattening multiple modules at one time, the number of repeated processing is reduced, thereby reducing the amount of data in the flattening processing process.

[0017] Details of one or more embodiments of the present application are set forth in the following drawings and description to make other features, objects, and advantages of the present application more readily apparent. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings: Figure 1 is a hardware structure block diagram of a terminal of the layout processing method of this embodiment; Figure 2 is a flow chart of a layout processing method according to an embodiment of the present application; Figure 3 is a flow chart of a method for flattening a layout layer of this specific embodiment; Figure 4 is a schematic diagram of a call hierarchy tree provided by this specific embodiment; Figure 5 is a schematic diagram of a sorting result provided in an embodiment of the present application; Figure 6 This is a schematic diagram of module information transformation provided by this specific embodiment; Figure 7 It is a structural block diagram of the layout processing device of an embodiment of the present application. DETAILED DESCRIPTION

[0019] In order to more clearly understand the purpose, technical solutions and advantages of the present application, the present application is described and illustrated below in conjunction with the accompanying drawings and embodiments.

[0020] Unless otherwise defined, the technical terms or scientific terms involved in this application shall have the general meaning understood by people with general skills in the technical field to which this application belongs. The words "one", "a", "a", "the", "these" and the like in this application do not indicate a quantitative limitation, and they may be singular or plural. The terms "include", "comprise", "have" and any variants thereof involved in this application are intended to cover non-exclusive inclusions; for example, a process, method and system, product or device comprising a series of steps or modules (units) is not limited to the listed steps or modules (units), but may include unlisted steps or modules (units), or may include other steps or modules (units) inherent to these processes, methods, products or devices. The words "connect", "connected", "coupled" and the like involved in this application are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The "multiple" involved in this application refers to two or more. "And / or" describes the association relationship of associated objects, indicating that there may be three relationships, for example, "A and / or B" may mean: A exists alone, A and B exist at the same time, and B exists alone. Generally, the character " / " indicates that the objects associated with each other are in an "or" relationship. The terms "first", "second", "third", etc. in this application are only used to distinguish similar objects and do not represent a specific ordering of the objects.

[0021] The method embodiment provided in this embodiment can be executed in a terminal, a computer or a similar computing device. For example, running on a terminal, Figure 1 FIG. 1 is a hardware structure diagram of a terminal of the layout processing method of this embodiment. Figure 1 As shown, the terminal may include one or more ( Figure 1 Only one is shown in the figure) a processor 102 and a memory 104 for storing data, wherein the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA. The above terminal may also include a transmission device 106 and an input and output device 108 for communication functions. It can be understood by those skilled in the art that Figure 1 The structure shown is only for illustration and does not limit the structure of the above terminal. Figure 1 More or fewer components as shown, or with Figure 1 Different configurations shown.

[0022] The memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the layout processing method in this embodiment. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, to implement the above method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include a memory remotely arranged relative to the processor 102, and these remote memories may be connected to the terminal via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0023] The transmission device 106 is used to receive or send data via a network. The above network includes a wireless network provided by a communication provider of the terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, referred to as NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 can be a radio frequency (Radio Frequency, referred to as RF) module, which is used to communicate with the Internet wirelessly.

[0024] In the design of VLSI, layout data files often use a hierarchical model - hierarchy mode for layout design to reduce the size of layout files, such as SREF (Structure Reference) and AREF (Array Reference) in GDSII (Graphic Design System), and Repetitions in OASIS; OASIS is a file format used to represent photolithography layouts, and Repetitions is a data type used to represent the positions of each repeated graphic. Furthermore, AREF in GDSII obtains new graphics by referencing other basic graphics or graphics and arranging a large number of repeated structures according to rules; SREF in GDSII obtains new graphics by referencing other basic graphics or graphics to create a large number of repeated structures. As can be seen from the above, in the design process, the hierarchy method is usually used to encapsulate the recurring underlying element structures into modules (cells), and the modules are called at the top level, which reduces the overlap of graphic elements and improves design efficiency.

[0025] At the same time, in the actual layout processing operation, it is necessary to flatten the hierarchy to obtain the relevant connections between the graphics, that is, it is necessary to quickly flatten the layout layer, that is, flatten it. In this embodiment, a layout processing method is provided, specifically a layout layer flattening method is provided, Figure 2 is a flow chart of the layout processing method of the embodiment of the present application, such as Figure 2 As shown, the process includes the following steps: Step S210, obtaining layout information, where the layout information includes multiple modules and calling information of the multiple modules.

[0026] Among them, the layout information to be processed by the integrated circuit design terminal is obtained, and the level of the hierarchy mode in the layout is determined, and the hierarchy corresponds to multiple modules and calling information between multiple modules.

[0027] Step S220, sorting the multiple modules based on the call information to obtain a sorting result.

[0028] Exemplarily, after determining the call information between multiple modules and modules, the call connection relationship of multiple modules is abstracted into a directed acyclic graph (DAG) based on the call information between multiple modules, and the multiple modules are sorted using the call information between multiple modules in the directed acyclic graph to obtain a sorting result. Further, the directed acyclic graph is topologically sorted to obtain the sorting results of multiple modules. Topological sorting is to linearly sort the vertices of the DAG so that for each directed edge (u, v), u (in the sorting record) appears before v. The principle of topological sorting is based on the characteristics of DAG, that is, there is a partial order relationship between nodes. The algorithm traverses the nodes in the directed acyclic graph, finds nodes without predecessor nodes (i.e., nodes with an in-degree of 0), adds them to the sorting result, and then removes the node and its related edges, and repeats this process until all nodes in the graph are added to the sorting result.

[0029] There are many ways to implement topological sorting, such as depth-first search, breadth-first search, etc. Among them, the steps of depth-first search include: select a vertex without a predecessor (i.e., in-degree is 0) from the DAG and output it; delete the vertex and all directed edges starting from it from the graph. Repeat the above two steps until the current DAG is empty or there are no vertices without predecessors in the current graph. The steps of breadth-first search include: create a queue Q and a result list S; add all nodes with in-degree 0 to Q; when Q is not empty, repeatedly perform the following steps: a. Take a node n from Q; b. Add n to the end of S; c. For each adjacent point m of n, if the in-degree of m is 0 after minus 1, then add m to Q. If the generated sequence S does not contain all the nodes in the graph, there is a cycle in the graph, otherwise there is no cycle in the graph, and S is the result of topological sorting.

[0030] Step S230, traverse and obtain module information of each module.

[0031] Among them, multiple modules are traversed to obtain module information of each module. According to the sorting results of multiple modules obtained above, multiple modules can be traversed and queried to obtain module information of multiple modules. Exemplarily, the module information includes the module name, the basic pixels in the module, and the offset information corresponding to the basic pixels. The offset information of the called module includes the offset information of the basic pixels.

[0032] Step S240, according to the sorting result, traverse multiple modules in turn to perform flattening processing to obtain the processing result.

[0033] The flattening process includes: obtaining the submodule and calling information called by the module, transforming the module information of the submodule based on the calling information to obtain the transformation result; and adding the transformation result to the module information of the module for updating.

[0034] In this embodiment, after traversing all modules, the offset information of the called module is obtained, that is, the submodule called by the module and the calling information are obtained. Thereafter, according to the sorting result, the multiple modules are traversed and flattened in sequence. Specifically, the flattening process is: transforming the module information of the submodule according to the calling information to obtain the transformation result, and then updating the module information of the module according to the transformation result, and determining the processing result after the flattening of the multiple modules as the processing result after the flattening of the layout.

[0035] Furthermore, the basic pixels and offset information of the last module in the sorting result are output as the processing result. The basic pixels and offset information of the last module in the sorting result, that is, the top module, are all pixels with offset points flattened to the top layer, which can be taken out and returned as the result.

[0036] In some of the embodiments, module information of each module is traversed and obtained according to the sorting result; the order of traversing the module information and obtaining the information is consistent with the subsequent flattening order, and there can be a time overlap between the traversal and obtaining the module information and the subsequent flattening process, that is, after the module information of the target module is obtained, it can be flattened, thereby realizing the possibility of parallel processing between different functional steps.

[0037] Through the above steps, after obtaining the layout information, the modules are sorted according to the calling information of the modules in the layout information, and the sorting result is obtained; then the module information of each module is traversed to establish the index of the basic pixels and corresponding offset information of the module, and according to the sorting result, multiple modules are traversed; based on the sub-modules and calling information called by the module, the module information of the sub-module is transformed to obtain the transformation result, and the module information of multiple modules is updated according to the transformation result to realize the flattening processing of multiple modules, and then the flattening processing result of the layout is obtained. By traversing and flattening multiple modules at one time, the number of repeated processing is reduced, thereby reducing the amount of data in the flattening process.

[0038] In some of the embodiments, the module information of the sub-module is transformed based on the calling information to obtain a transformation result, including: based on the calling information of the module to the sub-module, the basic pixels and offset information of the sub-module are transformed accordingly to obtain transformed pixels and transformed offset information; the transformation result includes transformed pixels and transformed offset information.

[0039] Furthermore, the call information includes the location information of the sub-module, and the information of offset, rotation, enlargement and mirroring processing of the sub-module; the basic pixels include at least one of polygons, paths, circles and rectangles; the offset information includes at least one of offset, rotation, enlargement and mirroring processing information.

[0040] Among them, the module information of multiple modules includes the basic pixels within the module and the offset information corresponding to the basic pixels; when the module information of the sub-module needs to be transformed, the basic pixels and offset information of the sub-module are subjected to corresponding offset, rotation, enlargement, mirroring and other transformations based on the calling information.

[0041] In some embodiments, the module information of the module is updated by adding the transformation result to the module, including: adding the transformation pixel to the basic pixel of the module to replace and update the basic pixel; adding the transformation offset information to the offset information of the module to replace and update the offset information. Until the module is updated to a module that is not called as a submodule by other modules, the basic pixel and offset information of the module are output as the processing result.

[0042] In step S210 , multiple modules are sorted based on the call information to obtain a sorting result, including steps S211 to S212 .

[0043] Step S211, sorting multiple modules according to a preset sorting strategy and call information to determine the module vector of the layout.

[0044] Among them, the call information between all modules in the layout is read, and further, a call hierarchy tree corresponding to multiple modules is established according to the call information. The call hierarchy tree is convenient for intuitively obtaining the call information between modules. Afterwards, according to the preset sorting strategy, according to the call information in multiple modules, the multiple modules are sorted by topological sorting method; the preset sorting strategy includes: when multiple modules are at the same layer of the call hierarchy tree, the multiple modules at the same layer are sorted according to the actual processing requirements; after sorting the multiple modules, the module vector of the corresponding layout is obtained; wherein the module vector includes the module information of multiple modules and the module call information.

[0045] Step S212, obtaining a sorting result according to the module vector.

[0046] The processor determines the sorting results of the multiple modules of the layout according to the set of module vectors between the multiple modules.

[0047] Through the above steps, according to the calling information between multiple modules in the layout, a corresponding calling hierarchy tree is established, and the calling information of the calling hierarchy tree is topologically sorted to obtain the corresponding module vector, and then the sorting result is determined according to the module vector. Based on the actual situation, the corresponding sorting result is generated by topological sorting, which is conducive to improving the efficiency and accuracy of processing the calling relationship to obtain the module sorting result.

[0048] In some of the embodiments, in step S210, multiple modules are sorted to obtain a sorting result, and steps S213 to S214 are also included.

[0049] Step S213, obtaining the first module and the second module; the second module calls the first module; obtaining the calling information of the first module, and determining the order of the first module according to the calling information.

[0050] Among them, the calling module and the called module in the multiple modules of the layout are determined respectively, that is, in the calling relationship between any two modules, the calling module is defined as the second module and the called module is defined as the first module; and the calling information in the first module (characterizing the calling information of the first module to the sub-module to be called by it) is obtained, so as to obtain the order restriction information of the first module in the sorting result based on the calling information that the first module is to call other modules, and then determine the order of the first module in the sorting result.

[0051] Step S214, according to the sequence of the first module and the calling information of the second module, the sequence of the second module is determined to obtain a sorting result, wherein the sequence of the first module in the sorting result is before the sequence of the second module.

[0052] Among them, based on the calling relationship between all modules in the layout, the sorting order of each module is determined respectively, that is, the order of the first module and the second module in each calling relationship is determined in turn, and then the sorting result is determined.

[0053] Through the above steps, when traversing multiple modules, multiple called modules and modules that call other modules are determined, and then the sorting results of multiple modules are determined, which is conducive to improving the accuracy of the sorting results. At the same time, it is conducive to reducing the amount of data in the balancing process.

[0054] The present embodiment is described and illustrated by means of specific examples below.

[0055] Figure 3 FIG. 1 is a flow chart of the method for flattening the layout layer of this specific embodiment. Figure 3 As shown, the method for flattening the layout layer includes the following steps: Step S310, sorting the modules.

[0056] Specifically, in the process of reading the design file (ie, layout), the calling relationships among all modules are counted to establish a corresponding calling hierarchy tree (CellTree). Figure 4 This is a schematic diagram of a call hierarchy tree provided by this specific embodiment; common hierarchy levels can be referenced Figure 4 The layout includes 8 modules, which are named module 1 (cell1), module 2 (cell2), module 3 (cell3), module 4 (cell4), module 5 (cell5), module 6 (cell6), module 7 (cell7) and module 8 (cell8). Figure 4 The arrows in the figure indicate the calling relationship between modules. For example, cell6 is called by cell4, and cell7 is called by cell4 and cell5.

[0057] The connection relationship between multiple modules in the layout can be abstracted as a directed acyclic graph, and the directed acyclic graph can be topologically sorted to obtain its sorting result by using its related characteristics. For example, the related characteristics of the directed acyclic graph can be the partial order relationship between the nodes in the graph. Figure 5 is a schematic diagram of a sorting result provided in an embodiment of the present application. Figure 5, according to the calling information between multiple modules, the sorting result is obtained, and the order of the sorting result from left to right is module 6 (cell6), module 7 (cell7), module 8 (cell8), module 4 (cell4), module 5 (cell5), module 2 (cell2), module 3 (cell3) and module 1 (cell1). Among them, the order of cell6-8 can be swapped, the order of cell4 and cell5 can also be swapped, and the order of cell2 and cell3 can also be swapped. It is only necessary to ensure that the basic modules that need to be called by the modules that appear later have all appeared and been processed. Therefore, the sorting result is not specifically limited here. This method transforms the cyclic recursive process into a traversal, and all modules in it only need to be processed once. It can be understood as topologically sorting the cell's calling information (cellTree) to obtain the sorted module vector cellLists. In this embodiment, the sorting result includes the top-level module 1 (top cell1), that is, the last module sorted is displayed; in other embodiments, only the remaining modules except the top-level module (top cell) can be displayed, such as Figure 5 Module 1 may not be displayed in the sorting result, because the top-level module must be the last module in the topological sorting and may not be displayed specifically.

[0058] Step S320, traverse and obtain module information of each module according to the sorting result.

[0059] Specifically, multiple modules in cellLists are traversed in topological order, and an index structure cellPathMap between the module name (cellName) and its basic pixel, and an index structure cellPathOffMap between the module name (cellName) and its basic pixel offset point are established. The basic pixel in each cell is inserted into cellPathMap[cellName], and the offset point corresponding to the pixel is inserted into cellPathOffMap. The basic pixel offset point here is the offset information corresponding to the basic pixel in the aforementioned embodiment.

[0060] Exemplarily, the pixels here include polygons, paths, circles, rectangles, etc. The offset point corresponding to a pixel represents that the pixel exists at the offset point, and one pixel can correspond to multiple offset points.

[0061] In this embodiment, the index structure cellPathMap between the module name (cellName) and its basic pixel, and the index structure cellPathOffMap between the module name (cellName) and its basic pixel offset point are established to store the module information of each module obtained by traversal, so as to facilitate subsequent use. However, in other embodiments, other storage methods can also be used based on demand, and this application does not make specific limitations.

[0062] In this embodiment, the traversal module obtains information and generates cellPathMap[refCellName] and cellPathOffMap[refCellName] based on topological sorting, that is, in the same order as the subsequent flattening processing. However, in other embodiments, other traversal orders can be used based on demand, or traversal can be performed in a random order, and this application does not make specific limitations.

[0063] Step S330, flattening the module vector cellLists[i].

[0064] Specifically, for the sorted module vector cellLists[i], where i represents the name of the i-th module. The method for obtaining all pixels in the cell is as follows: obtain all module call relationships of cellLists[i]. Traverse all modules called by cellLists[i]. For multiple called modules with the module name refCellName, obtain the transformation information of the called module with the module name refCellName called by cellLists[i], that is, the position, rotation, magnification and mirror information, and transform the pixels in cellPathMap[refCellName] and the corresponding pixel offset points in cellPathOffMap[refCellName] according to these transformation information. Afterwards, obtain the module name cellName of cellLists[i], add the resulting pixel to cellPathMap[cellName], and add the offset point corresponding to the resulting pixel to cellPathOffMap[cellName].

[0065] Step S340, determining the result of flattening the layout.

[0066] Specifically, according to the sorting result, after traversing cellLists, it is determined that the pixel corresponding to the cell at the end of cellLists in cellPathMap and the offset point corresponding to the cellPathOffMap are all pixels with offset points flattened to the top layer, which are taken out and returned as the result.

[0067] This flattening method converts the calling relationship into a traversal order through the topological sorting of the directed acyclic graph, and can process all the cell modules required subsequently in one traversal, reducing the number of repeated processing times; by using the basic graphics plus translation method, the rotation, amplification and translation of the graphics in the module call ref are optimized to the enlarged rotation of the basic graphics and the translation of the points, reducing the amount of calculation.

[0068] Furthermore, Figure 6 This is a schematic diagram of module information transformation provided by this specific embodiment. Figure 6 , where in the two-dimensional coordinate system with the basic figure as the origin, rectangle 0 with coordinate point (0,0) is the aforementioned basic pixel, and rectangles 1-5 are all pixels obtained by referencing rectangle 0 and performing an offset (transformation). Furthermore, the coordinate point of a rectangle can be determined by the intersection of two diagonal lines in the rectangle, or by the vertex between two sides of the rectangle; illustratively, the coordinate point of the rectangle is represented by the coordinate of the vertex at the lower left corner of the rectangle. Specifically, Figure 6 As shown, rectangles 1, 2, 3, 4, and 5 can be formed by adding multiple offset coordinates (a1, a2, a3, a4, and a5) to the basic graphic 0, where a1-a5 represent the offset coordinates of different rectangles in the two-dimensional coordinate system. For example, the offset coordinate a1 is (1, 5), the offset coordinate a2 is (3, 5), the offset coordinate a3 is (5, 5), the offset coordinate a4 is (2, 2), and the offset coordinate a1 is (4, 2). Furthermore, the graphics of rectangles 1-5 can be obtained by rotating, enlarging, and mirroring based on the basic graphic 0.

[0069] Therefore, multiple references to rectangle 0 can be divided into two steps: performing corresponding rotation and enlargement processing on the basic figure 0; then, performing corresponding rotation and enlargement processing on the offset point.

[0070] The above method converts the calling relationship into the order of traversal through the topological sorting of the directed acyclic graph, and then processes all the cell modules required subsequently through one traversal, which is beneficial to reduce the number of repeated processing; at the same time, by using the basic graphics plus translation method, the two-dimensional transformation information such as rotation, enlargement, and translation of the graphics in the module call is optimized to the enlargement and rotation of the basic graphics and the translation of the points, that is, the data storage and calculation amount in the layout processing are reduced by using pixels and offset points.

[0071] In some specific implementations, after the flattening process is completed using the above-mentioned layout processing method and the processing result is obtained, it also includes: based on different layout processing requirements and based on the processing result, at least one of design rule checking (DRC), layout parameter extraction, layout interface display and layout layer operation is performed on the layout. The flattening process to obtain the processing result is a basic step before layout layer operation, drc check or parameter extraction, and is also a basic step for interface display of the layout. For example, common layout layer operations include boolean operations between layers, such as not, or, and, etc.; layout parameter extraction such as the width of the graphic, extraction of spacing between graphics, etc.

[0072] It should be noted that the steps shown in the above process or the flowchart in the accompanying drawings can be executed in a computer system such as a group of computer executable instructions.

[0073] In this embodiment, a layout processing device is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. The terms "module", "unit", "subunit" and the like used below can implement a combination of software and / or hardware of predetermined functions. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0074] Figure 7 is a structural block diagram of a layout processing device according to an embodiment of the present application. Figure 7 As shown, the device includes: a sorting module 10, a traversal module 20 and a processing module 30.

[0075] The sorting module 10 is used to obtain layout information, which includes multiple modules and calling information of multiple modules; and is also used to sort the multiple modules based on the calling information to obtain a sorting result.

[0076] The traversal module 20 is used to traverse and obtain the module information of each module.

[0077] The processing module 30, according to the sorting result, traverses multiple modules in turn to perform flattening processing to obtain a processing result; wherein the flattening processing includes: obtaining the sub-module and calling information called by the module, transforming the module information of the sub-module based on the calling information to obtain the transformation result; adding the transformation result to the module information of the module to update it.

[0078] It should be noted that the above modules can be functional modules or program modules, and can be implemented by software or hardware. For modules implemented by hardware, the above modules can be located in the same processor; or the above modules can be located in different processors in any combination.

[0079] In this embodiment, an electronic device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0080] Optionally, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0081] Optionally, in this embodiment, the processor may be configured to perform the following steps through a computer program: S1, obtaining layout information, where the layout information includes multiple modules and calling information of multiple modules.

[0082] S2, sorting multiple modules based on the call information to obtain a sorting result.

[0083] S3, traverse and obtain the module information of each module.

[0084] S4, according to the sorting result, traverse the multiple modules in turn to perform flattening processing to obtain the processing result. The flattening processing includes: obtaining the submodules and calling information called by the module, transforming the module information of the submodule based on the calling information to obtain the transformation result; and adding the transformation result to the module information of the module to update it.

[0085] It should be noted that the specific examples in this embodiment can refer to the examples described in the above embodiments and optional implementation modes, and will not be repeated in this embodiment.

[0086] In addition, in combination with the layout processing method provided in the above embodiments, a storage medium may be provided in this embodiment to implement the layout processing method. The storage medium stores a computer program; when the computer program is executed by a processor, any layout processing method in the above embodiments is implemented.

[0087] It should be understood that the specific embodiments described herein are only used to explain the application, rather than to limit it. Based on the embodiments provided in this application, all other embodiments obtained by ordinary technicians in this field without creative work are within the protection scope of this application.

[0088] Obviously, the drawings are only some examples or embodiments of the present application. For ordinary technicians in the field, the present application can also be applied to other similar situations based on these drawings without creative work. In addition, it is understandable that although the work done in this development process may be complicated and lengthy, for ordinary technicians in the field, certain changes in design, manufacturing or production based on the technical content disclosed in this application are only conventional technical means and should not be regarded as insufficient content disclosed in this application.

[0089] The term "embodiment" in this application refers to a specific feature, structure or characteristic described in conjunction with the embodiment that can be included in at least one embodiment of the present application. The appearance of this phrase in various locations in the specification does not necessarily mean the same embodiment, nor does it mean that it is mutually exclusive with other embodiments and is independent or optional. It is clearly or implicitly understood by those of ordinary skill in the art that the embodiments described in this application can be combined with other embodiments without conflict.

[0090] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of patent protection. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the scope of protection of the present application. Therefore, the scope of protection of the present application shall be subject to the attached claims.

Claims

1. A layout processing method, characterized in that: The method comprises: Acquire layout information, wherein the layout information includes multiple modules and call information of the multiple modules; Based on the call information, the multiple modules are sorted to obtain a sorting result; Traverse and obtain the module information of each module; According to the sorting result, traverse the multiple modules in sequence to perform leveling processing to obtain a processing result; The flattening process includes: obtaining the submodule and calling information called by the module, transforming the module information of the submodule based on the calling information to obtain a transformation result; and adding the transformation result to the module information of the module for updating.

2. The layout processing method according to claim 1, characterized in that: The module information includes basic pixels in the module and offset information corresponding to the basic pixels; The transforming the module information of the submodule based on the calling information to obtain the transformation result includes: Based on the calling information of the module to the submodule, the basic pixels and offset information of the submodule are correspondingly transformed to obtain the transformed pixels and the transformed offset information; The transformation result includes the transformation pixel and the transformation offset information.

3. The layout processing method according to claim 2, characterized in that: Adding the transformation result to the module information of the module for updating includes: Adding the transformed pixel to the base pixel of the module to update the base pixel; The transformed offset information is added to the offset information of the module to update the offset information.

4. The layout processing method according to claim 1, characterized in that: The obtaining of the processing result comprises: The basic pixels and offset information of the module sorted last in the sorting result are output as the processing result.

5. The layout processing method according to claim 1, characterized in that: The traversal obtains the module information of each module, including: According to the sorting result, the module information of each module is traversed and obtained.

6. The layout processing method according to claim 2, characterized in that: The calling information includes the position information of the submodule, and the information of offset, rotation, enlargement and mirroring processing of the submodule; The basic graphic element includes at least one of a polygon, a path, a circle and a rectangle; The offset information includes at least one of offset, rotation, magnification and mirror processing information.

7. The layout processing method according to claim 1, characterized in that: The step of sorting the multiple modules based on the call information to obtain a sorting result includes: According to a preset sorting strategy and the call information, the multiple modules are sorted to determine the module vector of the layout; The sorting result is determined according to the module vector.

8. The layout processing method according to claim 7, characterized in that: The step of sorting the multiple modules to obtain a sorting result further includes: Acquire a first module and a second module; the second module calls the first module; Acquire calling information of the first module, and determine the order of the first modules according to the calling information; Determine the order of the second modules according to the order of the first modules and the calling information of the second modules, and obtain a sorting result; Among them, in the sorting result, the order of the first module is before the order of the second module.

9. The layout processing method according to claim 1, characterized in that: After obtaining the processing result, the method further includes: Based on different layout processing requirements and based on the processing results, at least one of design rule checking, layout parameter extraction, layout interface display and layout layer operation is performed on the layout.

10. A layout processing device, characterized in that: The device comprises: a sorting module, a traversal module and a processing module; The sorting module is used to obtain layout information, the layout information includes multiple modules and calling information of the multiple modules; and is also used to sort the multiple modules based on the calling information to obtain a sorting result; The traversal module is used to traverse and obtain module information of each module; The processing module is used to traverse the multiple modules in turn according to the sorting result to perform flattening processing and obtain a processing result; wherein the flattening processing includes: obtaining the sub-module and calling information called by the module, transforming the module information of the sub-module based on the calling information to obtain a transformation result; and adding the transformation result to the module information of the module to update it.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the layout processing method according to any one of claims 1 to 9 are implemented.

Citation Information

Patent Citations

  • Method for rapidly displaying level territory

    CN102142040A

  • Territory preprocessing method for laser direct imaging

    CN103559344A

  • Subunit array splicing pretreatment method of very large scale integrated circuit layout hierarchy comparison tool

    CN106649897A

  • Multi-layer hierarchical netlist processing method, device, computer equipment and storage medium

    CN110489812A

  • Method and device for presenting calling relation of digital circuit module, equipment and storage medium

    CN115618783A