A method for processing agf files, computer equipment, and readable storage medium

Abstract

The present application relates to a method for processing agf files, a computer device, and a readable storage medium. The file processing method includes: obtaining a target file, wherein the target file stores the layout information of at least one chip unit; reading the layout information of each chip unit from the target file, and storing the layout information in a unit file corresponding to each chip unit; establishing index information corresponding to each unit file, wherein the index information is used to record the storage location of the layout information in each unit file; and using the index information as the file name of the corresponding unit file. When reading information, the storage location of the information to be searched in the file name of the unit file is searched according to the information name, and the information to be searched is read. The present application stores the index information of the file content as the file name, which can quickly query and obtain information, and improve the computing efficiency of multi-process data processing.

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a method, computer equipment, and readable storage medium suitable for processing agf files. Background Art

[0002] In the chip design process, it is necessary to first perform design specification verification (DRC) and circuit layout verification (LVS) before performing parasitic parameter extraction. The most commonly used DRC and LVS tools are calibre, which outputs CCI files. CCI files contain the layout connection information of the chip after LVS extraction and are common input files for parasitic parameter extraction software. In the CCI file, the .agf file is a binary file that stores all the graphic information in the layout in a hierarchical structure. The .agf file uses the chip unit (cell) as the basic unit. The chip unit contains instances of chip sub-units and graphics under different masks.

[0003] Existing parasitic parameter reading software, when reading the .agf file in the CCI file, mainly reads all the information from the .agf file in sequence according to the GDSII specification and retains it in the memory. When the chip is large in scale, a multi-process method is usually used to process the data, and finally the processing results are integrated. However, since each process is independent of each other, the information obtained from the .agf file needs to be allocated to each process. Not only does the allocation process waste a lot of time, but the duplicate data also takes up a lot of memory, resulting in low efficiency. Summary of the invention

[0004] In response to the above technical problems, the present application provides a file processing method, an information reading method, a computer device and a storage medium, which store the index information of the file content as the file name, can quickly query and obtain information, and improve the computational efficiency of multi-process data processing.

[0005] Technical Solution 1

[0006] A file processing method, characterized in that it is a processing method applicable to agf files, including the following:

[0007] Step 1 is a writing step for establishing a database, which specifically includes the following steps:

[0008] Acquire a target file, wherein the target file stores layout information of at least one chip unit;

[0009] Reading the layout information of each chip unit from the target file, and storing the layout information in a unit file corresponding to each chip unit;

[0010] Establishing index information corresponding to each of the unit files, wherein the index information is used to record the storage location of the layout information in each of the unit files;

[0011] Using the index information as the file name of the corresponding unit file;

[0012] Step 2 is an information reading step, which is to read the file processed in step 1, and specifically includes the following steps:

[0013] Get the name of the information to be found;

[0014] Searching the file name of the unit file for the storage location of the information to be found in the unit file according to the information name;

[0015] The information to be searched is read from the unit file according to the storage location.

[0016] The method is characterized in that reading the layout information of each chip unit from the target file includes:

[0017] Acquire the unit name of the at least one chip unit from the netlist file;

[0018] The layout information of each chip unit is searched in the target file according to the unit name of the at least one chip unit.

[0019] The method is characterized in that the index information includes the information name of the layout information, the number of elements of the information, and the offset address of the information.

[0020] The method is characterized in that the step of establishing index information corresponding to each of the unit files comprises:

[0021] Determine initial index information, wherein the initial index information includes the information name of the layout information of the chip unit, the number of elements of the information and the initial offset address of the information;

[0022] Writing layout information whose element quantity is not 0 into the unit file and recording the actual offset address;

[0023] The actual offset address is assigned to the initial offset address to generate index information of the unit file.

[0024] The method is characterized in that the method further comprises:

[0025] Before determining the initial index information, the maximum file size of the unit file is calculated according to the layout information, and a new unit file is created;

[0026] After the index information of the unit file is generated, the file size of the unit file is reset according to the value of the maximum offset address in the unit file.

[0027] The method is characterized in that storing the layout information in the unit file corresponding to each chip unit comprises the following steps:

[0028] Acquire graphic data of graphics on the same layer in the layout information, wherein the graphic data includes vertex coordinates of each graphic;

[0029] Sorting the vertex coordinates to determine the position attributes of each vertex of the same layer of graphics;

[0030] The vertex coordinates and the position attributes of the corresponding vertices are used as converted graphic data and stored in the unit files corresponding to the chip units.

[0031] The method is characterized in that the step of sorting the vertex coordinates and determining the position attributes of each vertex of the same layer of graphics includes:

[0032] Sort the horizontal and vertical coordinates of the vertex coordinates of all graphics respectively;

[0033] According to the sorting results, the sequence labels of each horizontal axis and each vertical axis are determined;

[0034] Map the coordinates of each vertex into a sequence array consisting of a sequence tag of the horizontal coordinate and a sequence tag of the vertical coordinate to obtain the position attribute of the corresponding vertex;

[0035] The step of using the vertex coordinates and the position attributes of the corresponding vertices as converted graphic data and storing them in the unit files corresponding to each chip unit includes:

[0036] Combines the vertex name with the vertex position attribute in 2D vector format;

[0037] The combined data and the vertex coordinates are used as converted graphic data and stored in a unit file corresponding to each chip unit.

[0038] A computer device, characterized in that it comprises: a memory and a processor, wherein an operating program is stored in the memory, and the processing program implements the method when executed by the processor.

[0039] A readable storage medium, characterized in that a computer program is stored on the readable storage medium, and the computer program implements the method when executed by a processor.

[0040] The file processing method, information reading method, computer device and storage medium of the present application, the file processing method includes: obtaining a target file, wherein the target file stores the layout information of at least one chip unit; reading the layout information of each chip unit from the target file, and storing the layout information in the unit file corresponding to each chip unit; establishing index information corresponding to each unit file, wherein the index information is used to record the storage location of the layout information in each unit file; using the index information as the file name of the corresponding unit file. When reading information, the storage location of the information to be searched in the file name of the unit file is searched according to the information name, and the information to be searched is read. The present application stores the index information of the file content as the file name, which can quickly query and obtain information, and improve the computing efficiency of multi-process data processing. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 is a flowchart of a file processing method according to an embodiment of the present application;

[0042] Figure 2 3 is a comparison diagram of the effects before (a) and after (b) the conversion of graphic data according to an embodiment of the present application. DETAILED DESCRIPTION

[0043] The following is an explanation of the implementation of the present application by means of specific embodiments. People familiar with the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification.

[0044] In the following description, reference is made to the accompanying drawings, which describe several embodiments of the present application. It should be understood that other embodiments may also be used, and that mechanical composition, structural, electrical, and operational changes may be made without departing from the spirit and scope of the present application. The following detailed description should not be considered restrictive, and the scope of the embodiments of the present application is limited only by the claims of the published patents. The terms used herein are only for the purpose of describing specific embodiments and are not intended to limit the present application.

[0045] Although the terms first, second, etc. are used herein to describe various elements in some instances, these elements should not be limited by these terms. These terms are only used to distinguish one element from another element.

[0046] Furthermore, as used in this article, the singular forms "one", "an" and "the" are intended to include plural forms as well, unless there is an indication to the contrary in the context. It should be further understood that the terms "comprise", "include" indicate the presence of the described features, steps, operations, elements, components, projects, kinds, and / or groups, but do not exclude the presence, occurrence or addition of one or more other features, steps, operations, elements, components, projects, kinds, and / or groups. The terms "or" and "and / or" used herein are interpreted as inclusive, or mean any one or any combination. Therefore, "A, B or C" or "A, B and / or C" means "any of the following: A; B; C; A and B; A and C; B and C; A, B and C". Exceptions to this definition will only occur when the combination of elements, functions, steps or operations is inherently mutually exclusive in some way.

[0047] Figure 1 FIG. 1 is a flowchart of a file processing method according to an embodiment of the present application. Figure 1 As shown, the file processing method of the embodiment of the present application includes the following steps:

[0048] S1. Obtain a target file, wherein the target file stores layout information of at least one chip unit;

[0049] S2. Read the layout information of each chip unit from the target file, and store the layout information in the unit file corresponding to each chip unit;

[0050] S3. Establishing index information corresponding to each unit file, wherein the index information is used to record the storage location of the layout information in each unit file;

[0051] S4. Use the index information as the file name of the corresponding unit file.

[0052] In the above manner, it is not necessary to keep the data read from the target file in the memory, but only the index information can be retained in the hard disk, which is more suitable for distributed system operations. When using a multi-process solution, each process does not need to copy the large amount of layout information, but transmits lightweight index information. When certain information is needed, it can be quickly queried and obtained according to the guidance of the index information, effectively improving the computing efficiency of multi-process data processing. In addition, this application uses the index information as the file name, which can quickly locate the storage location of the searched information in the file and improve the data query speed.

[0053] The target file may be a .agf file, which stores all the graphic information in the layout in a hierarchy structure. The .agf file uses the chip unit (cell) as the basic unit, and the chip unit contains the instance of the chip sub-unit (instance) and the graphics under different masks (mask). It can be understood that the type of the target file is not limited to this, and can be other types suitable for storing the layout information of the chip unit.

[0054] Optionally, in step S2, the layout information of each chip unit is read from the target file, including:

[0055] Obtain a unit name of at least one chip unit from a netlist file;

[0056] The layout information of each chip unit is searched in the target file according to the unit name of at least one chip unit.

[0057] Among them, the unit names of all chip units are stored in the netlist file (.nl) corresponding to the layout design. After obtaining the unit name of at least one chip unit from the netlist file, the location of each chip unit can be found in the target file, and then the layout information of each chip unit can be read and obtained. Taking the target file as a .agf file as an example, the above operation is read-only for the .agf file, and the chip units are arranged in parallel in the .agf file, so the reading of each chip unit can be independent of each other, and the reading of all chip units can be completed in parallel. After reading the layout information of each chip unit from the target file, the layout information is stored in the unit file corresponding to each chip unit.

[0058] Optionally, the unit file of each chip unit may include a file name and file content, the file name is named using index information, and the file content includes layout information such as instances of chip subunits and graphics under different masks. Optionally, the index information includes the information name of the layout information, the number of elements of the information, and the offset address of the information, wherein the element may be an instance of a chip subunit, a pattern of a mask, etc.

[0059] Optionally, step S3 includes:

[0060] Determine initial index information, wherein the initial index information includes the information name of the layout information of the chip unit, the number of elements of the information and the initial offset address of the information;

[0061] Write layout information with non-zero element quantity in the unit file and record the actual offset address;

[0062] The actual offset address is assigned to the initial offset address to generate index information of the unit file.

[0063] Among them, the initial offset address is assigned a value of -1, which is the default offset address of the information when the number of elements is 0. Write the layout information whose number of elements is not 0 to the end of the file, and record the corresponding actual offset address. Optionally, the actual offset address is the actual offset address of the first element. Then, the actual offset address is assigned to the initial offset address. At this time, the information name of the layout information of the chip unit, the number of elements of the information, and the actual offset address of the information constitute the index information of the unit file. The index information of a unit file can be illustrated as follows:

[0064] instance_list 3 36

[0065] mask_num 2 100

[0066] mask_offset 2 108,

[0067] The first line represents an instance in which the chip unit contains three chip sub-units. The offset address of the first chip sub-unit is 36. The specific layout information of the first chip sub-unit can be obtained by locating the 36th position of the unit file. The second and third lines describe the graphics of the chip unit itself. Similarly, all the graphic information of the specified mask can be quickly obtained through the index information.

[0068] Optionally, the method of this embodiment may further include:

[0069] Before determining the initial index information, the maximum size of the unit file is counted according to the layout information, and a new unit file is created;

[0070] After the index information of the unit file is generated, the size of the unit file is reset according to the value of the maximum offset address in the unit file.

[0071] When reading information from the target file for storage, the maximum file size can be counted based on the existing information, a new unit file can be created and its size can be set. After the file name is set, in order to avoid the file being too large, the file size can be reset based on the value of the maximum offset address in the file.

[0072] The layout information read from the target file is usually in the same form as that stored in the target file. Taking the .agf file as an example, the graphic data exists in the following form:

[0073]

[0074] It can be seen that in the original graphic data, a layer of graphics contains several polygons, each of which is composed of interconnected edges, and each edge is further composed of two vertices. However, in EDA tools, a large number of operations are often performed on graphics, such as Boolean operations of different mask graphics, or obtaining the relationship between graphics in the same mask, such as overlap, connection, adjacent relationship, etc. The above description method will make it difficult to obtain the relative relationship between polygons, because when doing graphic operations, all polygons are usually required to operate in pairs, resulting in an unacceptable complexity of O(N2). When introducing some fast algorithms, it is necessary to convert the polygons to a temporary data structure, and the conversion time cannot be ignored when the number of operations is huge. In this regard, the present application proposes a method for converting graphic data, which can clearly describe the positional relationship of the graphics, not only saving space (compressing repeated points and coordinate information), but also facilitating the subsequent rapid import of graphics operation algorithms. Whether it is the storage of chip unit data or the conversion of graphic formats, it can be completed in linear time and can be completed in parallel, thereby speeding up the operation speed of EDA tools as a whole.

[0075] Based on the above concept of converting the graphic data, optionally, in step S2, storing the layout information in the unit file corresponding to each chip unit includes the following steps:

[0076] Obtaining graphic data of graphics on the same layer in the layout information, the graphic data including vertex coordinates of each graphic;

[0077] Sort the vertex coordinates to determine the position attributes of each vertex in the same layer of graphics;

[0078] The vertex coordinates and the position attributes of the corresponding vertices are used as converted graphic data and stored in the unit file corresponding to each chip unit.

[0079] Among them, by determining the position attributes of each vertex of the same layer of graphics, the relative position relationship of each vertex of the same layer of graphics can be clarified. Figure 2 For example, in (a), two figures have 8 vertex coordinates. Before the conversion, there is no clear relative position attribute between them, such as the order of arrangement. In (b), the 8 vertex coordinates are converted into 8 points P1 to P8 in a sequence relationship, which have a specific order. Taking the example of finding adjacent figures, if the format of the figure in the .agf file is used directly, such as Figure 2 As shown in (a), it is very difficult to intuitively see the adjacency relationship of the graph. When checking and comparing a certain graph with all other graphs, it is easy to generate O(N2) or higher complexity. After the graph data is converted, Figure 2As shown in (b), the adjacency relationship of the graphics can be reflected in the relative positions of the points. Based on this structure, it is simple to extract the adjacency relationship: define a scan line and start scanning from bottom to top. First, the two points P2 and P3 will be scanned, and the positions and information of P2 and P3 will be recorded on the scan line. Then, when the points P6 and P7 are scanned, it can be determined based on the records on the scan line that the polygon where P7 and P2 are located is adjacent. By analogy, as long as the data is scanned once in a certain direction, the mutual adjacency relationship of all graphics can be obtained. In this way, the new format can be used to reduce the calculation between irrelevant graphics as much as possible, and improve the efficiency of graphics calculation.

[0080] Optionally, the step of sorting the vertex coordinates and determining the position attributes of each vertex of the same layer of graphics includes:

[0081] Sort the horizontal and vertical coordinates of the vertex coordinates of all graphics respectively;

[0082] According to the sorting results, the sequence labels of each horizontal axis and each vertical axis are determined;

[0083] The coordinates of each vertex are mapped into a sequence array consisting of a sequence tag of the horizontal coordinate and a sequence tag of the vertical coordinate to obtain the position attribute of the corresponding vertex.

[0084] First, Figure 2 Taking (b) as an example, traversing the polygon once can obtain 8 independent points. By traversing the points, the horizontal coordinate sequence and the vertical coordinate sequence of the vertex coordinates can be obtained respectively. The results are as follows:

[0085] x position list[3.2, 3.53, 1.24, 1.82]

[0086] y position list[-0.12,-2.1,-0.95],

[0087] At this time, the horizontal and vertical coordinates are unordered. The horizontal and vertical coordinates of the vertex coordinates of all graphics are sorted separately, and the results are as follows:

[0088] x position list[1.24 1.82 3.2 3.53]

[0089] y position list[-2.1 -0.95 -0.12],

[0090] At this time, based on the sorting results, the sequence markers of each horizontal coordinate and each vertical coordinate can be determined. For example, the sequence marker corresponding to the horizontal coordinate 1.82 is 1, which means that it is the second element in the x position list (similarly, the sequence marker of the first element 1.24 is 0). The purpose of using sequence markers is to facilitate subsequent graphic operations while also allowing quick access to the original coordinate values. Based on the above sorting results, the correspondence between coordinates and sequence markers is as follows:

[0091] Position-index map

[0092]

[0093] Next, map the coordinates of each vertex into a sequence array consisting of the sequence mark of the horizontal coordinate and the sequence mark of the vertical coordinate to complete the conversion of the sequence mark of all points. The process is: traverse all points, and get the value of the sequence mark through the coordinate table of the point. After the conversion, the representation method of the eight points of the two rectangles is:

[0094] Point position-index mapping

[0095] P1: (3.2, -0.12) -> (2, 2)

[0096] P2: (3.2, -2.1)->(2, 0)

[0097] P3: (3.53, -2.1)->(3, 0)

[0098] P4: (3.53,-0.12)->(3,2)

[0099] P5: (1.24, -0.12)-> (0, 2)

[0100] P6: (1.24,-0.95)->(0,1)

[0101] P7: (1.82,-0.95)->(1,1)

[0102] P8: (1.82, -0.12)-> (1, 2),

[0103] Thus, taking P2(2,0) as an example, when the output result requires the real coordinates, the real coordinates of P2 can be obtained by using the sequence marker to query the sequence of the horizontal or vertical coordinates as follows:

[0104] x_position_list[2]=3.2; y_position_list[0]=-2.1

[0105] P2(2,0)->P2(3.2,-2.1).

[0106] After determining the position attributes of each vertex of the same layer of graphics, optionally, the step of using the vertex coordinates and the position attributes of the corresponding vertices as converted graphics data and storing them in the unit file corresponding to each chip unit includes:

[0107] Combines the vertex name with the vertex position attribute in 2D vector format;

[0108] The combined data and vertex coordinates are used as converted graphic data and stored in the unit file corresponding to each chip unit.

[0109] Among them, a series of points are sorted according to the sequence mark and stored in the unit file. Specifically, all points are sorted according to the vertical coordinate first, and then the points at the same vertical coordinate are sorted according to the horizontal coordinate. Taking the 2D vector format as an example, the final output result is as follows:

[0110] Point 2D vector

[0111] y=0: {(2, P2), (3, P3)};

[0112] y=1: {(0, P6), (1, P7)};

[0113] y=2: {(0, P5), (1, P8), (2, P1), (3, P4)},

[0114] Finally, the information is combined to obtain the graphic data of one layer of graphics in the converted chip unit:

[0115] x position list[1.24 1.82 3.2 3.53]

[0116] y position list[-2.1 -0.95 -0.12]

[0117] Point 2D vector

[0118] y=0: {(2, P2), (3, P3)};

[0119] y=1: {(0, P6), (1, P7)};

[0120] y=2: {(0, P5), (1, P8), (2, P1). (3, P4)}.

[0121] In actual implementation, during the layout design process, there are unified requirements for the decimal places (dbu) and precision places (k) of the graphics. Therefore, through the decimal places and precision places provided in the design file, the coordinate values ​​can be converted into integers first and then sorted.

[0122] The file processing method of the present application includes: obtaining a target file, wherein the target file stores the layout information of at least one chip unit; reading the layout information of each chip unit from the target file, and storing the layout information in a unit file corresponding to each chip unit; establishing index information corresponding to each unit file, wherein the index information is used to record the storage location of the layout information in each unit file; and using the index information as the file name of the corresponding unit file. When reading information, the storage location of the information to be searched in the file name of the unit file is searched according to the information name, and the information to be searched is read. The present application stores the index information of the file content as the file name, which can quickly query and obtain information, thereby improving the computational efficiency of multi-process data processing.

[0123] After the file is processed by the file processing method of the above embodiment, the information in the file can be read based on the file name of the unit file.

[0124] like Figure 1 As shown, the process of reading information includes the following steps:

[0125] S5. Get the name of the information to be found;

[0126] S6. Find the storage location of the information to be found in the file name of the unit file according to the information name;

[0127] S7. Read the information to be searched from the unit file according to the storage location.

[0128] Among them, the file name of the unit file is also the index information of the content stored in the unit file. In this way, when certain information is needed, it can be quickly queried and obtained according to the guidance of the index information, thereby improving the data query speed. In addition, when using a multi-process solution, each process does not need to copy the large amount of layout information, but instead transmits lightweight index information, effectively improving the computational efficiency of multi-process data processing. For details on how to set the index information, please refer to the description above and will not be repeated here.

[0129] The present application also provides a computer device, including: a memory and a processor, wherein an operating program is stored in the memory, and when the operating program is executed by the processor, the method described in the above embodiment is implemented.

[0130] The present application also provides a readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the method described in the above embodiment is implemented.

[0131] The above embodiments are merely illustrative of the principles and effects of the present application and are not intended to limit the present application. Anyone familiar with the technology may modify or change the above embodiments without violating the spirit and scope of the present application. Therefore, all equivalent modifications or changes made by a person of ordinary skill in the art without departing from the spirit and technical ideas disclosed in the present application shall still be covered by the claims of the present application.

Claims

1. A method for processing agf files, characterized in that: These include: Step 1 is the writing step, which is used to establish a database. Specifically, it includes the following steps: Acquire a target file, wherein the target file stores layout information of at least one chip unit; Reading the layout information of each chip unit from the target file, and storing the layout information in a unit file corresponding to each chip unit; Establishing index information corresponding to each of the unit files, wherein the index information is used to record the storage location of the layout information in each of the unit files; Using the index information as the file name of the corresponding unit file; Step 2 is an information reading step, which is to read the file processed in step 1, and specifically includes the following steps: Get the name of the information to be found; Searching the file name of the unit file for the storage location of the information to be found in the unit file according to the information name; Read the information to be found from the unit file according to the storage location; Storing the layout information in a unit file corresponding to each chip unit includes the following steps: Acquire graphic data of graphics on the same layer in the layout information, wherein the graphic data includes vertex coordinates of each graphic; Sorting the vertex coordinates to determine the position attributes of each vertex of the same layer of graphics; The vertex coordinates and the position attributes of the corresponding vertices are used as converted graphic data and stored in the unit files corresponding to the chip units.

2. The method according to claim 1, characterized in that The step of reading the layout information of each chip unit from the target file includes: Acquire the unit name of the at least one chip unit from the netlist file; The layout information of each chip unit is searched in the target file according to the unit name of the at least one chip unit.

3. The method according to claim 1, characterized in that The index information includes the information name of the layout information, the number of elements of the information, and the offset address of the information.

4. The method according to claim 3, characterized in that The step of establishing index information corresponding to each of the unit files comprises: Determine initial index information, wherein the initial index information includes the information name of the layout information of the chip unit, the number of elements of the information and the initial offset address of the information; Writing layout information whose element quantity is not 0 into the unit file and recording the actual offset address; The actual offset address is assigned to the initial offset address to generate index information of the unit file.

5. The method according to claim 4, characterized in that The method further comprises: Before determining the initial index information, the maximum file size of the unit file is calculated according to the layout information, and a new unit file is created; After the index information of the unit file is generated, the file size of the unit file is reset according to the value of the maximum offset address in the unit file.

6. The method according to claim 1, characterized in that The step of sorting the vertex coordinates to determine the position attributes of each vertex of the same layer of graphics includes: Sort the horizontal and vertical coordinates of the vertex coordinates of all graphics respectively; According to the sorting results, the sequence labels of each horizontal axis and each vertical axis are determined; Map the coordinates of each vertex into a sequence array consisting of a sequence tag of the horizontal coordinate and a sequence tag of the vertical coordinate to obtain the position attribute of the corresponding vertex; The step of using the vertex coordinates and the position attributes of the corresponding vertices as converted graphic data and storing them in the unit files corresponding to each chip unit includes: Combines the vertex name with the vertex position attribute in 2D vector format; The combined data and the vertex coordinates are used as converted graphic data and stored in a unit file corresponding to each chip unit.

7. A computer device, characterized in that: include: A memory and a processor, wherein an operation program is stored in the memory, and when the program is executed by the processor, the method according to any one of claims 1 to 6 is implemented.

8. A readable storage medium, characterized in that: The readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images