Program code parsing method and memory state analysis method based on a parsing system

Abstract

The present disclosure relates to the field of computer technologies, and discloses a program code parsing method and a memory state analysis method based on a parsing system; the method includes obtaining a target program code; obtaining parsing reference information and constructing a first prompt word according to the parsing reference information, where the parsing reference information includes one or more of code parsing logic, example program code, parsing examples, and location characteristics of target data structures; inputting the target program code and the first prompt word into a parsing model to obtain a parsing file, and obtaining field identification information of target structure fields in the target program code; inputting the field identification information into a query model to search for field attributes and field access paths of the target structure fields; according to the field attributes and field access paths, searching for the current value of the target structure fields in the parsed memory state file; and performing memory state analysis according to the current value of the target structure fields. The problem location difficulty can be reduced.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technologies, and particularly to a method for parsing program code and a method for analyzing memory status based on a parsing system. Background Art

[0002] With the rapid development of technologies such as big data, cloud computing, and cloud disks, the architecture of storage systems has gradually become more complex. This complexity is not only reflected in the diversification of storage media, but also in the multi-level design at the software level. Among them, the multi-level design at the software level involves file systems, data backup, cache mechanisms, data thinning / compression and deduplication, space virtualization, etc. The software functions in these storage systems may require more than millions of lines of program code to implement. In order to quickly locate problems in the program code, some technologies generate memory status files (also known as dump files). The memory status file includes the complete memory status at the moment when problems occur in the program code in the storage system (such as the stack information of processes, the current values in registers, memory allocation, log information, etc.). By parsing the memory status file, the current values of each field in the program code can be obtained. By analyzing the current values of these fields, the location where problems occur in the program code can be located, and then the problems can be modified.

[0003] Currently, generally, technicians manually parse the memory status file and locate the problems in the program code of the storage system according to the parsing results. However, there are too many fields in the memory status file and the hierarchical structure relationship is relatively complex, making it difficult for technicians to comprehensively master all the fields, resulting in a relatively high difficulty in problem location. Summary of the Invention

[0004] In view of this, the present disclosure provides a method for parsing program code, a method for analyzing memory status, an electronic device, a computer-readable storage medium, and a computer program product, which can reduce the difficulty of problem location.

[0005] In a first aspect, the present disclosure provides a method for parsing program code based on a parsing system. The parsing system includes a first data processing module and a trained parsing model. The method is applied to the first data processing module. The method includes:

[0006] Obtain a target program code, where the target program code includes a pre-defined target data structure, and the target data structure includes one or more structure fields;

[0007] Obtain parsing reference information, and construct a first prompt word based on the parsing reference information. The parsing reference information includes one or more of code parsing logic, example program code, parsing examples, and location features of the target data structure;

[0008] Input the target program code and the first prompt word into the parsing model, so that the parsing model outputs a parsing file of the target program code, and the parsing file includes the field attributes and field access paths of the structure fields.

[0009] In a second aspect, the present disclosure provides a method for analyzing the memory state based on a parsing system. The parsing system includes a second data processing module and a trained query model. The method is applied to the second data processing module. The method includes:

[0010] Obtain the field identification information of the target structure field in the target program code;

[0011] Input the field identification information into the query model. Based on the field identification information, the query model searches for the field attributes and field access paths of the target structure field in the parsing file generated by the above method;

[0012] According to the field attributes and the field access paths, search for the current value of the target structure field in the parsed memory state file;

[0013] Perform memory state analysis based on the current value of the target structure field.

[0014] In a third aspect, the present disclosure provides a program code parsing device based on a parsing system. The parsing system includes a first data processing module and a trained parsing model. The method is applied to the first data processing module. The device includes:

[0015] A code acquisition module, configured to acquire a target program code, where the target program code includes a predefined target data structure, and the target data structure includes one or more structure fields;

[0016] An information acquisition module, configured to acquire parsing reference information and construct a first prompt word according to the parsing reference information. The parsing reference information includes one or more of code parsing logic, example program code, parsing examples, and location features of the target data structure;

[0017] A file generation module, configured to input the target program code and the first prompt word into the parsing model, so that the parsing model outputs a parsing file of the target program code, and the parsing file includes the field attributes and field access paths of the structure fields.

[0018] Fourthly, the present disclosure provides a memory state analysis device based on a parsing system, where the parsing system includes a second data processing module and a trained query model, and the method is applied to the second data processing module; the device includes:

[0019] An identification information acquisition module, configured to acquire field identification information of a target structure field in a target program code;

[0020] An information search module, configured to input the field identification information into the query model, and the query model searches for the field attributes and field access paths of the target structure field in a parsing file generated based on the above method;

[0021] A value search module, configured to search for the current value of the target structure field in the memory in a parsed memory state file according to the field attributes and the field access paths;

[0022] An analysis module, configured to perform memory state analysis according to the current value of the target structure field.

[0023] Fifthly, the present disclosure provides an electronic device, including: a memory and a processor, the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the computer instructions to execute the above method.

[0024] Sixthly, the present disclosure provides a computer-readable storage medium, on which computer instructions are stored, and the computer instructions are used to cause a computer to execute the above method.

[0025] Seventhly, the present disclosure provides a computer program product, including computer instructions, and the computer instructions are used to cause a computer to execute the above method.

[0026] In the technical solutions of some embodiments of the present disclosure, on the one hand, based on the position characteristics of the target data structure, the code parsing logic, the example program code, and the parsing example in the target program code, a first prompt word is constructed, and the first prompt word and the target program code are input into the parsing model, and the parsing file of the target program code is output through the parsing model. In this way, during the process of technicians locating program code problems, there is no need to manually write a parsing file, and even when technicians are not familiar with the meanings of the structure fields in the target data structure and do not know how to use binary editing tools, they can still obtain the parsing file, achieving the purpose of reducing the difficulty of location. On the other hand, the field identification information of the target structure field is input into the query model, and the query model, based on the field identification information, searches for the field attributes and field access paths of the target structure field in the parsing file. In this way, when technicians forget the field attributes and field access paths of the target structure field, they can still locate program code problems, thus greatly reducing the difficulty of problem location. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] In order to more clearly illustrate the specific embodiments of the present disclosure or the technical solutions in the related art, the following will briefly introduce the drawings required for use in the description of the specific embodiments or the related art. Obviously, the following drawings are some embodiments of the present disclosure. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0028] Figure 1 It is a schematic diagram of the modules of the parsing system provided by some embodiments of the present disclosure;

[0029] Figure 2 It is an interaction diagram of the program code parsing method provided by some embodiments of the present disclosure;

[0030] Figure 3 It is a flowchart of the program code parsing method provided by some embodiments of the present disclosure;

[0031] Figure 4 It is an interaction diagram of adding padding fields to the parsing file provided by some embodiments of the present disclosure;

[0032] Figure 5 It is an interaction diagram of adding field descriptions to the parsing file provided by some embodiments of the present disclosure;

[0033] Figure 6 It is an interaction diagram of the memory state analysis method provided by some embodiments of the present disclosure;

[0034] Figure 7 It is a flowchart of the memory state analysis method provided by some embodiments of the present disclosure;

[0035] Figure 8 It is a schematic diagram of the modules of a program code parsing device provided by an embodiment of the present disclosure;

[0036] Figure 9 It is a schematic diagram of the modules of a memory state analysis device provided by an embodiment of the present disclosure;

[0037] Figure 10 It is a schematic diagram of the structure of an electronic device provided by some embodiments of the present disclosure. Detailed implementation manners

[0038] To make the objectives, technical solutions, and advantages of the embodiments of the present disclosure clearer, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure. Apparently, the described embodiments are some, but not all, of the embodiments of the present disclosure. All other embodiments obtained by those skilled in the art based on the embodiments of the present disclosure without creative efforts shall fall within the protection scope of the present disclosure.

[0039] The embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. On the contrary, these embodiments are provided to more thoroughly and completely understand the present disclosure. It should be understood that the accompanying drawings and embodiments of the present disclosure are only for exemplary purposes and are not used to limit the protection scope of the present disclosure.

[0040] In the description of the embodiments of the present disclosure, the term "including" and its like shall be understood as an open inclusion, that is, "including but not limited to". The term "based on" shall be understood as "at least partially based on". The term "an embodiment" or "the embodiment" shall be understood as "at least one embodiment". The term "some embodiments" shall be understood as "at least some embodiments". There may also be other explicit and implicit definitions hereinafter.

[0041] In this article, unless otherwise specified, performing a step "in response to A" does not mean that the step is immediately performed after "A", but may include one or more intermediate steps.

[0042] It can be understood that the data involved in the technical solution of the present disclosure (including but not limited to the data itself, the acquisition, use, storage, or deletion of the data) shall comply with the requirements of the corresponding laws, regulations, and related provisions.

[0043] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, usage scopes, usage scenarios, etc. of the information involved in the present disclosure should be informed to relevant users and the authorization of relevant users should be obtained through appropriate means in accordance with relevant laws and regulations. Among them, relevant users may include any type of right subject, such as individuals, enterprises, and groups.

[0044] For example, when responding to an active request from a user, a prompt message is sent to the relevant user to clearly prompt the relevant user that the operation requested by it will require obtaining and using the information of the relevant user, so that the relevant user can autonomously choose whether to provide information to software or hardware such as an electronic device, an application program, a server, or a storage medium that executes the operation of the technical solution of the present disclosure according to the prompt message.

[0045] As an optional but non-limiting implementation manner, the manner of sending a prompt message to the relevant user in response to receiving an active request from the relevant user may be, for example, in the form of a pop-up window, and the prompt message may be presented in text in the pop-up window. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide information to the electronic device.

[0046] It is understandable that the above process of notifying and obtaining user authorization is only illustrative and does not limit the implementation manner of the present disclosure, and other manners that meet relevant laws and regulations can also be applied to the implementation manner of the present disclosure.

[0047] When there is a problem with the program code in the storage system, the memory state file (i.e., the dump file) can be parsed to obtain the current values of each field in the program code. By comparing the current values of each field with the theoretical values, the position where the problem occurs in the program code can be located. For example, assume that the current value of field A parsed from the memory state file is 100. However, theoretically, the value range of field A should be between 20 and 50. Then, it can be determined that there may be a problem with the program code related to field A in the storage system, and then the problem of the program code can be modified.

[0048] In some technologies, the memory state file is a binary file. When locating the problem of the program code, technicians need to manually perform the following steps 11) to 13):

[0049] 11) Write a parsing file for the program code according to the data structure defined in the program code.

[0050] The parsed file may include the structure fields of at least part of the data structure, the field attributes of these structure fields, and the field access paths. Among them, the field attributes may include, but are not limited to, the field name, the field type, and the offset address of the structure field in memory. The content in the parsed file and the content in the program code can be mapped according to rules. For example, int test in the program code can be mapped to n32 test in the parsed file.

[0051] The field access path refers to the nested relationship between the data structure where the structure field is located and other data structures. This nested relationship is used to describe the process of how to start from the root data structure, pass through one or more intermediate data structures, and finally access the structure field. For example, assume the following two global data structures are defined in the program code:

[0052] struct NesteStruct {

[0053] int f;

[0054] short g;

[0055] };

[0056] struct MyStruct {

[0057] char a;

[0058] int b;

[0059] struct NesteStruct n;

[0060] double d;

[0061] char e

[10] ;

[0062] };

[0063] Taking the structure field f as an example. The data structure where the structure field f is located is NesteStruct, and the data structure NesteStruct is nested in the data structure MyStruct. Therefore, in the parsed file, the field access path and field attributes of the structure field f can be represented in the following way:

[0064] MyStruct

[0065] {

[0066] NesteStruct

[0067] {

[0068] n32 “f”

[0069] }

[0070] }

[0071] Furthermore, each data structure may have its own corresponding base address. By combining the field access paths, offset addresses, and field types of each structure field in the parsing file, the current values of each structure field can be found in memory. For example, in the above example, assuming that the base address of the data structure NesteStruct is 0x1000 and the offset address of the structure field f is 0x0020, then the current value of the structure field f can be obtained at the physical address 0x1000 + 0x0020 in memory.

[0072] 12) According to the format of the parsing file, use a binary editing tool to parse the memory status file into a readable file to obtain the current values of each structure field in the data structure in memory.

[0073] For example, assume the content in the parsing file is as follows:

[0074] struct

[0075] {

[0076] n32 “test1”

[0077] n16 “test2”

[0078] n16 “pad”

[0079] n64 “test3”

[0080] }

[0081] Among them, the structure field pad is a padding field for memory alignment and does not represent data.

[0082] According to the format of the parsing file, parsing the memory status file can obtain the following content:

[0083] test1 5

[0084] test2 2

[0085] pad 0

[0086] test3 1

[0087] The above content indicates that in memory, the current value of the structure field test1 is 5, the current value of the structure field test2 is 2, and the current value of the structure field test3 is 3.

[0088] 13) From the parsed memory status file, view the current values of one or more structure fields, and compare the current values of each structure field with the theoretical values to locate program code problems.

[0089] Currently, when technicians manually execute the above steps 11) to 13), the following problems 21) to 24) exist:

[0090] 21) There are many structure fields in the program code, and technicians usually cannot master the meanings of all structure fields. When writing the parsing file of the program code, it is necessary to perform program code analysis or consult personnel familiar with relevant structure fields, which is a cumbersome process and difficult.

[0091] 22) During the process of writing the parsing file, it is not only required to write structure fields one by one according to the data structure in the program code, but also necessary to perform correct memory address alignment according to the structure fields and the memory size occupied by the structure. If the alignment is incorrect, the memory status file cannot be correctly parsed according to the parsing file. This requires technicians to have relatively high professional skills.

[0092] 23) When parsing the memory status file according to the format of the parsing file, technicians need to master the use method of binary editing tools, which requires relatively high professional skills for technicians.

[0093] 24) When locating problems in the program code based on the parsed memory status file, due to the large number of structure fields, technicians cannot remember the field names and field access paths of all structure fields, which increases the difficulty of problem location.

[0094] In summary, in some technologies, when locating problems in the program code of the storage system, the difficulty is relatively high, resulting in corresponding impacts on the efficiency and accuracy of problem location. To solve the above problems, the present disclosure first provides a parsing system. Referring to Figure 1 , it is a module schematic diagram of the parsing system provided by some embodiments of the present disclosure. Figure 1 In , the parsing system includes a first data processing module, a second data processing module, a trained parsing model, an alignment model, a description supplement model, and a query model.

[0095] Based on Figure 1 the above-mentioned parsing system, the present disclosure provides a program code parsing method based on the parsing system, which can reduce the difficulty of writing the program code parsing file, thereby improving the efficiency and accuracy of program code location. The program code parsing method can be applied to the first data processing module in the parsing system, or can be applied to an electronic device running the parsing system. The electronic device may include, but is not limited to, a tablet computer, a notebook computer, a tablet computer, a server, etc. Referring toFigure 2 and Figure 3 。 Figure 2 An interaction schematic diagram of the program code parsing method provided by some embodiments of the present disclosure. Figure 3 A flowchart of the program code parsing method provided by some embodiments of the present disclosure. Figure 3 In [the figure], the program code parsing method includes the following steps:

[0096] Step S301, obtain a target program code, where the target program code includes a pre-defined target data structure, and the target data structure includes one or more structure fields.

[0097] In this embodiment, Figure 1 the first data processing module in [the figure] can display a first human-computer interaction interface. Through the first human-computer interaction interface, a technician can input the target program code or the storage path of the target program code. When the storage path of the target program code is received, the target program code can be obtained from the corresponding storage path.

[0098] The target program code can be program code in the storage system for implementing various software functions, such as program code for implementing file systems, data backup, cache mechanisms, data thinning / compression and deduplication, space virtualization, etc.

[0099] During the encoding process of the target program code, one or more data structures can be defined. For example, in the target program code, a data structure MyStruct can be defined in the following way:

[0100]

[0101] After defining the data structure, the operating system can allocate memory space for the structure fields in the memory according to the field types of the respective structure fields in the data structure.

[0102] Furthermore, the data structures in the target program code can be divided into global data structures and local data structures. Global data structures are generally defined at the starting position of the target program code, and local data structures are generally defined and used inside the functions of the target program code. Usually, during the running process of the target program code, the global data structures can always occupy memory space, and the local data structures only occupy memory space during the running process of the corresponding functions. When locating problems in the target program code, generally, the current values and theoretical values of the respective structure fields in the global data structures are mainly compared. In view of this, in this embodiment, the global data structures in the target program code can be used as the target data structure, and the target data structure includes one or more structure fields.

[0103] Step S302: Obtain parsing reference information, and construct a first prompt word based on the parsing reference information. The parsing reference information includes one or more of code parsing logic, example program code, parsing examples, and location features of the target data structure.

[0104] In this embodiment, the electronic device executing the program code parsing method may display a second human-computer interaction interface. Through the second human-computer interaction interface, the parsing reference information of the target data structure input by the technician can be received. The parsing reference information may include code parsing logic, example program code, parsing examples, and location features of the global data structure in the target program code. Among them:

[0105] The location features may include, but are not limited to, the regional location of the target data structure in the target program code (such as which line of the target program code the target data structure is on), the program code around the global data structure in the target program code, and the like.

[0106] The code parsing logic may include the mapping relationship between the target program code and the content of the parsing file. For example, map int in the target program code to n32 in the parsing file.

[0107] The example program code may be part of the target program code or other program code outside the target program code. The example program code may include the target data structure (such as the global data structure), and the target data structure in the example program code is annotated. In this way, through the annotation, the target data structure can be identified in the example program code.

[0108] The parsing example may be the content in the example parsing file obtained by parsing the example program code.

[0109] Combining the above location features, code parsing logic, example program code, and parsing examples can obtain the first prompt word. Or, extracting keywords from the above location features, code parsing logic, example program code, and parsing examples and combining the keywords can obtain the first prompt word. Of course, the method for constructing the prompt word may include, but is not limited to, the above two methods, and the present disclosure does not limit the method for constructing the prompt word. For example, natural language processing technology may also be used to process the above location features, code parsing logic, example program code, and parsing examples to obtain the prompt word.

[0110] It should be noted that according to actual requirements, the parsing reference information may only include some contents of the position feature, code parsing logic, example program code, and parsing example. For example, it may only include the code parsing logic, example program code, and parsing example, excluding the position feature. The present disclosure places no restrictions on this. Additionally, according to actual requirements, the target data structure may also include a local data structure. The present disclosure places no restrictions on this.

[0111] Step S303: Input the target program code and the first prompt word into the parsing model, so that the parsing model outputs a parsing file of the target program code, and the parsing file includes the field attributes and field access paths of the structure fields.

[0112] Specifically, the parsing model may be a trained first language model. Taking the first prompt word as a reference, based on the knowledge learned during the training process, the parsing model can extract and output the field attributes and field access paths of each structure field in the target data structure.

[0113] The field attributes may include but are not limited to field type, field size, field offset address, etc.

[0114] In this embodiment, the target program code may include multiple target data structures. The parsing model writes the hierarchical relationship between the target data structures in the parsing file, and represents the field access path of the structure field through this hierarchical relationship. For example, assuming that the structure field f is located in the target data structure NesteStruct, and the target data structure NesteStruct is located in the target data structure MyStruct, then the parsing model may specify the field access path of the structure field f in the parsing file in the following manner:

[0115] MyStruct

[0116] {

[0117] NesteStruct

[0118] {

[0119] n32 “f”

[0120] }

[0121] }

[0122] In the hierarchical relationship between the target data structures, the target data structures at different levels may have different indents. The higher the level of a target data structure, the less its indent may be. Based on the indents of each target data structure, the hierarchical relationship between the target data structures can be determined. For example, in the field access path of the above structure field f, the indent of the target data structure MyStruct is less than the indent of the target data structure NesteStruct.

[0123] In this embodiment, when parsing reference information includes the location characteristics of the target data structure, code parsing logic, example program code, and parsing examples, the parsing model can output a parsing file based on the following method:

[0124] Extract the target data structure from the target program code according to the location characteristics of the target data structure;

[0125] Perform syntax conversion on the target data structure according to the code parsing logic;

[0126] Taking the example program code and parsing examples as references, generate and output a parsing file according to the target data structure after syntax conversion.

[0127] For example, assume that the parsing reference information specifies that the location of the target data structure is in lines 2 to 50 of the target program code. Then, according to the form of the data structure marked in the example program code, search for the data structure with the corresponding form in lines 2 to 50 of the target program code as the target data structure. After finding the target data structure, perform syntax conversion on the target data structure according to the code parsing logic, and write the field attributes and field access paths of each field in the target data structure into the parsing file according to the style of the parsing examples.

[0128] In the above embodiment, selecting the location characteristics of the target data structure, code parsing logic, example program code, and parsing examples as parsing reference information has relatively high reference value, so as to ensure the accuracy of the generated parsing file.

[0129] In the technical solutions of some embodiments of the present disclosure, a first prompt word is constructed based on the location characteristics of the target data structure, code parsing logic, example program code, and parsing examples in the target program code, and the first prompt word and the target program code are input into the parsing model, and the parsing model outputs a parsing file of the target program code. In this way, during the process of technicians locating program code problems, they can obtain a parsing file without manually writing a parsing file. Even when technicians are not familiar with the meanings of the structure fields in the target data structure and do not know how to use binary editing tools, the purpose of reducing the location difficulty is achieved.

[0130] Refer to in combination Figure 4 In some embodiments, after obtaining the parsing file, the method of the present disclosure may further include:

[0131] Obtain alignment reference information, and construct a second prompt word according to the alignment reference information. The alignment reference information includes the memory address alignment logic of the structure fields and / or alignment examples;

[0132] Input the second prompt word and the parsing file into the alignment model, so that the alignment model adds padding fields to the parsing file, and the padding fields are used to make the memory addresses of the structure fields meet the memory address alignment logic.

[0133] Specifically, the memory address alignment logic can represent the memory address alignment requirements of each structure field in the target program code. For example, assume that structure field B is stored after structure field A, structure field A occupies 16 bits of memory, structure field B occupies 32 bits of memory, and it is required that the memory address of structure field B needs to start from an address aligned to 4 bytes. Based on the above assumptions, if structure field B is directly saved after structure field A, the memory address of structure field B does not start from an address aligned to 4 bytes. Therefore, 16 bits of padding fields need to be filled after structure field A to ensure that structure field B is saved starting from an address aligned to 4 bytes. This data storage method based on memory address alignment can improve the data reading speed. The alignment example can be the content in the parsing file where some padding fields have been added.

[0134] Similar to the construction method of the first prompt word, the memory address alignment logic and the alignment example can be combined to obtain the second prompt word, or keywords can also be extracted from the memory address alignment logic and the alignment example and combined to obtain the second prompt word.

[0135] In this embodiment, the electronic device executing the program code parsing method can display a third human-computer interaction interface. Through the third human-computer interaction interface, alignment reference information input by a technician can be received. The alignment model can be a trained second language model.

[0136] By adding padding fields to the parsing file, it can be ensured that the memory addresses of the structure fields meet the memory address alignment requirements, and further, when parsing the memory status file based on the parsing file, the correctness of the parsing result can be ensured.

[0137] Refer to Figure 5 . In some embodiments, after obtaining the parsing file, the method of the present disclosure may further include:

[0138] Obtain sample fields and field descriptions corresponding to the sample fields, and construct a third prompt word based on the corresponding relationship between the sample fields and the field descriptions;

[0139] Input the third prompt word and the parsing file into the description supplement model, so that the description supplement model adds field descriptions of structure fields to the parsing file.

[0140] Specifically, the supplementary model can be a trained third - language model. The construction method of the third prompt word is similar to that of the first prompt word and the second prompt word, which will not be elaborated here. Based on the third prompt word as a reference and the knowledge learned during the training process, the supplementary model can supplement the field descriptions of each structure field in the parsed file. The field description can characterize the meaning, usage instructions, etc. of the structure field.

[0141] By adding field descriptions to the parsed file, it is convenient for technicians to view relevant descriptions such as the meaning of each structure field based on the field descriptions. In this way, even when technicians do not master all the structure fields, they can also locate problems in the program code, greatly reducing the difficulty of problem location.

[0142] In the above - mentioned embodiment, the electronic device executing the program code parsing method can display a fourth human - machine interaction interface. Through the fourth human - machine interaction interface, technicians can input example fields and the corresponding field descriptions of the example fields.

[0143] In some embodiments, the example fields can be some structure fields in the parsed file. The description supplementary model can add field descriptions to the parsed file based on the following method:

[0144] For any structure field in the parsed file, if the structure field is an example field, add the field description of the structure field in the third prompt word to the parsed file; if the structure field is not an example field, use the third prompt word as a reference and add a field description for the structure field in the parsed file.

[0145] In the case of taking some structure fields in the parsed file as example fields, the example fields and the structure fields come from the same file, and the field description style of the example fields can be highly similar to that of the structure fields. Therefore, when adding field descriptions to the structure fields, the field descriptions of the example fields can have high reference value, ensuring the accuracy of the field descriptions of the structure fields.

[0146] In some embodiments, the above - mentioned parsing model, alignment model, and description supplementary model can be integrated into a total model. After inputting the above - mentioned first prompt word, second prompt word, third prompt word, and the target program code into the total model, a parsed file with filled fields and field descriptions can be obtained. Through model integration, there is no need to generate the parsed file in multiple steps, thus simplifying the operation.

[0147] Based on the parsing file, the present disclosure also provides a method for analyzing the memory state based on a parsing system, which can further reduce the difficulty of locating program code problems. The memory state analysis method can be applied to the second data processing module in the parsing system, or can be applied to an electronic device running the parsing system. The electronic device can include a tablet computer, a laptop computer, a server, etc. Referring in combination to Figure 6 and Figure 7 . Figure 6 FIG. is an interaction schematic diagram of the memory state analysis method provided by some embodiments of the present disclosure. Figure 7 FIG. is a flowchart of the memory state analysis method provided by some embodiments of the present disclosure. Figure 7 In, the memory state analysis method includes the following steps:

[0148] Step S701, obtain the field identification information of the target structure field in the target program code.

[0149] Specifically, the target structure field can be a field selected by a technician for locating program code problems. The second data processing module performing the memory state analysis can display a human-computer interaction interface to receive at least one of the following information of the target structure field through the human-computer interaction interface, and use the received information as the field identification information:

[0150] Field name, field ID, field description.

[0151] For example, when a technician can determine the field name or field ID of the target structure field, the field name or field ID of the target structure field can be input in the human-computer interaction interface as the field identification information; when a technician cannot determine the field name or field ID of the target structure field, the field description of the target structure field can be input in the human-computer interaction interface, and these field descriptions can be used as the field identification information.

[0152] Furthermore, in order to ensure the accuracy of the field information, the technician can also use the combination of the field name and the field description of the target structure field as the field identification information. In this way, in the case where there are the same field names in the program code, the target structure field can be identified based on the field description.

[0153] In this embodiment, considering that in the case of a large number of structure fields, a technician may not be able to master the field names and field descriptions of all structure fields, therefore, in the human-computer interaction interface, the technician can also be allowed to input partial field names and partial field descriptions of the target structure field. Furthermore, one of the following information of the target structure field can be used as the field identification information, or a combination of at least two of the following information can be used as the field identification information:

[0154] Partial field name, partial field description

[0155] For example, assume that the field name of the target structure field is "VedioSourceID" and the field description is "video resource ID". When the technician can only remember part of the field name "SourceID" and the field description "video ID", "SourceID" and "video ID" can be input in the human-computer interaction interface as the field identification information of the target structure field.

[0156] In the above embodiments, it is allowed to use part of the field name and part of the field description of the target structure field as the field identification information. In this way, when the technician cannot fully remember the field name or field description of the target structure field, the method of the present disclosure can still be executed to locate the program code problem, with a wider range of use and reduced difficulty in problem location.

[0157] Step S702: Input the field identification information into the query model, and the query model searches for the field attributes and field access paths of the target structure field in the parsing file generated based on the above program code parsing method.

[0158] In this embodiment, the query model may be a trained fourth language model. The query model can search for the field attributes and field access paths of the target structure field in the parsing file based on the following method:

[0159] Match and compare the field identification information of the target structure field with the field identification information of the structure fields in the parsing file to obtain the structure fields in the parsing file that match the target structure field as candidate fields;

[0160] Take the field attributes and field access paths of the candidate fields as the field attributes and field access paths of the target structure field.

[0161] Specifically, if there is a structure field in the parsing file that has the same field identification information as the target structure field, the corresponding structure field is used as the candidate field;

[0162] If there is no field in the parsing file that has the same field identification information as the target structure field, the field identification information of the target structure field is semantically compared with the field identification information of the structure fields in the parsing file to obtain the structure fields in the parsing file that have the same semantics as the target structure field as candidate fields.

[0163] For example, when the obtained field identification information is a combination of partial field names and partial field descriptions of the target structure fields, the query model can perform semantic understanding on the field identification information and search in the parsed file for fields that semantically match the field names and field descriptions of the target structure fields as candidate fields. In this way, problem location can still be carried out when the technician has not entered the complete field name and field description, greatly reducing the difficulty of problem location.

[0164] For another example, when the obtained field identification information is the complete field name and field description, the query model can search in the parsed file for fields whose field names and field descriptions are both the same as those of the target structure fields as candidate fields. In this way, the search accuracy of the candidate fields can be improved, and thus the accuracy of problem location can be improved.

[0165] In this embodiment, when the hierarchical relationship between target data structures is included in the parsed file, the following method can be used to find the field access path of the candidate field:

[0166] Search in the parsed file for the first target data structure where the candidate field is located;

[0167] According to the hierarchical relationship between the target data structures, if there is one or more second target data structures before the first target data structure, then sort the first target data structure and the second target data structures according to the hierarchical relationship to obtain the field access path of the candidate field. If there is no second target data structure before the first target data structure, then use the first target data structure as the field access path of the candidate field. For example, assume that in the parsed file, the hierarchical relationship between the target data structures corresponding to the candidate field f is as follows:

[0168] MyStruct

[0169] {

[0170] NesteStruct

[0171] {

[0172] n32 “f”

[0173] }

[0174] }

[0175] Then, starting from the candidate field f, search for the field NesteStruct whose indentation is one less than that of the candidate field f. The field NesteStruct is the structure name of the target data structure where the candidate field f is located. Then continue to search for the field MyStruct whose indentation is one less than that of the field NesteStruct. The field MyStruct is the structure name of the upper-level target data structure of the target data structure where the candidate field f is located. And so on, until the top-level field is found. Furthermore, according to the hierarchical relationship between the target data structures, sort these structure names to obtain the field access path of the candidate field f. For example, the field access path of the candidate field f is MyStruct>NesteStruct>f.

[0176] Step S703, according to the field attribute and the field access path, search for the current value of the target structure field in the parsed memory status file.

[0177] Specifically, according to the above-mentioned parsed file, the memory status file can be parsed. According to the base address of each target data structure in the field access path and the field type of the structure field in the target data structure, search for the current value of the target structure field in the parsed memory status file. The relevant principle can be referred to the above-mentioned relevant description and will not be elaborated here.

[0178] Step S704, perform memory status analysis according to the current value of the target structure field.

[0179] The so-called memory status analysis is to analyze whether the current value of the target structure field in the memory is reasonable. If it is not reasonable, it means that there is a problem with the program code of the storage system, and the problem of the program code can be located according to the current value of the target structure field.

[0180] In the technical solutions of some embodiments of the present disclosure, input the field identification information of the target structure field into the query model, and the query model, based on the field identification information, searches for the field attribute and the field access path of the target structure field in the parsed file. In this way, when the technical personnel forget the field attribute and the field access path of the target structure field, the problem of the program code can still be located, thereby greatly reducing the difficulty of problem location.

[0181] Corresponding to the program code parsing method, the present disclosure also provides a program code parsing device based on a parsing system. Referring to Figure 8 , a program code parsing device provided by an embodiment of the present disclosure. Figure 8 In, the program code parsing device includes:

[0182] A code acquisition module 801, configured to acquire target program code, where the target program code includes a predefined target data structure, and the target data structure includes one or more structure fields;

[0183] An information acquisition module 802, configured to acquire parsing reference information and construct a first prompt word according to the parsing reference information, where the parsing reference information includes one or more of code parsing logic, example program code, parsing examples, and location features of the target data structure;

[0184] A file generation module 803, configured to input the target program code and the first prompt word into a parsing model, so that the parsing model outputs a parsing file of the target program code, and the parsing file includes field attributes and field access paths of the structure fields.

[0185] In some embodiments, the parsing system further includes a trained alignment model; after obtaining the parsing file, the file generation module 803 is further configured to:

[0186] Acquire alignment reference information and construct a second prompt word according to the alignment reference information, where the alignment reference information includes memory address alignment logic and / or alignment examples of the structure fields;

[0187] Input the second prompt word and the parsing file into the alignment model, so that the alignment model adds padding fields to the parsing file, and the padding fields are used to make the memory addresses of the structure fields meet the memory address alignment logic.

[0188] In some embodiments, the parsing system further includes a trained description supplement model; after obtaining the parsing file, the file generation module 803 is further configured to:

[0189] Acquire example fields and field descriptions corresponding to the example fields, and construct a third prompt word according to the corresponding relationship between the example fields and the field descriptions;

[0190] Input the third prompt word and the parsing file into the description supplement model, so that the description supplement model adds field descriptions of the structure fields to the parsing file.

[0191] In some embodiments, the example fields are some of the structure fields in the parsing file; after the file generation module 803 inputs the third prompt word and the parsing file into the description supplement model, the description supplement model adds field descriptions to the parsing file based on the following method:

[0192] For any structure field in the parsing file, if the structure field is an example field, add the field description of the structure field in the third prompt word to the parsing file; if the structure field is not an example field, use the third prompt word as a reference and add a field description for the structure field in the parsing file.

[0193] In some embodiments, the target program code includes multiple target data structures. After the file generation module 803 inputs the third prompt word and the parsing file into the description supplement model, the parsing model writes the hierarchical relationship between the target data structures in the parsing file, and represents the field access path of the structure fields through the hierarchical relationship. Among them, in the hierarchical relationship, the target data structures at different levels have different indents.

[0194] In some embodiments, when the parsing reference information includes code parsing logic, example program code, parsing examples, and the position characteristics of the target data structure, after the file generation module 803 inputs the third prompt word and the parsing file into the description supplement model, the parsing model outputs the parsing file based on the following method:

[0195] Extract the target data structure from the target program code according to the position characteristics of the target data structure;

[0196] Perform syntax conversion on the target data structure according to the code parsing logic;

[0197] Taking the example program code and the parsing examples as references, generate and output the parsing file according to the target data structure after syntax conversion.

[0198] Corresponding to the memory state analysis method, the present disclosure also provides a memory state analysis device based on a parsing system. Referring to Figure 9 , it is a memory state analysis device provided by an embodiment of the present disclosure. Figure 9 In

[0199] The information acquisition module 901 is used to acquire the field identification information of the target structure fields in the target program code;

[0200] The information search module 902 is used to input the field identification information into the query model, and the query model searches for the field attributes and field access paths of the target structure fields in the parsing file generated based on the above method;

[0201] The value search module 903 is used to search for the current value of the target structure field in the memory in the parsed memory state file according to the field attributes and field access paths;

[0202] The analysis module 904 is used to perform memory state analysis according to the current value of the target structure field.

[0203] In some embodiments, the information acquisition module 901 is specifically used for:

[0204] Display a human-computer interaction interface to receive at least one of the following information of the target structure field through the human-computer interaction interface, and use the received information as the field identification information:

[0205] Field name, field ID, field description.

[0206] In some embodiments, after the information search module 902 inputs the field identification information into the query model, the query model searches for the field attributes and field access paths of the target structure field in the parsing file based on the following method:

[0207] Match and compare the field identification information of the target structure field with the field identification information of the structure fields in the parsing file to obtain the structure fields in the parsing file that match the target structure field as candidate fields;

[0208] Use the field attributes and field access paths of the candidate fields as the field attributes and field access paths of the target structure field.

[0209] In some embodiments, after the information search module 902 inputs the field identification information into the query model, the query model is specifically used for:

[0210] If there is a structure field in the parsing file that has the same field identification information as the target structure field, use the corresponding structure field as a candidate field;

[0211] If there is no field in the parsing file that has the same field identification information as the target structure field, perform a semantic comparison between the field identification information of the target structure field and the field identification information of the structure fields in the parsing file to obtain the structure fields in the parsing file that have the same semantics as the target structure field as candidate fields.

[0212] In some embodiments, when the target program code includes multiple target data structures and the parsing file includes the hierarchical relationship between the target data structures, the information search module 902 is specifically used to search for the field access path of the candidate field according to the following method:

[0213] Search for the first target data structure where the candidate field is located in the parsing file;

[0214] According to the hierarchical relationship between the target data structures, if there is one or more second target data structures before the first target data structure, sort the first target data structure and the second target data structures according to the hierarchical relationship to obtain the field access path of the candidate field. If there is no second target data structure before the first target data structure, use the first target data structure as the field access path of the candidate field.

[0215] In some embodiments, the field attribute includes the field type, and the field type is used to characterize the size of the memory space occupied by the structure field; the value search module 903 is specifically used for:

[0216] According to the base addresses of the respective target data structures in the field access path and the field types of the structure fields in the target data structures, find the current values of the target structure fields in the parsed memory state file.

[0217] The performance monitoring device of the input / output card in this embodiment is presented in the form of functional units. Here, the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and a memory that execute one or more software or fixed programs, and / or other devices that can provide the above functions.

[0218] Embodiments of the present disclosure also provide an electronic device having the above Figure 8 shown program code parsing device, or Figure 9 shown memory state analysis device.

[0219] With reference to Figure 10 , a schematic structural diagram of an electronic device provided by some embodiments of the present disclosure is shown. As Figure 10 shown, the electronic device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including a high-speed interface and a low-speed interface. Each component communicates with each other using different buses and can be installed on a common motherboard or installed in other ways as needed. The processor can process instructions executed within the electronic device, including instructions stored in the memory or on the memory to display graphical information of the GUI on an external input / output device (such as a display device coupled to the interface). In some alternative embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple electronic devices can be connected, and each device provides some necessary operations (for example, as a server array, a set of blade servers, or a multi-processor system). Figure 10 One processor 10 is taken as an example in

[0220] The processor 10 can be a first PCIe device, a network processor, or a combination thereof. Among them, the processor 10 can further include a hardware chip. The above hardware chip can be an application specific integrated circuit, a programmable logic device, or a combination thereof. The above programmable logic device can be a complex programmable logic device, a field programmable gate array, a generic array logic, or any combination thereof.

[0221] Among them, the memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiments.

[0222] The memory 20 may include a program storage area and a data storage area. Among them, the program storage area can store an operating system and application programs required for at least one function; the data storage area can store data created according to the use of the electronic device and the like. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state storage devices. In some alternative embodiments, the memory 20 may optionally include a memory remotely provided with respect to the processor 10, and these remote memories can be connected to the electronic device through a network. Examples of the above network include but are not limited to the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0223] The memory 20 may include a volatile memory, for example, a random access memory; the memory may also include a non-volatile memory, for example, a flash memory, a hard disk, or a solid-state drive; the memory 20 may further include a combination of the above types of memories.

[0224] The electronic device further includes a communication interface 30 for the electronic device to communicate with other devices or communication networks.

[0225] The embodiments of the present disclosure also provide a computer-readable storage medium. The methods according to the embodiments of the present disclosure can be implemented in hardware, firmware, or be implemented as computer code that can be recorded on a storage medium, or be implemented as computer code originally stored in a remote storage medium or a non-transitory machine-readable storage medium and downloaded through a network and to be stored in a local storage medium, so that the methods described herein can be stored in such software processes on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only memory, a random access memory, a flash memory, a hard disk, or a solid-state drive, etc.; further, the storage medium may further include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or programmable hardware includes a storage component that can store or receive software or computer code, and when the software or computer code is accessed and executed by the computer, the processor, or the hardware, the methods shown in the above embodiments are implemented.

[0226] A part of the present disclosure can be applied as a computer program product, for example, computer program instructions, which, when executed by a computer, can call or provide the methods and / or technical solutions according to the present disclosure through the operations of the computer. Those skilled in the art should understand that the forms of existence of computer program instructions in a computer-readable medium include but are not limited to source files, executable files, installation package files, etc. Correspondingly, the ways for computer program instructions to be executed by a computer include but are not limited to: the computer directly executes the instructions, or the computer compiles the instructions and then executes the corresponding compiled program, or the computer reads and executes the instructions, or the computer reads and installs the instructions and then executes the corresponding installed program. Herein, the computer-readable medium can be any available computer-readable storage medium or communication medium accessible to the computer.

[0227] Although the embodiments of the present disclosure have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the present disclosure, and such modifications and variations all fall within the scope defined by the appended claims.

Claims

1. A program code analysis method based on an analysis system, characterized in that: The parsing system includes a first data processing module and a trained parsing model, and the method is applied to the first data processing module; the method includes: Acquire a target program code, wherein the target program code includes a predefined target data structure, wherein the target data structure includes one or more structure fields; Acquire parsing reference information, and construct a first prompt word according to the parsing reference information, wherein the parsing reference information includes one or more of code parsing logic, sample program code, parsing examples, and location features of the target data structure; Inputting the target program code and the first prompt word into the parsing model, so that the parsing model outputs a parsing file of the target program code, wherein the parsing file includes field attributes and field access paths of the structure fields; Wherein, when the parsing reference information includes the code parsing logic, the example program code, the parsing example and the location feature of the target data structure, the parsing model outputs the parsing file based on the following method: Extracting the target data structure from the target program code according to the location feature of the target data structure; According to the code parsing logic, the target data structure is subjected to syntax conversion; The parsing file is generated and outputted based on the target data structure after grammar conversion, with the example program code and the parsing example as reference.

2. The method according to claim 1, characterized in that The parsing system also includes a trained alignment model; after obtaining the parsing file, the method further includes: Acquire alignment reference information, and construct a second prompt word according to the alignment reference information, wherein the alignment reference information includes memory address alignment logic and / or alignment examples of the structure field; The second prompt word and the parsed file are input into the alignment model, so that the alignment model adds a padding field in the parsed file, and the padding field is used to make the memory address of the structure field meet the memory address alignment logic.

3. The method according to claim 1, characterized in that The parsing system also includes a trained description supplement model; after obtaining the parsing file, the method further includes: Obtaining an example field and a field description corresponding to the example field, and constructing a third prompt word according to the correspondence between the example field and the field description; The third prompt word and the parsing file are input into the description supplement model, so that the description supplement model adds the field description of the structure field in the parsing file.

4. The method according to claim 3, characterized in that The example fields are some structure fields in the parsed file; the description supplement model adds field descriptions to the parsed file based on the following method: For any structure field in the parsed file, if the structure field is an example field, adding the field description of the structure field in the third prompt word to the parsed file; If the structure field is not an example field, the third prompt word is used as a reference to add a field description for the structure field in the parsed file.

5. The method according to any one of claims 1 to 4, characterized in that: The target program code includes a plurality of the target data structures, the parsing model writes the hierarchical relationship between the target data structures in the parsing file, and represents the field access path of the structure field through the hierarchical relationship, wherein in the hierarchical relationship, target data structures at different levels have different indentations.

6. A memory state analysis method based on a parsing system, characterized in that: The parsing system includes a second data processing module and a trained query model, and the method is applied to the second data processing module; the method includes: Obtaining field identification information of a target structure field in the target program code; Inputting the field identification information into a query model, and allowing the query model to search for field attributes and field access paths of the target structure field in a parsed file generated based on the method described in any one of claims 1 to 5; According to the field attribute and the field access path, searching the current value of the target structure field in the memory in the parsed memory status file; Perform memory status analysis based on the current value of the target structure field.

7. The method according to claim 6, characterized in that The step of obtaining the field identification information of the target structure field in the target program code includes: Display a human-computer interaction interface to receive at least one of the following information of the target structure field through the human-computer interaction interface, and use the received information as the field identification information: Field name, field ID, field description.

8. The method according to claim 7, characterized in that The query model searches for the field attributes and field access paths of the target structure fields in the parsed file based on the following method: Match and compare the field identification information of the target structure field with the field identification information of the structure field in the parsed file, and obtain the structure field in the parsed file that matches the target structure field as a candidate field; The field attributes and field access path of the candidate field are used as the field attributes and field access path of the target structure field.

9. The method according to claim 8, characterized in that The matching and comparing of the field identification information of the target structure field with the field identification information of the structure field in the parsed file to obtain the structure field in the parsed file that matches the target structure field as a candidate field includes: If there is a structure field having the same field identification information as the target structure field in the parsed file, the corresponding structure field is used as the candidate field; If there is no field in the parsed file that has the same field identification information as the target structure field, a semantic comparison is performed between the field identification information of the target structure field and the field identification information of the structure field in the parsed file to obtain a structure field in the parsed file that has the same semantics as the target structure field as the candidate field.

10. The method according to claim 8 or 9, characterized in that: When the target program code includes a plurality of the target data structures, and the parsed file includes a hierarchical relationship between the target data structures, the field access path of the candidate field is found according to the following method: Searching the parsed file for a first target data structure where the candidate field is located; According to the hierarchical relationship between the target data structures, if there are one or more second target data structures before the first target data structure, the first target data structure and the second target data structure are sorted according to the hierarchical relationship to obtain the field access path of the candidate field; if there is no second target data structure before the first target data structure, the first target data structure is used as the field access path of the candidate field.

11. The method according to claim 10, characterized in that The field attributes include a field type, and the field type is used to characterize the size of the memory space that the structure field needs to occupy; The step of searching the current value of the target structure field in the memory in the parsed memory status file according to the field attribute and the field access path includes: According to the base address of each target data structure in the field access path and the field type of the structure field in the target data structure, the current value of the target structure field is searched in the parsed memory status file.

12. An electronic device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the program code parsing method based on the parsing system as described in any one of claims 1 to 5, or executes the memory status analysis method based on the parsing system as described in any one of claims 6 to 11 by executing the computer instructions.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the program code parsing method based on the parsing system described in any one of claims 1 to 5, or to execute the memory status analysis method based on the parsing system described in any one of claims 6 to 11.

14. A computer program product, characterized in that It includes computer instructions, which are used to make a computer execute the program code parsing method based on the parsing system according to any one of claims 1 to 5, or execute the memory status analysis method based on the parsing system according to any one of claims 6 to 11.

Images