Test point marking method and device, computer equipment and storage medium

Abstract

The invention relates to a test point marking method and device, computer equipment, a storage medium and a computer program product. The method comprises the following steps: acquiring a functional coverage tree generated after testing a test point set; a root node in the function coverage rate tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set and is associated with a function coverage rate; for at least one part of target test points in the test point set, decomposing test point names of the target test points according to function levels to obtain at least one coverage rate query field; according to the hierarchy sequence of the at least one coverage rate query field in the function hierarchy, performing query in the function coverage rate tree to obtain a coverage rate query result corresponding to the target test point; and correspondingly marking the coverage rate query result and the test point name of the target test point. By adopting the method, the test point marking efficiency can be improved.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a test point marking method, apparatus, computer equipment, storage medium and computer program product. Background Art

[0002] With the development of computer technology, EDA (Electronic design automation) front-end verification technology has emerged. Front-end verification refers to the verification and testing of codes in cooperation with EDA front-end designers. The main steps of the front-end verification include test point decomposition, environment construction, daily regression, coverage collection, etc. The coverage can be code coverage, function coverage, etc.

[0003] In traditional technology, for each test point in the test point set of the test target, the degree of verification of the test point can be described by the corresponding functional coverage generated after the test. Therefore, after collecting the functional coverage to generate a functional coverage file, it is usually necessary to use the functional coverage file to reverse mark the test points, that is, to find the corresponding functional coverage of each test point from the functional coverage file, and mark the functional coverage with the corresponding test point name.

[0004] However, the traditional method has low efficiency in searching for the corresponding functional coverage of each test point in the functional coverage file due to the presence of a large amount of redundant information in the functional coverage file, resulting in low efficiency in test point marking. Summary of the invention

[0005] Based on this, it is necessary to provide a test point marking method, apparatus, computer equipment, computer readable storage medium and computer program product that can improve the test point marking efficiency in response to the above technical problems.

[0006] In a first aspect, the present application provides a test point marking method. The method comprises:

[0007] A function coverage tree generated after testing a test point set of a test target is obtained; a root node in the function coverage tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in a function hierarchy of the test target, a level at which a function coverage field corresponding to the descendant node is located is subordinate to a level at which a field represented by a parent node of the descendant node is located; the descendant node is associated with a function coverage rate corresponding to the represented function coverage field;

[0008] For at least a part of the target test points in the test point set, decompose the test point names of the target test points according to the functional level of the test target to obtain at least one coverage query field;

[0009] According to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, query is performed in the functional coverage tree to obtain a coverage query result corresponding to the target test point;

[0010] The coverage query result is marked correspondingly to the test point name of the target test point.

[0011] In a second aspect, the present application also provides a test point marking device. The device comprises:

[0012] A coverage tree acquisition module, used for acquiring a function coverage tree generated after testing a test point set of a test target; a root node in the function coverage tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in the function hierarchy of the test target, a level at which a function coverage field corresponding to a descendant node is located is subordinate to a level at which a field represented by a parent node of the descendant node is located; the descendant node is associated with a function coverage rate corresponding to the represented function coverage field;

[0013] A test point decomposition module, for decomposing the test point names of at least a part of the target test points in the test point set according to the functional level of the test target, to obtain at least one coverage query field;

[0014] A coverage query module, configured to query the functional coverage tree according to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, and obtain a coverage query result corresponding to the target test point;

[0015] The marking module is used to mark the coverage query result and the test point name of the target test point in correspondence.

[0016] In a third aspect, the present application further provides a computer device. The computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0017] A function coverage tree generated after testing a test point set of a test target is obtained; a root node in the function coverage tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in a function hierarchy of the test target, a level at which a function coverage field corresponding to the descendant node is located is subordinate to a level at which a field represented by a parent node of the descendant node is located; the descendant node is associated with a function coverage rate corresponding to the represented function coverage field;

[0018] For at least a part of the target test points in the test point set, decompose the test point names of the target test points according to the functional level of the test target to obtain at least one coverage query field;

[0019] According to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, query is performed in the functional coverage tree to obtain a coverage query result corresponding to the target test point;

[0020] The coverage query result is marked correspondingly to the test point name of the target test point.

[0021] In a fourth aspect, the present application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0022] A function coverage tree generated after testing a test point set of a test target is obtained; a root node in the function coverage tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in a function hierarchy of the test target, a level at which a function coverage field corresponding to the descendant node is located is subordinate to a level at which a field represented by a parent node of the descendant node is located; the descendant node is associated with a function coverage rate corresponding to the represented function coverage field;

[0023] For at least a part of the target test points in the test point set, decompose the test point names of the target test points according to the functional level of the test target to obtain at least one coverage query field;

[0024] According to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, query is performed in the functional coverage tree to obtain a coverage query result corresponding to the target test point;

[0025] The coverage query result is marked correspondingly to the test point name of the target test point.

[0026] In a fifth aspect, the present application further provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0027] A function coverage tree generated after testing a test point set of a test target is obtained; a root node in the function coverage tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in a function hierarchy of the test target, a level at which a function coverage field corresponding to the descendant node is located is subordinate to a level at which a field represented by a parent node of the descendant node is located; the descendant node is associated with a function coverage rate corresponding to the represented function coverage field;

[0028] For at least a part of the target test points in the test point set, decompose the test point names of the target test points according to the functional level of the test target to obtain at least one coverage query field;

[0029] According to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, query is performed in the functional coverage tree to obtain a coverage query result corresponding to the target test point;

[0030] The coverage query result is marked correspondingly to the test point name of the target test point.

[0031] The test point marking method, apparatus, computer equipment, storage medium and computer program product described above obtain a functional coverage tree generated after testing a test point set of a test target, and for at least a portion of the target test points in the test point set, decompose the test point names of the target test points according to the functional hierarchy of the test target, so as to obtain at least one coverage query field, and then query in the obtained functional coverage tree according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target. Since the hierarchies in the functional coverage tree correspond one-to-one to the hierarchies in the functional hierarchy of the test target, any descendant node of the root node represents a functional coverage field corresponding to a test point, and in the functional hierarchy of the test target, a descendant node The level at which the corresponding function coverage field is located is the level at which the field represented by the parent node of a descendant node is located. By querying in hierarchical order, at least one coverage query field can be used to query the nodes representing the function coverage fields level by level in the function coverage tree, and obtain the corresponding coverage query result of the target test point. The coverage query result is marked corresponding to the test point name of the target test point to achieve reverse marking of the test point. During the whole process, the correspondence between the levels in the obtained function coverage tree and the levels in the functional hierarchy of the test target and the at least one coverage query field obtained by decomposing the test point name of the target test point can be used to quickly query and mark the function coverage of the target test point, which can improve the test point marking efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 A diagram showing an application environment of a test point marking method in an embodiment;

[0033] Figure 2 A schematic diagram of a flow chart of a test point marking method in an embodiment;

[0034] Figure 3 is a schematic diagram of a function coverage tree in one embodiment;

[0035] Figure 4 is a schematic diagram of a function coverage tree in another embodiment;

[0036] Figure 5 A schematic diagram of a function coverage file in one embodiment;

[0037] Figure 6 A schematic diagram of a function coverage file in another embodiment;

[0038] Figure 7 is a schematic diagram of a function coverage tree in yet another embodiment;

[0039] Figure 8A schematic diagram of a table of test points to be marked in one embodiment;

[0040] Fig. 9 A schematic diagram of a test point reverse marking table in one embodiment;

[0041] Fig.10 A schematic diagram of a test point reverse marking table in another embodiment;

[0042] Fig.11 is a flow chart of a test point marking method in another embodiment;

[0043] Fig.12 Find that cover group for an embodiment, and a schematic diagram of the relationship between the cover group and the bin;

[0044] Fig.13 A schematic diagram of a function coverage tree in yet another embodiment;

[0045] Fig.14 is a structural block diagram of a test point marking device in one embodiment;

[0046] Fig.15 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0047] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0048] The test point marking method provided in the embodiment of the present application can be applied to Figure 1In the application environment shown. The terminal 102 tests the test point set of the test target input by the user 104, and obtains a function coverage tree generated after testing the test point set of the test target; the root node in the function coverage tree represents the function identification field of the function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in the function hierarchy of the test target, a descendant node corresponds to the level where the function coverage field is located, and is subordinate to the level where the field represented by the parent node of the descendant node is located; a descendant node is associated with the function coverage corresponding to the represented function coverage field, and for at least a part of the target test points in the test point set, the test point name of the target test point is decomposed according to the function hierarchy of the test target to obtain at least one coverage query field, and the function coverage tree is queried according to the hierarchical order of at least one coverage query field in the function hierarchy of the test target to obtain the coverage query result corresponding to the target test point, and the coverage query result is marked corresponding to the test point name of the target test point. The terminal 102 may be, but is not limited to, various desktop computers, laptop computers, smart phones, tablet computers, IoT devices, and portable wearable devices. IoT devices may be smart speakers, smart TVs, smart air conditioners, smart car-mounted devices, etc. Portable wearable devices may be smart watches, smart bracelets, head-mounted devices, etc.

[0049] In one embodiment, Figure 2 As shown, a test point marking method is provided, which can be executed by a terminal or a server alone, or by a terminal and a server in collaboration. In the embodiment of the present application, the method is applied to a terminal as an example for explanation, and includes the following steps:

[0050] Step 202, obtain the function coverage tree generated after testing the test point set of the test target; the root node in the function coverage tree represents the function identification field of the function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in the function hierarchy of the test target, a descendant node corresponds to the level at which the function coverage field is located, and is subordinate to the level at which the field represented by the parent node of a descendant node is located; a descendant node is associated with the function coverage corresponding to the represented function coverage field.

[0051] Among them, the test target refers to the function that needs to be verified when the test is performed. The test point set includes multiple test points. The test points are mainly used to verify and test the designed functions, which can be obtained by decomposing the test points. The format of the test points is divided level by level, and each level from top to bottom is a cover group, a cover point, and a bin. The test point name of the test point can reflect the corresponding relationship between the test point and the coverage of the function that needs to be tested (i.e., the functional coverage). The name of the test point is usually in the format of xxx_cg(covergroup, cover group).(xxx_cp(coverpoint, cover point)).(bins(bin)). For example, when the test point name of the test point is xxx_cg, it means that the coverage of the function that needs to be tested at the test point is the coverage of the xxx cover group. For another example, when the test point name of the test point is xxx_cg.xxx_cp, it means that the coverage of the function that needs to be tested at the test point is the coverage of the xxx cover point under the xxx cover group.

[0052] Among them, the cover group is a model used to count functional coverage, which includes coverage points that represent different design functions. The overall coverage of the cover group is reflected by the coverage of all the cover points contained in it. Cover points exist in the cover group and correspond to a functional point in the design that needs to be verified. After the functional coverage is sampled, the cover point will count whether all the bins under it are covered. The bin is defined in the cover point and is the basic unit for measuring functional coverage. The cover points for a certain design function may have different functional performances, and these different functional performances are defined in different bins in the cover point.

[0053] Among them, the functional coverage is used to illustrate the verification degree of the corresponding test point. Each test point needs to have a corresponding functional coverage. When the functional coverage is 100%, it means that the corresponding test point has been fully verified and the test point can be accepted. The functional coverage tree refers to the tree structure of the functional coverage, which can be obtained through the functional coverage file generated after the test. The functional coverage tree includes a root node and at least one descendant node. The root node in the functional coverage tree represents the functional identification field of the function to which the test point set belongs. The functional identification field can specifically be a character string representing the function to which the test point set belongs. Any descendant node of the root node represents a functional coverage field corresponding to a test point in the test point set.

[0054] Among them, the functional coverage field refers to the field used to characterize the functional coverage. For example, the functional coverage field can specifically be a field that characterizes the coverage group. For example, the field that characterizes the coverage group can be in the form of xxx1_cg, where xxx1 is the name of the field. For another example, the functional coverage field can specifically be a field that characterizes the coverage point. For example, the field that characterizes the coverage point can be in the form of xxx2_cp, where xxx2 is the name of the field. For another example, the functional coverage field can specifically be a field that characterizes the bin. For example, the field that characterizes the bin can be any field that does not have cg and cp as suffixes. The functional level of the test target refers to the level of functional coverage determined when the test is performed. For example, each level of the functional level of the test target is, from top to bottom, a coverage group, a coverage point, and a bin.

[0055] Specifically, the terminal will obtain the function coverage tree generated after testing the test point set of the test target. The root node in the function coverage tree represents the function identification field of the function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set. In the function hierarchy of the test target, a descendant node corresponds to the level where the function coverage field is located, and is subordinate to the level where the field represented by the parent node of a descendant node is located, and a descendant node is associated with the function coverage corresponding to the represented function coverage field.

[0056] In a specific application, if the parent node of the descendant node is the root node, the level at which the function coverage field represented by the descendant node is located is subordinate to the level at which the function identification field represented by the root node is located according to the functional level of the test target. If the parent node of the descendant node is not the root node, the level at which the function coverage field represented by the descendant node is located is subordinate to the level at which the function coverage field represented by its parent node is located according to the functional level of the test target.

[0057] In a specific application, each level of the functional hierarchy of the test target is, from top to bottom, a coverage group, a coverage point, and a bin. If the function coverage field represented by the descendant node is a field representing a coverage group, then the level at which the function coverage field represented by the descendant node is located is subordinate to the level at which the function identification field represented by the root node is located. If the function coverage field represented by the descendant node is a field representing a coverage point, then the level at which the function coverage field represented by the descendant node is located is subordinate to the level at which the field representing the coverage group represented by the parent node of the descendant node is located. If the function coverage field represented by the descendant node is a field representing a bin, then the level at which the function coverage field represented by the descendant node is located is subordinate to the level at which the field representing the coverage point represented by the parent node of the descendant node is located.

[0058] For example, assuming that the function identification field is total, the function coverage field includes a field representing a coverage group, a field representing a coverage point, and a field representing a bin, wherein the field representing the coverage group is cg1, ..., cgN, the field representing the coverage point is cp1, ..., cpN, and is subordinate to cg1, and the field representing the bin is bin1, ..., binN, and is subordinate to cp1, then the constructed function coverage tree can be as follows: Figure 3 As shown, it includes four levels, wherein the root node of the first level represents total, the descendant nodes of the second level each represent a field representing a coverage group and are subordinate to the function identification field represented by the root node, and the descendant nodes of the third level each represent a field representing a coverage point and are subordinate to the parent node of the descendant node (such as Figure 3 The function coverage field represented by the node cg1 is shown as follows (e.g. Figure 3 The descendant nodes at the fourth level each represent a field representing a bin and are subordinate to the parent node of the descendant node (e.g. Figure 3 The function coverage field represented by the node cp1 is shown as follows (e.g. Figure 3 cp1 is shown).

[0059] Further, such as Figure 4 As shown, for the convenience of searching, the function coverage tree can be a two-way linked list N-ary tree. In the two-way linked list N-ary tree, except for leaf nodes, other nodes are allowed to have more than two child nodes. The root node can access all its child nodes. For any node other than the root node, the targeted node can access its parent node upwards or its child node downwards, that is, in Figure 4 In the example, the root node total can access all child nodes in the second level (such as Figure 4 All child nodes in the second level can access both the root node total and their own child nodes. Figure 4 In the example, node cg1 can access the root node total and its child nodes cp1, ..., cpN. Similarly, all child nodes in the third level can access both their parent node and their child nodes. Figure 4 As shown, the child node cp1 can access its parent node cg1, and can also access its child nodes bin1, ..., binN. In the case where the function coverage tree is a bidirectional linked list N-ary tree, during the query process, if the queried node is not a matching node, it can fall back to the parent node and continue to query other unqueried nodes, which can improve the search efficiency and realize the rapid query of the function coverage of the target test point, thereby helping to improve the test point marking efficiency.

[0060] Step 204 : for at least a portion of the target test points in the test point set, decompose the test point names of the target test points according to the functional levels of the test targets to obtain at least one coverage query field.

[0061] Among them, the target test point refers to the test point in the test point set that needs to be reverse-marked, that is, the test point whose corresponding functional coverage needs to be found from the functional coverage file, which can be configured according to the actual application scenario. The test point name is used to uniquely identify the test point, and can reflect the correspondence between the test point and the functional coverage. The coverage query field refers to the field that exists in the target test point and is used to query the functional coverage. For example, the coverage query field can specifically be a field that represents the coverage group. For another example, the coverage query field can specifically be a field that represents the coverage point. For another example, the coverage query field can specifically be a field that represents the bin.

[0062] Specifically, after obtaining the function coverage tree, the terminal can use the function coverage tree to reversely mark at least a portion of the target test points in the test point set. When performing reverse marking, the terminal will decompose the test point name of the target test point according to the functional hierarchy of the test target, determine the hierarchical structure of the test point name, and obtain at least one coverage query field, so as to query in the function coverage tree with at least one coverage query field.

[0063] In a specific application, the test point name includes at least one coverage query field of the functional level, and the test point name of the target test point is decomposed according to the functional level of the test target, in order to determine at least one coverage query field of the functional level corresponding to the test point name. It should be noted that the coverage query field and the functional coverage field have the same form. When there is functional coverage corresponding to the target test point in the functional coverage tree, for each of the at least one coverage query field obtained by decomposing the target test point, there is a functional coverage field matching the coverage query field in the functional coverage tree.

[0064] Step 206 , querying in the functional coverage tree according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target, and obtaining coverage query results corresponding to the target test point.

[0065] Specifically, the terminal will query level by level in the functional coverage tree according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target, and obtain the corresponding coverage query results of the target test point. In a specific application, when querying level by level in the functional coverage tree, at each level queried, the terminal will query with the coverage query field corresponding to the level in at least one coverage query field. It should be noted that each level corresponds to a coverage query field, and the coverage query field corresponding to each level can be determined based on the hierarchical order of at least one coverage query field in the functional hierarchy of the test target.

[0066] Step 208: Mark the coverage query result and the test point name of the target test point accordingly.

[0067] Specifically, when the corresponding coverage query result of the target test point is obtained, the terminal will mark the coverage query result in correspondence with the test point name of the target test point, that is, establish a correspondence between the coverage query result and the test point name of the target test point, so as to achieve reverse marking of the target test point. In a specific application, the coverage query result may be functional coverage, in which case the terminal will mark the functional coverage in correspondence with the test point name of the target test point. The coverage query result may also be a pre-configured query result representing the absence of functional coverage, in which case the terminal will mark the pre-configured query result in correspondence with the test point name of the target test point. Among them, the pre-configured query result can be configured according to the actual application scenario. For example, the pre-configured query result can specifically be a specific string representing the absence of functional coverage, such as none.

[0068] The above-mentioned test point marking method obtains a functional coverage tree generated after testing a test point set of a test target, and for at least a part of the target test points in the test point set, decomposes the test point name of the target test point according to the functional hierarchy of the test target, so as to obtain at least one coverage query field, and then can query in the obtained functional coverage tree according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target. Since the hierarchies in the functional coverage tree correspond one-to-one to the hierarchies in the functional hierarchy of the test target, any descendant node of the root node represents a functional coverage field corresponding to a test point, and in the functional hierarchy of the test target, a descendant node corresponds to the layer where the functional coverage field is located. The level is the level at which the field represented by the parent node of a descendant node is located. By querying in the order of the levels, at least one coverage query field can be used to query the nodes representing the function coverage fields level by level in the function coverage tree, and the corresponding coverage query result of the target test point is obtained. The coverage query result and the test point name of the target test point are marked accordingly to achieve reverse marking of the test point. In the whole process, the correspondence between the levels in the obtained function coverage tree and the levels in the functional hierarchy of the test target and the at least one coverage query field obtained by decomposing the test point name of the target test point can be used to realize rapid query and marking of the function coverage of the target test point, which can improve the test point marking efficiency.

[0069] In one embodiment, obtaining a function coverage tree generated after testing a test point set of a test target includes:

[0070] Obtaining a function coverage file generated after testing a test point set of a test target; the function coverage file records a function coverage test record corresponding to each test point in the test point set; the function coverage test record includes a test point identifier, a function coverage field and a function coverage rate corresponding to the test point; the test point identifier indicates a function identifier field or a function coverage field to which the corresponding function coverage field belongs;

[0071] Generate a function coverage tree based on the function coverage file.

[0072] The function coverage file refers to a file obtained by collecting the function coverage corresponding to each test point in the test point set after testing the test point set of the test target.

[0073] Specifically, the terminal will obtain the function coverage file generated after testing the test point set of the test target. The function coverage file records the function coverage test record corresponding to each test point in the test point set. The function coverage test record includes the test point identifier, function coverage field and function coverage corresponding to the test point. The test point identifier indicates the function identifier field or function coverage field to which the corresponding function coverage field belongs. After obtaining the function coverage file, the terminal can generate a function coverage tree based on the function coverage file.

[0074] In a specific application, after determining the test target, the terminal will decompose the test points according to the test target to obtain a test point set. On the basis of the test point set, the front-end verification is performed through steps such as environment construction, daily regression, and coverage collection. After the coverage is collected, a functional coverage file can be obtained. In a specific application, coverage collection can be performed using a coverage collection tool. After the coverage is collected, the coverage collection tool will generate a functional coverage file. For example, the coverage collection tool can be specifically Cadence (Cadence DesignSystems, Cadence Electronics)'s xcelium (Cadence's simulation tool) and IMC (Integrate Metrics Cener) tool, and the generated functional coverage file is a CSV (a file format) file of functional coverage.

[0075] In specific applications, the order of function coverage test records in the function coverage file corresponds to the result of the pre-order traversal of the function coverage tree. Therefore, when generating the function coverage tree, the terminal will first obtain the function identification field of the function to which the test point set belongs from the function coverage file, build the root node of the function coverage tree based on the function identification field, and then traverse the function coverage test records in the function coverage file according to the hierarchical order of the functional hierarchy of the test target to construct other nodes in the function coverage tree.

[0076] In a specific application, the form of the functional coverage file can be as follows Figure 5As shown, in the function coverage file, the function coverage test record corresponding to the function to which the test point set belongs will be recorded first. The function coverage test record includes a function point identifier, a function identifier field, and a total function coverage rate. The function point identifier and the function identifier field are both used to identify the function to which the test point set belongs, and correspond to the test point identifier and the function coverage field, respectively. After recording the function coverage test record corresponding to the function to which the test point set belongs, in the function coverage file, the function coverage test record corresponding to each test point in the test point set will be recorded in the hierarchical order of the functional hierarchy of the test target. The function coverage test record includes the corresponding test point identifier, function coverage field, and function coverage rate. In a specific application, such as Figure 5 As shown, if each level of the functional hierarchy of the test target is coverage group, coverage point, and warehouse from top to bottom, then according to the hierarchical order of the functional hierarchy of the test target, the functional coverage test records of the functional level as coverage group will be recorded first, then the functional coverage test records of the functional level as coverage point will be recorded, and finally the functional coverage test records of the functional level as warehouse will be recorded.

[0077] In this embodiment, by first acquiring the function coverage file, the function coverage tree can be constructed by using the function coverage test record corresponding to each test point in the test point set recorded in the function coverage file.

[0078] In one embodiment, generating a function coverage tree based on the function coverage file includes:

[0079] Obtain the function identification field of the function to which the test point set belongs, and construct the root node of the function coverage tree based on the function identification field;

[0080] Traverse the function coverage test records in the function coverage file according to the hierarchical order of the function levels of the test target;

[0081] According to the test point identifier in the traversed function coverage test record, determine the function identifier field or the function coverage field to which the function coverage field in the traversed function coverage test record belongs;

[0082] Taking the node corresponding to the determined function identification field or function coverage field in the function coverage tree as the parent node, constructing a node corresponding to the function coverage field in the traversed function coverage test record;

[0083] Associate the function coverage in the traversed function coverage test record with the constructed node.

[0084] Specifically, when generating a function coverage tree, the terminal will first obtain the function identification field of the function to which the test point set belongs from the function coverage file, build the root node of the function coverage tree based on the function identification field, and then traverse the function coverage test records in the function coverage file according to the hierarchical order of the functional hierarchy of the test target. When traversing the function coverage test records, the terminal will determine the function identification field or function coverage field to which the function coverage field in the traversed function coverage test record belongs based on the test point identification in the traversed function coverage test record, and then use the node corresponding to the determined function identification field or function coverage field in the function coverage tree as the parent node to construct a node corresponding to the function coverage field in the traversed function coverage test record, and finally associate the function coverage in the traversed function coverage test record with the constructed node, that is, use the function coverage in the traversed function coverage test result as the attribute of the constructed node.

[0085] In a specific application, in the function coverage file, the function coverage test record is recorded in the hierarchical order of the function level of the test target, so it is sufficient to traverse directly in order. When determining the function identification field or function coverage field to which the function coverage field in the traversed function coverage test record belongs based on the test point identification in the traversed function coverage test record, the terminal will compare the test point identification in the traversed function coverage test record with the function point identification or test point identification in the traversed function coverage test record, determine the upper level identification corresponding to the test point identification in the traversed function coverage test record, and use the function identification field or function coverage field corresponding to the upper level identification as the function identification field or function coverage field to which the function coverage field in the traversed function coverage test record belongs.

[0086] In a specific application, the terminal will identify the test point level separation identifier in the test point identifier in the traversed functional coverage test record, decompose the test point identifier according to the test point level separation identifier, compare the identifier obtained by the decomposition with the function point identifier or test point identifier in the functional coverage test record that has been traversed, and use the function point identifier or test point identifier that is identical to the identifier obtained by the decomposition as the upper level identifier corresponding to the test point identifier.

[0087] In a specific application, the form of the functional coverage file can be as follows Figure 6 As shown, in the function coverage file, the function coverage test record corresponding to the function to which the test point set belongs will be recorded first. In the function coverage test record, the function point identifier (such as Figure 6 1.2), function identification field (such as Figure 6After recording the functional coverage test record corresponding to the function to which the test point set belongs, the functional coverage test record corresponding to each test point in the test point set will be recorded in the functional coverage file according to the hierarchical order of the functional hierarchy of the test target. In the functional coverage test record, the corresponding test point identifier (such as Figure 6 As shown, this is the character string at the beginning of each functional coverage test record, 1.2.1, 1.2.2, ... 1.2.12.1.1.1), functional coverage field and functional coverage. For the functional coverage test record with the test point identifier 1.2.1, the test point identifier can be decomposed by identifying the test point level separator identifier ".", and the identifier obtained by the decomposition is "1.2", so it can be determined that the upper-level identifier corresponding to the test point identifier is the functional point identifier 1.2. For the functional coverage test record with the test point identifier 1.2.13.1, the test point identifier can be decomposed by identifying the test point level separator identifier ".", and the identifier obtained by the decomposition is "1.2.13", so it can be determined that the upper-level identifier corresponding to the test point identifier is the functional point identifier 1.2.13. It should be noted that Figure 6 None in , none is redundant information.

[0088] In a specific application, in the form of a functional coverage file such as Figure 6As shown in the figure, when generating the function coverage tree, the terminal will first obtain the function identification field A of the function to which the test point set belongs, build the root node of the function coverage tree based on the function identification field A, associate the total function coverage corresponding to the function identification field A with the root node, and then traverse the function coverage test records in the function coverage file according to the hierarchical order of the functional hierarchy of the test target. For the function coverage test record with the test point identification of 1.2.1, the terminal can determine that the function identification field to which the function coverage field 1_cg in the function coverage test record belongs is the function identification field A based on the test point identification 1.2.1, and will use the node corresponding to the function identification field A as the parent node, build the node corresponding to the function coverage field 1_cg, and associate the function coverage 1 in the traversed function coverage test record with the constructed node. Similarly, for the functional coverage test records whose test point identifiers are 1.2.2, ..., 1.2.13, it can be determined that the functional identification field to which the functional coverage fields 2_cg, ..., 13_cg in the functional coverage test records belong is the functional identification field A. The node corresponding to the functional identification field A will be used as the parent node, and the nodes corresponding to the functional coverage fields 2_cg, ..., 13_cg will be constructed respectively, and the functional coverage 2, ..., functional coverage 13 will be associated with the constructed nodes respectively. Similarly, the terminal will also construct the node corresponding to the functional coverage field 1_cp and the node corresponding to the functional coverage field bin1. The constructed functional coverage tree can be shown as follows. Figure 7 It should be noted that Figure 6 The 23-38 on the far left represent the number of lines in the functional coverage file where the functional coverage test is recorded.

[0089] In this embodiment, the function identification field is first obtained to construct a root node, and then the function coverage test records in the function coverage file are traversed according to the hierarchical order of the function hierarchy of the test target. The test point identifier in the traversed function coverage test record can be used to determine the function identification field or function coverage field to which the function coverage field in the traversed function coverage test record belongs, and then the corresponding node can be used as the parent node to realize the construction of the node corresponding to the function coverage field in the traversed function coverage test record.

[0090] In one embodiment, the test point name of the target test point is decomposed according to the functional level of the test target to obtain at least one coverage query field including:

[0091] A functional level separation identifier in a test point name of a target test point is identified, and the test point name of the target test point is decomposed with the functional level separation identifier as a split point to obtain at least one coverage query field.

[0092] The function level separation identifier is used to separate coverage query fields of different function levels, and can be configured according to the actual application scenario. For example, when the format of the test point name is xxx_cg.(xxx_cp).(bins), the "." is the function level separation identifier.

[0093] Specifically, the terminal will identify the functional level separator in the test point name of the target test point, and decompose the test point name of the target test point with the functional level separator as the split point to obtain at least one coverage query field. In a specific application, the number of functional level separators corresponds to the number of coverage query fields, and the number of coverage query fields is the number of functional level separators plus 1.

[0094] In a specific application, taking the format of the test point name as xxx_cg.(xxx_cp).(bins) as an example, when there is no functional level separation identifier in the test point name of the target test point, the terminal does not need to decompose the test point name of the target test point, and the number of coverage query fields obtained is one, that is, the test point name of the target test point itself. At this time, the test point name of the target test point can be in the form of xxx_cg. When there is a functional level separation identifier in the test point name of the target test point, the terminal can decompose the test point name of the target test point into two coverage query fields. At this time, the test point name of the target test point can be in the form of xxx_cg.xxx_cp or xxx_cp.bins, with the functional level separation identifier "." as the split point. After the test point name of the target test point is decomposed, the two coverage query fields obtained can be "xxx_cg and xxx_cp" or "xxx_cp and bins".

[0095] In this embodiment, by identifying the functional level separation identifier, the test point name of the target test point can be decomposed with the functional level separation identifier as a split point, thereby achieving determination of at least one coverage query field.

[0096] In one embodiment, querying in the function coverage tree according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target to obtain the coverage query result corresponding to the target test point includes:

[0097] Determine a query level range for querying in the function coverage tree according to the number of at least one coverage query field; the query level range includes consecutive levels starting from the next level of the root node and having the number of levels as the number of levels;

[0098] According to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target, query is performed level by level within the query hierarchy range to obtain coverage query results corresponding to the target test point.

[0099] Specifically, when querying in the function coverage tree, the terminal will first determine the query level range for querying in the function coverage tree according to the number of at least one coverage query field, and the query level range includes continuous levels starting from the next level of the root node and with the number of levels as the number of levels. On the basis of determining the query level range, the terminal will query level by level within the query level range according to the level order of at least one coverage query field in the functional level of the test target, and obtain the corresponding coverage query result of the target test point.

[0100] In specific applications, Figure 4 Taking the functional coverage tree shown in the figure as an example, if the number of at least one coverage query field is 1, the query level range is the level below the root node, that is, the second level. If the number of at least one coverage query field is 2, the query level range includes the continuous levels starting from the level below the root node with 2 as the level number, that is, the second level and the third level. If the number of at least one coverage query field is 3, the query level range includes the continuous levels starting from the level below the root node with 3 as the level number, that is, the second level, the third level and the fourth level.

[0101] In this embodiment, the query level range for querying in the function coverage tree is determined according to the number of at least one coverage query field, and then the query is performed level by level within the query level range according to the level order of at least one coverage query field in the function level of the test target to obtain the corresponding coverage query result of the target test point. The function coverage tree can be truncated for search, which can speed up the search for function coverage, thereby facilitating rapid marking and improving the efficiency of test point marking.

[0102] In one embodiment, according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target, querying is performed hierarchically within the query hierarchy range to obtain coverage query results corresponding to the target test point, including:

[0103] According to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target, determining the coverage query field corresponding to each level within the query hierarchy range;

[0104] In the process of querying level by level within the query level range, at the queried level, a query is performed according to the coverage query field corresponding to the queried level to obtain the corresponding coverage query result of the target test point.

[0105] Specifically, at each level within the query level range, the terminal will use a coverage query field for query. Therefore, the terminal must first determine the coverage query field corresponding to each level within the query level range according to the hierarchical order of at least one coverage query field in the functional level of the test target. In the process of querying level by level within the query level range, at the queried level, the terminal will query according to the coverage query field corresponding to the queried level to obtain the corresponding coverage query result of the target test point.

[0106] In a specific application, each level within the query level range corresponds to a functional level corresponding to at least one coverage query field. Therefore, the terminal can directly determine the coverage query field corresponding to each level within the query level range based on the correspondence between each level within the query level range and the functional level and the correspondence between at least one coverage query field and the functional level. That is, the levels and coverage query fields within the query level range corresponding to the same functional level correspond to each other. Figure 4 Take the functional coverage tree shown as an example. If each level of the functional hierarchy of the test target is, from top to bottom, coverage group, coverage point, and bin, and at least one coverage query field includes xxx_cg and xxx_cp, then it can be determined that the query level range is the second level and the third level, and the coverage query field corresponding to the second level is "xxx_cg", and the coverage query field corresponding to the third level is "xxx_cp".

[0107] In this embodiment, by first determining the coverage query field corresponding to each level within the query level range, and in the process of querying level by level within the query level range, at the queried level, the coverage query field corresponding to the queried level can be used to achieve accurate query and obtain the corresponding coverage query result of the target test point.

[0108] In one embodiment, at the queried level, querying is performed according to the coverage query field corresponding to the queried level to obtain the coverage query result corresponding to the target test point, including:

[0109] At the queried level, query according to the coverage query field corresponding to the queried level;

[0110] When the target node is found within the queried level, the coverage query result corresponding to the target test point is obtained according to the target node; the target node is a node that matches the coverage query field corresponding to the queried level.

[0111] Specifically, at the queried level, the terminal will query according to the coverage query field corresponding to the queried level, compare the coverage query field corresponding to the queried level and each sub-node in the queried level, and when the target node is queried within the queried level, the corresponding coverage query result of the target test point is obtained according to the target node. The target node is a node that matches the coverage query field corresponding to the queried level.

[0112] In a specific application, the target node may be a node whose represented function coverage field is the same as the coverage query field corresponding to the queried level. Figure 4 Take the functional coverage tree shown as an example to illustrate that if the coverage query field corresponding to the queried level is "cp1", the target node "cp1" can be found by comparing the coverage query field "cp1" corresponding to the queried level with each child node in the queried level (the second level). If the coverage query field corresponding to the queried level is "cp(N+1)", the target node cannot be found by comparing the coverage query field "cp(N+1)" corresponding to the queried level with each child node in the queried level (the second level).

[0113] In this embodiment, the coverage query field corresponding to the queried level can be used to implement accurate query in the queried level, so that when the target node is queried, the corresponding coverage query result of the target test point can be obtained directly based on the target node, and the functional coverage of the target test point can be quickly queried, which is beneficial to improving the test point marking efficiency.

[0114] In one embodiment, the test point marking method further includes:

[0115] When the child node in the queried level is not the target node, fall back to the parent node of the child node, and continue to query from the parent node to the unqueried nodes in the queried level until the target node is queried. According to the target node, the corresponding coverage query result of the target test point is obtained.

[0116] Specifically, at the queried level, the terminal will query the child nodes according to the coverage query field corresponding to the queried level. If the child node in the queried level is not the target node, the terminal will fall back to the parent node of the child node, and continue to query from the parent node to the unqueried nodes in the queried level until the target node is queried at the queried level. According to the target node, the corresponding coverage query result of the target test point is obtained.

[0117] In a specific application, the function coverage tree can be a bidirectional linked list N-ary tree, and the terminal can directly fall back from the child node in the queried level to the parent node of the child node, and then continue to query from the parent node to the unqueried node in the queried level. Figure 4 The functional coverage tree shown is used as an example for explanation. If the queried level is the second level, and the coverage query field corresponding to the queried level is "cgN", it can be known that the target node is the child node "cgN" in the second level. If the terminal queries from left to right when querying in the queried level, when the child node "cg1" is queried, it will fall back to the root node "total", and continue to query from the root node "total" to the unqueried nodes in the second level until the target node is queried.

[0118] In this embodiment, when the queried child node is not the target node, falling back to the parent node of the child node, and continuing to query from the parent node to the unqueried nodes in the queried level, the search efficiency can be improved by falling back to the parent node to continue the query, and the functional coverage of the target test point can be quickly queried, which is beneficial to improving the test point marking efficiency.

[0119] In one embodiment, obtaining the coverage query result corresponding to the target test point according to the target node includes:

[0120] When the target node is a node at the last level within the query level range, the functional coverage corresponding to the target node is used as the coverage query result corresponding to the target test point.

[0121] Specifically, when the target node is the node of the last level within the query hierarchy range, it means that the target node is the matching node corresponding to the target test point, and the terminal will directly use the functional coverage corresponding to the target node as the coverage query result corresponding to the target test point. If the target node is not the node of the last level within the query hierarchy range, the terminal will use the target node as the parent node and continue to query the child nodes in the next level corresponding to the queried level until the target node in the last level within the query hierarchy range, that is, the matching node corresponding to the target test point, is found, and the functional coverage corresponding to the target node in the last level within the query hierarchy range is used as the coverage query result corresponding to the target test point. Among them, the functional coverage fields represented by the target nodes queried at each level within the query hierarchy range can constitute the test point name of the target test point according to the functional hierarchy of the test target.

[0122] In specific applications, Figure 4The functional coverage tree shown is used as an example for explanation. If the test point name of the target test point is "cg1.cp1", the query level range includes the second level and the third level. By decomposing the test point name, two coverage query fields "cg1" and "cp1" can be obtained. The terminal will first query the second level with the coverage query field "cg1" corresponding to the second level. When the target node representing "cg1" in the functional coverage tree is queried, it is further determined whether the target node is the node of the last level in the query level range. Since the last level in the query level range is the third level, the target node representing "cg1" is not a matching node corresponding to the target test point. The terminal will use the target node representing "cg1" as the parent node and continue to query the child nodes in the third level until the target node representing "cp1" in the third level is found. The functional coverage corresponding to the target node representing "cp1" is used as the coverage query result corresponding to the target test point.

[0123] In this embodiment, when the target node is the last node in the query hierarchy range, the function coverage corresponding to the target node is used as the coverage query result corresponding to the target test point, and the coverage query result can be determined by query.

[0124] In one embodiment, the test point marking method further includes:

[0125] In the case that the target node does not exist in the queried level, the preconfigured query result indicating the non-existence of functional coverage is used as the coverage query result corresponding to the target test point.

[0126] Among them, the preconfigured query result refers to the preconfigured query result representing the non-existence of function coverage, which can be configured according to the actual application scenario. For example, the preconfigured query result can be a specific string representing the non-existence of function coverage, such as none. For another example, the preconfigured query result can be a specific value representing the non-existence of function coverage, such as 0.

[0127] Specifically, when the target node does not exist in the queried level, it means that the target test point does not have corresponding functional coverage, and the terminal will use the preconfigured query result representing the non-existence of functional coverage as the corresponding coverage query result of the target test point.

[0128] In this embodiment, in this way, when there is no target node, the coverage query result can be determined by using the preconfigured query result indicating that there is no functional coverage.

[0129] In one embodiment, at least a portion of the target test points constitute a table of test points to be marked; marking the coverage query results and the test point names of the target test points in correspondence with each other includes:

[0130] In the table of test points to be marked, the coverage query results corresponding to at least a portion of the target test points are marked corresponding to the test point names of the corresponding target test points, so as to obtain a test point reverse marking table.

[0131] Specifically, at least a part of the target test points constitute a table of test points to be marked. When the coverage query results are marked in correspondence with the test point names of the target test points, in the table of test points to be marked, the terminal will mark the corresponding coverage query results of at least a part of the target test points in correspondence with the test point names of the corresponding target test points, and obtain a test point reverse marking table.

[0132] In a specific application, the table of test points to be marked consisting of at least a portion of the target test points can be as follows: Figure 8 As shown, the table of test points to be marked is divided into three columns, the first column is the test point name of at least a part of the target test points ( Figure 8 As shown, the test point name can end with cg, cp or other forms, where the other forms end with the warehouse function level), the second column is the weight of at least a part of the target test points, and the third column is the coverage query result of at least a part of the target test points. Before the coverage query result is marked with the test point name of the target test point, the coverage query result of at least a part of the target test points in the third column is blank. By marking the coverage query results corresponding to at least a part of the target test points with the test point name of the corresponding target test point, the following is obtained. Fig. 9 The test point reverse marking table shown in Fig. 9 In the test point reverse marking table shown, the coverage query results of at least a portion of the target test points in the third column are coverage values ​​or preconfigured query results ( Fig. 9 is none).

[0133] It should be noted that, in this embodiment, the weights of at least a portion of the target test points are not set. Figure 8 The table of test points to be marked shown in Fig. 9 In the test point reverse marking table shown, the weights of at least a portion of the target test points in the second column are all blank, which can be understood as the default value. Here, the weights of at least a portion of the target test points can also be set, and the terminal will perform weighted summation on the weights of at least a portion of the target test points and the coverage query results to obtain the weighted summation result of the coverage used to evaluate the verification degree of at least a portion of the target test points.

[0134] In this embodiment, by marking the corresponding coverage query results of at least a part of the target test points in the table of test points to be marked respectively with the test point names of the corresponding target test points, a test point reverse marking table can be obtained to achieve rapid marking of the test points.

[0135] In one embodiment, in the table of test points to be marked, the coverage query results corresponding to at least a portion of the target test points are marked corresponding to the test point names of the corresponding target test points, and the test point reverse marking table is obtained, including:

[0136] In the table of test points to be marked, the coverage query results corresponding to at least a portion of the target test points are marked corresponding to the test point names of the corresponding target test points;

[0137] Classify the coverage query results corresponding to at least a portion of the target test points according to the coverage threshold to obtain at least one coverage category;

[0138] According to the coverage marking color corresponding to at least one coverage category, the coverage query results belonging to each coverage category are marked respectively to obtain a test point reverse marking table.

[0139] Among them, the coverage threshold and coverage category can be configured according to the actual application scenario, and the coverage query results can be classified according to the coverage threshold. It should be noted that when classifying the coverage query results, the coverage query results that represent the absence of functional coverage can be classified into a separate category, and then other coverage query results can be classified. The coverage labeling color is used to mark the coverage query results belonging to the corresponding coverage category. The corresponding coverage labeling color of each coverage category can be configured according to the actual application scenario, as long as the corresponding coverage labeling colors of different coverage categories are different.

[0140] Specifically, in the table of test points to be marked, the terminal will mark the corresponding coverage query results of at least part of the target test points respectively with the test point names of the corresponding target test points. On this basis, the terminal will classify the corresponding coverage query results of at least part of the target test points according to the coverage threshold to obtain at least one coverage category, and then mark the coverage query results belonging to each coverage category according to the corresponding coverage color of at least one coverage category to obtain a test point reverse marking table. In this way, intuitive marking of the coverage query results can be achieved, so that the output test point reverse marking table has a clear hierarchy and the coverage query results are more intuitive.

[0141] In a specific application, the coverage threshold can be 60% and 100%, then the number of corresponding coverage categories is four, one is that the coverage query results that indicate the absence of functional coverage are classified into one category, the second is that the coverage query results with a functional coverage of 100% are classified into one category, the third is that the coverage query results with a functional coverage of less than 100% and greater than 60% are classified into one category, and the fourth is that the coverage query results with a functional coverage of less than 60% are classified into one category. The corresponding coverage labeling color for each coverage category can be configured as follows: the corresponding coverage labeling color for category one (coverage query results that indicate the absence of functional coverage) is gray, the corresponding coverage labeling color for category two (coverage query results with a functional coverage of 100%) is green, the corresponding coverage labeling color for category three (coverage query results with a functional coverage of less than 100% and greater than 60%) is yellow, and the corresponding coverage labeling color for category four (coverage query results with a functional coverage of less than 60%) is red. In a specific application, based on the coverage query results, the corresponding coverage labeling color for category one (coverage query results that indicate the absence of functional coverage) is gray, the corresponding coverage labeling color for category two (coverage query results with a functional coverage of 100%) is green, the corresponding coverage labeling color for category three (coverage query results with a functional coverage of less than 100% and greater than 60%) is yellow, and the corresponding coverage labeling color for category four (coverage query results with a functional coverage of less than 60%) is red. Fig. 9 Take the test point reverse marking table in the marking as an example to illustrate that four different shading patterns can be used to represent four colors to mark the coverage query results. The marked test point reverse marking table is as follows Fig.10 It should be noted that Fig.10 For the convenience of illustration, the background texture does not completely cover the coverage query result. When the coverage annotation color is used for annotation, the coverage annotation color completely covers the coverage query result.

[0142] In this embodiment, the coverage query results are classified by using the coverage threshold, and the coverage query results are marked with coverage marking colors based on the classification to obtain a test point reverse marking table, which can achieve intuitive marking of the coverage query results, so that the output test point reverse marking table has clear levels and the coverage query results are more intuitive.

[0143] In one embodiment, the test point marking method of the present application is described by taking the application to a functional coverage file generated by Cadence-based xcelium to reversely mark test points and use cases as an example.

[0144] The main steps of front-end verification include: test point decomposition, environment construction, daily regression, coverage collection, etc. In order to show that each test point has been fully verified, each test point needs to have a corresponding functional coverage, and the completion of the functional coverage can illustrate the degree of verification of the corresponding test point. When the functional coverage is 100%, it means that the corresponding test point has been fully verified and the test point can be verified. Test point reverse marking is one of the key steps in front-end verification. Based on this, the present application proposes a test point marking method, which can automatically obtain the functional coverage file generated after testing the test point set of the test target, and then find the corresponding functional coverage from the functional coverage file according to the test point name of at least part of the target test points in the test point set. Finally, the verification degree of the target test point is distinguished by color, which helps the verification personnel to understand their work progress and verification quality more quickly.

[0145] The flowchart of this application from obtaining the functional coverage file to internal implementation to outputting the test point reverse marking results can be shown as follows: Fig.11 As shown. The verification personnel need to input the functional coverage file and a table of test points to be marked consisting of at least a part of the target test points. The obtained functional coverage file will generate a tree structure (i.e. Fig.11 The function coverage is converted into a tree structure), that is, the function coverage tree is used to save all function coverage, and then according to the target test point (that is, Fig.11 The function coverage tree is queried by the test point name of the back-annotated test point in Fig.11 ), obtain the corresponding relationship between the reverse-labeled test points and the coverage), and obtain the corresponding coverage query result of the target test point. If the coverage query result is a specific functional coverage, the functional coverage is divided into different colors according to the standard, and reversely marked back to the table of test points to be marked (that is, written back to the table of test points to be marked). If the coverage query result is that there is no corresponding functional coverage of the target test point, the functional coverage of the target test point is reversely marked as gray. After traversing all the target test points, the test point reverse marking table is output.

[0146] In a specific application, in the output test point reverse marking table, the format of the target test point is divided into levels, and each level from top to bottom is covergroup (abbreviated as cg, composed of multiple coverpoints), coverpoint (abbreviated as cp, composed of multiple bins) and bins. When it is necessary to explain the correspondence between the target test point and the coverage, the target test point needs to be entered in the format of xxx_cg.(xxx_cp).(bins). The terminal will use "." as a separator to generate a hierarchical list, that is, at least one coverage query field. The final output result will be classified according to the size of the functional coverage - 100%, greater than 60%, less than 60%. If the corresponding functional coverage cannot be found, the coverage query result is none and the color is marked as gray. If the coverage query result is that the functional coverage is 100%, it is marked as green. If the coverage query result is that the functional coverage is greater than 60% and less than 100%, it is marked as yellow. If the coverage query result is that the functional coverage is less than 60%, it is marked as red.

[0147] In one embodiment, in the function coverage file, the function coverage test record corresponding to the function to which the test point set belongs is first recorded. In the function coverage test record, the function point identifier, the function identifier field and the total function coverage are included. The function point identifier and the function identifier field are both used to identify the function to which the test point set belongs, and correspond to the test point identifier and the function coverage field, respectively. After recording the function coverage test record corresponding to the function to which the test point set belongs, in the function coverage file, the function coverage test record corresponding to each test point in the test point set is recorded according to the hierarchical order of the functional hierarchy of the test target. In the function coverage test record, the test point identifier, the function coverage field and the function coverage corresponding to the test point are included.

[0148] In one embodiment, after obtaining the function coverage file, since in the function coverage file, the cover group, the cover point and the bin are mutually inclusive and the three are also hierarchical, a tree structure can be used to save them. Specifically, the relationship between the cover group, the cover point and the bin can be as follows: Fig.12 As shown, a cover group is composed of cover points, and a cover point is composed of bins.

[0149] In one embodiment, when generating a function coverage tree, the terminal obtains the function identification field of the function to which the test point set belongs from the function coverage file, constructs the root node of the function coverage tree based on the function identification field, traverses the function coverage test records in the function coverage file according to the hierarchical order of the functional hierarchy of the test target, and determines the function identification field or function coverage field to which the function coverage field in the traversed function coverage test record belongs based on the test point identification in the traversed function coverage test record, takes the node in the function coverage tree corresponding to the determined function identification field or function coverage field as the parent node, constructs a node corresponding to the function coverage field in the traversed function coverage test record, and associates the function coverage in the traversed function coverage test record with the constructed node. The generated function coverage tree can be as follows Figure 4 shown.

[0150] In one embodiment, after generating a functional coverage tree, the functional coverage tree can be used to query the functional coverage of the target test point. For at least a portion of the target test points in the test point set, the terminal will identify the functional level separation identifier in the test point name of the target test point, and use the functional level separation identifier as a split point to decompose the test point name of the target test point to obtain at least one coverage query field. In a specific application, the functional level separation identifier can be ".", then the terminal will use "." as a split point to decompose the test point name of the target test point into at least one coverage query field, and the at least one coverage query field can constitute a list.

[0151] In one embodiment, based on obtaining at least one coverage query field, the terminal determines the query level range for querying in the functional coverage tree according to the number of at least one coverage query field, and the query level range includes continuous levels starting from the level below the root node and with the number of levels being the number of levels. For example, assuming that the test point name of the target test point is a_cg.b_cp, with "." as the split point, the test point name can be split into two coverage query fields "a_cg" and "b_cp", so that it can be determined that the query level range includes continuous levels with the number of levels being 2 starting from the level below the root node. Fig.13 Taking the functional coverage tree in as an example, the query level range is the second level and the third level. Based on the determination of the query level range, the terminal will query level by level within the query level range according to the level order of at least one coverage query field in the functional level of the test target, and obtain the corresponding coverage query result of the target test point.

[0152] In one embodiment, the terminal determines the coverage query field corresponding to each level within the query level range according to the hierarchical order of at least one coverage query field in the functional level of the test target. In the process of querying level by level within the query level range, the query is performed at the queried level according to the coverage query field corresponding to the queried level. When the target node is queried in the queried level, the coverage query result corresponding to the target test point is obtained according to the target node; the target node is a node that matches the coverage query field corresponding to the queried level. When the child node in the queried level is not the target node, fall back to the parent node of the child node, and continue to query from the parent node to the unqueried nodes in the queried level until the target node is queried, and obtain the coverage query result corresponding to the target test point according to the target node. When the target node does not exist in the queried level, the preconfigured query result representing the absence of functional coverage is used as the coverage query result corresponding to the target test point.

[0153] In one embodiment, when obtaining the coverage query result corresponding to the target test point based on the target node, if the target node is the node of the last level in the query level range, the terminal will directly use the functional coverage corresponding to the target node as the coverage query result corresponding to the target test point. If the target node is not the node of the last level in the query level range, the terminal will use the target node as the parent node and continue to query the child nodes in the next level corresponding to the queried level until the target node in the last level in the query level range, that is, the matching node corresponding to the target test point, is found, and the functional coverage corresponding to the target node in the last level in the query level range is used as the coverage query result corresponding to the target test point.

[0154] In one embodiment, taking the test point name of the target test point as a_cg.b_cp as an example, with "." as the split point, the test point name can be split into two coverage query fields "a_cg" and "b_cp", so that it can be determined that the query level range includes 2 consecutive levels starting from the next level of the root node. When querying level by level within the query level range, the terminal first queries whether there is a child node representing the function coverage field "a_cg" in the second level, and finds the child node representing the function coverage field "a_cg" in the second level. After the subnode representing the function coverage field "a_cg", query whether there is a subnode representing the function coverage field "b_cp" in the subnode of the subnode representing the function coverage field "a_cg" in the third level. If there is, the function coverage corresponding to the subnode representing the function coverage field "b_cp" is used as the coverage query result of the target test point. If there is no subnode representing the function coverage field "b_cp", the preconfigured query result representing the non-existence of function coverage (specifically, it can be none) is used as the corresponding coverage query result of the target test point.

[0155] It should be noted that by querying only within the query level range, the function coverage tree can be truncated and searched, which can speed up the search for function coverage, thereby improving the search speed and further improving the test point marking efficiency. Fig.13 Take the function coverage tree in as an example to illustrate that when the test point name of the target test point is a_cg.b_cp, it is only necessary to query the third level, without querying the fourth level, which can greatly improve the query speed. When the test point name of the target test point is a_cg, it is only necessary to query the second level, without querying the third level, which can greatly improve the query speed.

[0156] In one embodiment, after obtaining the corresponding coverage query results of the target test points, in the table of test points to be marked, the terminal will mark the corresponding coverage query results of at least part of the target test points in correspondence with the test point names of the corresponding target test points, classify the corresponding coverage query results of at least part of the target test points according to the coverage threshold, and obtain at least one coverage category, and mark the coverage query results belonging to each coverage category according to the corresponding coverage color of at least one coverage category to obtain a test point reverse marking table.

[0157] The inventor believes that reverse marking of test points is an important acceptance step in EDA front-end verification. However, the traditional method is mainly for verification personnel to refer to the functional coverage file and manually reverse mark the test points, which has the problem of low test point marking efficiency. Based on this, the present application provides a test point marking method. By using the test point marking method of the present application, it can help verification personnel quantify the verification progress and unify and regularize the standards for measuring the verification progress. In addition, in the present application, different coverage marking colors are used to mark the coverage query results belonging to different coverage categories respectively, which can help verification personnel to quickly find verification problems and eliminate redundant information. The generated test point reverse marking table can reduce the workload of verification personnel in copying and transferring results, reduce editing time, and can directly use the results for reporting, delivery, etc., which can improve the processing efficiency of front-end verification.

[0158] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0159] Based on the same inventive concept, the embodiment of the present application also provides a test point marking device for implementing the test point marking method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more test point marking device embodiments provided below can refer to the limitations of the test point marking method above, and will not be repeated here.

[0160] In one embodiment, Fig.14 As shown, a test point marking device is provided, including: a coverage tree acquisition module 1402, a test point decomposition module 1404, a coverage query module 1406 and a marking module 1408, wherein:

[0161] The coverage tree acquisition module 1402 is used to acquire a function coverage tree generated after testing the test point set of the test target; the root node in the function coverage tree represents the function identification field of the function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in the function hierarchy of the test target, a descendant node corresponds to the level where the function coverage field is located, and is subordinate to the level where the field represented by the parent node of the descendant node is located; a descendant node is associated with the function coverage corresponding to the represented function coverage field;

[0162] A test point decomposition module 1404 is used to decompose the test point names of at least a part of the target test points in the test point set according to the functional level of the test target to obtain at least one coverage query field;

[0163] A coverage query module 1406 is used to query in the function coverage tree according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target, and obtain a coverage query result corresponding to the target test point;

[0164] The marking module 1408 is used to mark the coverage query result and the test point name of the target test point accordingly.

[0165] The above-mentioned test point marking device, by obtaining a functional coverage tree generated after testing a test point set of a test target, decomposes the test point name of the target test point according to the functional hierarchy of the test target for at least a part of the target test points in the test point set, and can obtain at least one coverage query field, and then can query in the obtained functional coverage tree according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target. Since the levels in the functional coverage tree correspond to the levels in the functional hierarchy of the test target one-to-one, any descendant node of the root node represents a functional coverage field corresponding to a test point, and in the functional hierarchy of the test target, a descendant node corresponds to the layer where the functional coverage field is located. The level is the level at which the field represented by the parent node of a descendant node is located. By querying in the order of the levels, at least one coverage query field can be used to query the nodes representing the function coverage fields level by level in the function coverage tree, and the corresponding coverage query result of the target test point is obtained. The coverage query result and the test point name of the target test point are marked accordingly to achieve reverse marking of the test point. In the whole process, the correspondence between the levels in the obtained function coverage tree and the levels in the functional hierarchy of the test target and the at least one coverage query field obtained by decomposing the test point name of the target test point can be used to realize rapid query and marking of the function coverage of the target test point, which can improve the test point marking efficiency.

[0166] In one embodiment, the coverage tree acquisition module is also used to obtain a functional coverage file generated after testing a set of test points of a test target. The functional coverage file records the functional coverage test records corresponding to each test point in the test point set. The functional coverage test records include a test point identifier, a functional coverage field and a functional coverage corresponding to the test point. The test point identifier indicates the functional identification field or the functional coverage field to which the corresponding functional coverage field belongs. Based on the functional coverage file, a functional coverage tree is generated.

[0167] In one embodiment, the coverage tree acquisition module is also used to obtain the function identification field of the function to which the test point set belongs, construct the root node of the function coverage tree based on the function identification field, traverse the function coverage test records in the function coverage file according to the hierarchical order of the function hierarchy of the test target, determine the function identification field or function coverage field to which the function coverage field in the traversed function coverage test record belongs according to the test point identification in the traversed function coverage test record, use the node in the function coverage tree corresponding to the determined function identification field or function coverage field as the parent node, construct a node corresponding to the function coverage field in the traversed function coverage test record, and associate the function coverage in the traversed function coverage test record with the constructed node.

[0168] In one embodiment, the test point decomposition module is further used to identify the functional level separation identifier in the test point name of the target test point, and decompose the test point name of the target test point using the functional level separation identifier as a split point to obtain at least one coverage query field.

[0169] In one embodiment, the coverage query module is also used to determine the query level range for querying in the functional coverage tree based on the number of at least one coverage query field; the query level range includes consecutive levels starting from the next level of the root node, with the number of levels being the number of levels, and the query is performed level by level within the query level range according to the level order of at least one coverage query field in the functional level of the test target to obtain the corresponding coverage query result of the target test point.

[0170] In one embodiment, the coverage query module is also used to determine the coverage query field corresponding to each level within the query level range according to the hierarchical order of at least one coverage query field in the functional hierarchy of the test target. In the process of querying level by level within the query level range, at the queried level, a query is performed according to the coverage query field corresponding to the queried level to obtain the corresponding coverage query result of the target test point.

[0171] In one embodiment, the coverage query module is also used to query at the queried level according to the coverage query field corresponding to the queried level. When the target node is found within the queried level, the corresponding coverage query result of the target test point is obtained according to the target node. The target node is a node that matches the coverage query field corresponding to the queried level.

[0172] In one embodiment, the coverage query module is also used to fall back to the parent node of the child node when the child node in the queried level is not the target node, and continue to query from the parent node to the unqueried nodes in the queried level until the target node is queried, and obtain the corresponding coverage query result of the target test point based on the target node.

[0173] In one embodiment, the coverage query module is further used to use the functional coverage corresponding to the target node as the coverage query result corresponding to the target test point when the target node is a node at the last level within the query level range.

[0174] In one embodiment, the coverage query module is further configured to use a preconfigured query result indicating that there is no functional coverage as a coverage query result corresponding to the target test point when there is no target node in the queried level.

[0175] In one embodiment, at least a portion of the target test points constitute a table of test points to be marked, and the marking module is also used to mark the corresponding coverage query results of at least a portion of the target test points in the table of test points to be marked, respectively, with the corresponding test point names of the target test points, to obtain a test point reverse marking table.

[0176] In one embodiment, the marking module is also used to mark the corresponding coverage query results of at least a part of the target test points in the table of test points to be marked respectively with the test point names of the corresponding target test points, classify the corresponding coverage query results of at least a part of the target test points according to the coverage threshold to obtain at least one coverage category, mark the coverage query results belonging to each coverage category according to the corresponding coverage color of at least one coverage category, and obtain a test point reverse marking table.

[0177] Each module in the above-mentioned test point marking device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each module above.

[0178] In one embodiment, a computer device is provided. The computer device may be a terminal or a server. Taking the computer device as a terminal as an example, its internal structure diagram may be as follows: Fig.15 As shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit and an input device. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface, the display unit and the input device are connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. When the computer program is executed by the processor, a test point marking method is implemented. The display unit of the computer device is used to form a visually visible image, and can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen. The input device of the computer device can be a touch layer covered on the display screen, or a button, trackball or touchpad set on the computer device casing, or an external keyboard, touchpad or mouse, etc.

[0179] Those skilled in the art will understand that Fig.15 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0180] In one embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above method embodiments when executing the computer program.

[0181] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0182] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

[0183] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but are not limited to this.

[0184] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0185] The above-described 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 the present application. 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 protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A test point marking method, characterized in that: The method comprises: A function coverage tree generated after testing a test point set of a test target is obtained; a root node in the function coverage tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in a function hierarchy of the test target, a level at which a function coverage field corresponding to the descendant node is located is subordinate to a level at which a field represented by a parent node of the descendant node is located; the descendant node is associated with a function coverage rate corresponding to the represented function coverage field; For at least a part of the target test points in the test point set, decompose the test point names of the target test points according to the functional level of the test target to obtain at least one coverage query field; According to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, query is performed in the functional coverage tree to obtain a coverage query result corresponding to the target test point; The coverage query result is marked correspondingly to the test point name of the target test point.

2. The method according to claim 1, characterized in that The step of obtaining a function coverage tree generated after testing a test point set of a test target includes: Obtain a function coverage file generated after testing a test point set of a test target; the function coverage file records a function coverage test record corresponding to each test point in the test point set; the function coverage test record includes a test point identifier, a function coverage field and a function coverage rate corresponding to the test point; the test point identifier indicates a function identifier field or a function coverage field to which the corresponding function coverage field belongs; Based on the function coverage file, a function coverage tree is generated.

3. The method according to claim 2, characterized in that The generating a function coverage tree based on the function coverage file comprises: Acquire a function identification field of the function to which the test point set belongs, and construct a root node of a function coverage tree based on the function identification field; Traversing the function coverage test records in the function coverage file according to the hierarchical order of the function levels of the test target; According to the test point identifier in the traversed function coverage test record, determine the function identifier field or the function coverage field to which the function coverage field in the traversed function coverage test record belongs; Taking the node corresponding to the determined function identification field or function coverage field in the function coverage rate tree as the parent node, constructing the node corresponding to the function coverage field in the traversed function coverage rate test record; Associate the function coverage in the traversed function coverage test record with the constructed node.

4. The method according to claim 1, characterized in that: Decomposing the test point name of the target test point according to the functional level of the test target to obtain at least one coverage query field includes: A functional level separation identifier in the test point name of the target test point is identified, and the test point name of the target test point is decomposed with the functional level separation identifier as a split point to obtain at least one coverage query field.

5. The method according to any one of claims 1 to 4, characterized in that: The querying in the function coverage tree according to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target to obtain the coverage query result corresponding to the target test point includes: Determine, according to the number of the at least one coverage query field, a query level range for querying in the function coverage tree; the query level range includes consecutive levels starting from a level below the root node and having the number of levels as the number of levels; According to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, a query is performed hierarchically within the query hierarchy range to obtain a coverage query result corresponding to the target test point.

6. The method according to claim 5, characterized in that The querying is performed level by level within the query level range according to the level order of the at least one coverage query field in the functional level of the test target to obtain the coverage query result corresponding to the target test point, including: Determine, according to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, a coverage query field corresponding to each level within the query hierarchy range; In the process of querying level by level within the query level range, at the queried level, a query is performed according to the coverage query field corresponding to the queried level to obtain a coverage query result corresponding to the target test point.

7. According to the method of claim 6, the querying at the queried level according to the coverage query field corresponding to the queried level to obtain the coverage query result corresponding to the target test point comprises: At the queried level, query according to the coverage query field corresponding to the queried level; When a target node is found in the found level, a coverage query result corresponding to the target test point is obtained according to the target node; The target node is a node that matches the coverage query field corresponding to the queried level.

8. The method according to claim 7, characterized in that The method further comprises: When the child node in the queried level is not the target node, fall back to the parent node of the child node, and continue to query from the parent node to the unqueried nodes in the queried level until the target node is queried, and obtain the corresponding coverage query result of the target test point based on the target node.

9. The method according to claim 7 or 8, characterized in that: The obtaining, according to the target node, a coverage query result corresponding to the target test point includes: In the case where the target node is a node of the last level within the query level range, the functional coverage corresponding to the target node is used as the coverage query result corresponding to the target test point.

10. The method according to claim 7, characterized in that The method further comprises: In the case that the target node does not exist in the queried level, a preconfigured query result indicating that there is no functional coverage is used as a coverage query result corresponding to the target test point.

11. The method according to claim 1, characterized in that: The at least part of the target test points constitute a table of test points to be marked; and the corresponding marking of the coverage query result and the test point name of the target test point comprises: In the table of test points to be marked, the coverage query results corresponding to the at least a portion of the target test points are marked corresponding to the test point names of the corresponding target test points, so as to obtain a test point reverse marking table.

12. The method according to claim 11, characterized in that In the table of test points to be marked, the coverage query results corresponding to the at least a portion of the target test points are marked corresponding to the test point names of the corresponding target test points, and the test point reverse marking table is obtained, which includes: In the table of test points to be marked, the coverage query results corresponding to the at least a portion of the target test points are marked in correspondence with the test point names of the corresponding target test points; Classifying the coverage query results corresponding to the at least a portion of the target test points according to the coverage threshold to obtain at least one coverage category; According to the coverage marking color corresponding to each of the at least one coverage category, the coverage query results belonging to each coverage category are marked respectively to obtain the test point reverse marking table.

13. A test point marking device, characterized in that: The device comprises: A coverage tree acquisition module, used for acquiring a function coverage tree generated after testing a test point set of a test target; a root node in the function coverage tree represents a function identification field of a function to which the test point set belongs, and any descendant node of the root node represents a function coverage field corresponding to a test point in the test point set; in the function hierarchy of the test target, a level at which a function coverage field corresponding to a descendant node is located is subordinate to a level at which a field represented by a parent node of the descendant node is located; the descendant node is associated with a function coverage rate corresponding to the represented function coverage field; A test point decomposition module, for decomposing the test point names of at least a part of the target test points in the test point set according to the functional level of the test target, to obtain at least one coverage query field; A coverage query module, configured to query the functional coverage tree according to the hierarchical order of the at least one coverage query field in the functional hierarchy of the test target, and obtain a coverage query result corresponding to the target test point; The marking module is used to mark the coverage query result and the test point name of the target test point in correspondence.

14. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 12 are implemented.

15. 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 method according to any one of claims 1 to 12 are implemented.

16. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 12 are implemented.

Images