CN117093274A

CN117093274A - Application running stack analysis method, device, equipment and storage medium

Info

Publication number: CN117093274A
Application number: CN202311032009.6A
Authority: CN
Inventors: 孟曦东
Original assignee: Beijing Bo Hongyuan Data Polytron Technologies Inc
Current assignee: Beijing Bo Hongyuan Data Polytron Technologies Inc
Priority date: 2023-08-16
Filing date: 2023-08-16
Publication date: 2023-11-21

Abstract

The invention discloses an application operation stack analysis method, an application operation stack analysis device, application operation stack analysis equipment and a storage medium. Comprising the following steps: acquiring an analysis rule applied currently; acquiring a stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification result corresponding to the stack to be analyzed and the analysis rule is successful; and analyzing the stack to be analyzed according to the analysis logic and the analysis rule to generate a stack analysis result. And obtaining an analysis rule containing the current application symbolized file through data synchronization, carrying out data verification on the obtained stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification result is that the verification is successful, wherein the analysis logic comprises synchronous analysis and asynchronous analysis, and finally carrying out stack analysis through the analysis logic and the analysis rule to generate a stack analysis result, wherein the stack information after analysis can be clearly positioned to the running position and running state of the application code, so that the fault cause can be rapidly positioned when the application fails.

Description

Application running stack analysis method, device, equipment and storage medium

Technical Field

The present invention relates to the field of stack analysis technologies, and in particular, to a method, an apparatus, a device, and a storage medium for stack analysis in application operation.

Background

In general, various application software is installed on a mobile terminal due to the diversified demands of current users. Where problems occur in APP such as stuck, crashed, unresponsive, etc. This time, the analysis and identification of the APP operation stack is important.

The current processing of stack information is only performed in the system, and no other processing is performed, so that the specific reason of the fault occurrence cannot be known when the fault occurs.

Disclosure of Invention

The invention provides an application running stack analysis method, an application running stack analysis device, application running stack analysis equipment and a storage medium, which are used for decoupling and supporting APP stack analysis requirements of all ends in all scenes.

According to an aspect of the present invention, there is provided an application running stack parsing method, including:

acquiring an analysis rule applied currently, wherein the analysis rule comprises a symbolized file;

acquiring a stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification result corresponding to the stack to be analyzed and the analysis rule is successful, wherein the analysis logic comprises synchronous analysis and asynchronous analysis;

and analyzing the stack to be analyzed according to the analysis logic and the analysis rule to generate a stack analysis result.

Optionally, obtaining the parsing rule currently applied includes: acquiring a first symbolized file corresponding to a target node analyzed by a stack according to a specified time interval, and acquiring a second symbolized file corresponding to a local node; updating the second symbolized file based on the first symbolized file to generate an updated second symbolized file; and acquiring a third symbolized file of the application and a third party, and updating the updated second symbolized file based on the third symbolized file to generate an analysis rule.

Optionally, after obtaining the stack to be parsed, the method further includes: judging whether the stack to be analyzed and the analysis rule meet a data verification rule preset by a user, if so, determining that the data verification result corresponding to the stack to be analyzed and the analysis rule is successful; otherwise, determining that the data verification result corresponding to the stack to be analyzed and the analysis rule is verification failure.

Optionally, the method further comprises: when the data verification result corresponding to the stack to be analyzed is verification failure, generating prompt information according to the stack to be analyzed; and alarming in a specified mode according to the prompt information.

Optionally, determining the parsing logic according to the stack to be parsed includes: judging whether a stack to be analyzed has a synchronous instruction or not, if so, determining that the analysis logic is synchronous analysis; otherwise, determining the parsing logic as asynchronous parsing.

Optionally, parsing the stack to be parsed according to the parsing logic and the parsing rules to generate a stack parsing result, including: when the analysis logic is synchronous analysis, directly calling analysis rules to analyze the stack to be analyzed to generate a stack analysis result.

Optionally, parsing the stack to be parsed according to the parsing logic and the parsing rules to generate a stack parsing result, including: when the analysis logic is asynchronous analysis, placing a stack to be analyzed into a designated queue; and calling an analysis rule according to the fixed time interval to analyze the stack to be analyzed in the appointed queue so as to generate a stack analysis result.

According to another aspect of the present invention, there is provided an application execution stack parsing apparatus, including:

the analysis rule acquisition module is used for acquiring the analysis rule applied at present, wherein the analysis rule comprises a symbolized file;

the analysis logic determining module is used for acquiring a stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification result corresponding to the stack to be analyzed is successful, wherein the analysis logic comprises synchronous analysis and asynchronous analysis;

and the stack analysis result generation module is used for analyzing the stack to be analyzed according to the analysis logic and the analysis rule to generate a stack analysis result.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform an application run stack parsing method according to any one of the embodiments of the present invention.

According to another aspect of the present invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to implement an application run stack parsing method according to any embodiment of the present invention when executed.

According to the technical scheme, the analysis rule containing the current application symbolized file is obtained through data synchronization, data verification is carried out on the obtained stack to be analyzed, when the data verification result is that the verification is successful, analysis logic is determined according to the stack to be analyzed, wherein the analysis logic comprises synchronous analysis and asynchronous analysis, stack analysis is finally carried out through the analysis logic and the analysis rule to generate a stack analysis result, stack information after analysis can be clearly positioned to the running position and running state of an application code, and therefore the fault reason can be rapidly positioned when the application fails.

It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow chart of an application run stack parsing method according to a first embodiment of the present invention;

FIG. 2 is a flowchart of an application running stack parsing method according to a second embodiment of the present invention;

fig. 3 is a schematic structural diagram of an application running stack parsing device according to a third embodiment of the present invention;

fig. 4 is a schematic structural diagram of an electronic device implementing an application running stack parsing method according to an embodiment of the present invention.

Detailed Description

In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Example 1

Fig. 1 is a flowchart of an application running stack parsing method according to an embodiment of the present invention, where the method may be applied to the case of parsing and identifying an APP running stack, and the method may be performed by an application running stack parsing device, which may be implemented in hardware and/or software, and the application running stack parsing device may be configured in a computer. As shown in fig. 1, the method includes:

s110, acquiring a currently applied analysis rule, wherein the analysis rule comprises a symbolized file.

The current application refers to an application client where a user wants to perform stack parsing. A stack is a data structure in which data items are ordered, with data items being inserted and deleted only at one end. A heap is a dynamic memory structure, in effect a free memory area in a data segment, which is a name used in the C language, often used to store, allocate, dynamic data. A stack is a data structure of a memory, and the main function is represented by a data structure, which is a special linear table that can only insert and delete data at one end. The symbolized file contains a symbolized table, and stack parsing can be performed by the symbolized file.

The method comprises the steps of acquiring a first symbolized file, wherein the first symbolized file belongs to a front-end interaction part, and the first symbolized file is a file storage, which is uploaded by a user, of a current application and a symbolized analysis file of a third party to a server, and is used for service analysis. Furthermore, when the symbolic file of the system is transferred to a symbolic analysis node from the operation and maintenance, the analysis service automatically synchronizes the difference file between the nodes.

Specifically, after the symbolized file is obtained, the controller performs data synchronization according to a specified time interval, wherein the specified time interval is a fixed time interval set by a user according to synchronization requirements. The controller obtains a first symbolized file corresponding to a target node analyzed by the stack according to the time interval, compares a second symbolized file corresponding to the local node with the first symbolized file, determines the difference between the two symbolized files, and updates the second symbolized file according to the difference to generate an updated second symbolized file. Meanwhile, the controller compares the acquired third symbolized file of the application with the third symbolized file of the third party to determine the difference between the third symbolized file and the second symbolized file, and updates the second symbolized file, namely, the controller synchronizes the data of the second symbolized file corresponding to the local node according to the first symbolized file corresponding to the target node, the current application uploaded by the user and the symbolized analysis file of the third party, and after the data synchronization is completed, the synchronous data can be used as an analysis rule for analysis of a subsequent server stack.

In one specific implementation, the controller automatically performs data synchronization according to a fixed interval. Each time synchronization is performed, the controller finds all stack resolution service nodes through service discovery by the NACOS. Each service can automatically request all service nodes, compare the system symbolized file differences of the local nodes and the target nodes, synchronize the system symbolized file which is not locally available to the local nodes, then inquire the application uploaded by the user in the database and the symbolized file record of the third party, compare the system symbolized file record with the local nodes, synchronize the file which is not locally available to the local nodes, and generate an analysis rule for service analysis.

S120, obtaining a stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification result corresponding to the stack to be analyzed and the analysis rule is successful, wherein the analysis logic comprises synchronous analysis and asynchronous analysis.

Specifically, when the service side requests parsing, the stack parsing service will check the request content first, and then put the request into different processing logic according to synchronous and asynchronous. That is, the controller performs data verification on the stack to be analyzed and the analysis rule, and when the data verification result corresponding to the stack to be analyzed and the analysis rule is that the verification is successful, the controller further determines whether the analysis logic corresponding to the stack to be analyzed is synchronous analysis or asynchronous analysis. The synchronization is that the client sends a request to the server, and the client does not do other things when waiting for the request responded by the server. Asynchronization is when a client sends a request to a server, waiting for the server to respond, and the client can do other things.

Optionally, after obtaining the stack to be parsed, the method further includes: judging whether the stack to be analyzed meets a data verification rule preset by a user, if so, determining that a data verification result corresponding to the stack to be analyzed is successful; otherwise, determining the data verification result corresponding to the stack to be analyzed as verification failure.

Specifically, when data verification is performed, a user can preset a data verification rule in the controller, the controller performs verification according to the data verification rule set by the user, and when the stack to be analyzed meets the data verification rule preset by the user, the data verification result corresponding to the stack to be analyzed is determined to be successful in verification. And when the stack to be analyzed does not meet the data verification rule preset by the user, determining that the data verification result corresponding to the stack to be analyzed is verification failure.

Further, when the data verification result corresponding to the stack to be analyzed is verification failure, the controller generates prompt information according to the stack to be analyzed, and alarms in a specified mode according to the prompt information, wherein the alarm is used for prompting a user, so that the user can conveniently grasp the condition that the data verification of the stack to be analyzed fails in time, and the user can check and adjust the input stack to be analyzed, so that normal analysis of the subsequent stack is ensured. The specified mode includes voice or image, the voice can be broadcast through a speaker connected with the controller, for example, the voice content can be: and the stack to be checked fails to check. The image can be displayed through a user terminal connected with the controller so as to prompt the user.

Specifically, the analysis logic can be determined by judging whether the synchronous instruction exists in the stack to be analyzed, namely, when the synchronous instruction exists in the stack to be analyzed, the analysis logic is determined to be synchronous analysis. And when the stack to be analyzed does not have a synchronous instruction, determining that the analysis logic is asynchronous analysis.

S130, analyzing the stack to be analyzed according to the analysis logic and the analysis rule to generate a stack analysis result.

Specifically, after determining the parsing logic, the controller parses the stack to be parsed according to the symbol comparison table in the parsing logic and the parsing rule to generate a stack parsing result. Further, the technical scheme of the embodiment of the invention comprises an external interface and an internal interface, wherein the external interface is used for inquiring whether the stack analysis is successful according to the stack ID, inquiring the stack analysis result according to the stack ID, analyzing the interface according to the stack symbolization and deleting the symbolization analysis result according to the stack ID. The intra-pair interface is used to query the local system symbolized file list and transmit the system symbolized file.

It should be noted that, the technical solution of the embodiment of the present invention has a highly available and horizontally expandable symbolized analysis service solution. And there is a file storage system for storing signed files for the system, applications and third parties. While the parsing logic supports both synchronous and asynchronous parsing. Not only supporting the symbolic analysis of iOS, hong Mongolian and Android types, but also being convenient for expanding other types.

Example two

Fig. 2 is a flowchart of an application operation stack parsing method according to a second embodiment of the present invention, where a specific process of parsing a stack to be parsed according to parsing logic and parsing rules to generate a stack parsing result is added to the first embodiment. The specific contents of steps S210 to S220 are substantially the same as steps S110 to S120 in the first embodiment, and thus, a detailed description is omitted in this embodiment. As shown in fig. 2, the method includes:

s210, acquiring a currently applied analysis rule, wherein the analysis rule comprises a symbolized file.

S220, acquiring a stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification result corresponding to the stack to be analyzed and the analysis rule is successful, wherein the analysis logic comprises synchronous analysis and asynchronous analysis.

S230, judging whether the analysis logic is synchronous analysis, if so, executing S240, otherwise, executing S250.

S240, when the analysis logic is synchronous analysis, directly calling an analysis rule to analyze the stack to be analyzed to generate a stack analysis result.

S250, when the analysis logic is asynchronous analysis, placing a stack to be analyzed into a designated queue; and calling an analysis rule according to the fixed time interval to analyze the stack to be analyzed in the appointed queue so as to generate a stack analysis result.

Specifically, the controller analyzes the stack to be analyzed according to different analysis logics. When the analysis logic is synchronous analysis, the controller directly calls the analysis rule to analyze the stack to be analyzed to generate a stack analysis result. When the parsing logic is asynchronous parsing, a user can set a fixed time interval according to needs, at this time, the controller extracts a stack to be parsed in the specified queue according to the fixed time interval to parse, and it should be noted that if the controller does not extract the stack to be parsed currently, the controller continues to extract data from the specified queue according to the fixed time interval when reaching the target time next time until a stack parsing result is generated.

In one embodiment, when the parsing logic is synchronous parsing, the controller generates a unique ID for the parsing stack, checks whether the ID is parsed, and if so, directly returns a result, otherwise, directly requests the stack parsing part, and returns a parsing result after waiting for the completion of the parsing. When the analysis logic is asynchronous analysis, the service generates a unique ID for the analysis stack, then puts the stack to be analyzed into a queue to be analyzed and directly returns the unique ID, and the request is completed. Meanwhile, the asynchronous parsing job can continuously acquire stacks to be parsed from the queue, and the stack parsing part is requested, and after the processing is completed, the result is saved.

Further, when stack parsing is performed, the controller calls the stack with respective parsing services according to the classification. In the case of an iOS stack, the service may invoke the BRATOS service to perform stack parsing and return the result. When the stack is Android or a hong Meng stack, the service calls the reconstructed optimized Google official R8 package to parse and return the result. The iOS and the Android are managed by different threads Chi Quchu respectively, so that mutual interference is prevented.

Example III

Fig. 3 is a schematic structural diagram of an application running stack analysis device according to a third embodiment of the present invention. As shown in fig. 3, the apparatus includes: an parsing rule obtaining module 310, configured to obtain a parsing rule currently applied, where the parsing rule includes a symbolized file;

the analysis logic determining module 320 is configured to obtain a stack to be analyzed, and determine analysis logic according to the stack to be analyzed when the data verification result corresponding to the analysis rule of the stack to be analyzed is verification success, where the analysis logic includes synchronous analysis and asynchronous analysis;

the stack analysis result generation module 330 is configured to parse the stack to be analyzed according to the analysis logic and the analysis rule to generate a stack analysis result.

Optionally, the parsing rule obtaining module 310 specifically includes: acquiring a first symbolized file corresponding to a target node analyzed by a stack according to a specified time interval, and acquiring a second symbolized file corresponding to a local node; updating the second symbolized file based on the first symbolized file to generate an updated second symbolized file; and acquiring a third symbolized file of the application and a third party, and updating the updated second symbolized file based on the third symbolized file to generate an analysis rule.

Optionally, the parsing logic determination module 320 further includes: a data verification unit for: after the stack to be analyzed is obtained, judging whether the stack to be analyzed and the analysis rule meet a data verification rule preset by a user, if so, determining that the data verification result corresponding to the stack to be analyzed and the analysis rule is successful; otherwise, determining that the data verification result corresponding to the stack to be analyzed and the analysis rule is verification failure.

Optionally, the parsing logic determination module 320 further includes: the prompting and alarming unit is used for: when the data verification result corresponding to the stack to be analyzed is verification failure, generating prompt information according to the stack to be analyzed; and alarming in a specified mode according to the prompt information.

Optionally, the parsing logic determining module 320 specifically includes: the analysis logic determining unit is used for: judging whether a stack to be analyzed has a synchronous instruction or not, if so, determining that the analysis logic is synchronous analysis; otherwise, determining the parsing logic as asynchronous parsing.

Optionally, the stack parsing result generating module 330 specifically includes: the synchronous analysis unit is used for: when the analysis logic is synchronous analysis, directly calling analysis rules to analyze the stack to be analyzed to generate a stack analysis result.

Optionally, the stack parsing result generating module 330 specifically includes: an asynchronous parsing unit for: when the analysis logic is asynchronous analysis, placing a stack to be analyzed into a designated queue; and calling an analysis rule according to the fixed time interval to analyze the stack to be analyzed in the appointed queue so as to generate a stack analysis result.

The application running stack analysis device provided by the embodiment of the invention can execute the application running stack analysis method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.

Example IV

Fig. 4 shows a schematic diagram of the structure of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 4, the electronic device 10 includes at least one processor 11, and a memory, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, in which the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM 12 and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.

Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.

The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the various methods and processes described above, such as an application run stack parsing method. Namely: acquiring an analysis rule applied currently, wherein the analysis rule comprises a symbolized file; acquiring a stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification result corresponding to the stack to be analyzed and the analysis rule is successful, wherein the analysis logic comprises synchronous analysis and asynchronous analysis; and analyzing the stack to be analyzed according to the analysis logic and the analysis rule to generate a stack analysis result.

In some embodiments, an application execution stack parsing method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more of the steps of an application execution stack parsing method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform an application execution stack parsing method in any other suitable manner (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.

A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.

The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.

It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.

The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims

1. An application run stack parsing method, comprising:

2. The method of claim 1, wherein the obtaining the currently applied parsing rule comprises:

acquiring a first symbolized file corresponding to a target node analyzed by a stack according to a specified time interval, and acquiring a second symbolized file corresponding to a local node;

updating the second symbolized file based on the first symbolized file to generate an updated second symbolized file;

and acquiring a third symbolized file of the application and a third party, and updating the updated second symbolized file based on the third symbolized file to generate the analysis rule.

3. The method of claim 1, further comprising, after the obtaining the stack to be parsed:

judging whether the stack to be analyzed and the analysis rule meet a data verification rule preset by a user, if so, determining that the data verification result corresponding to the stack to be analyzed and the analysis rule is successful;

otherwise, determining that the data verification result corresponding to the stack to be analyzed and the analysis rule is verification failure.

4. A method according to claim 3, characterized in that the method further comprises:

when the data verification result corresponding to the stack to be analyzed is verification failure, generating prompt information according to the stack to be analyzed;

according to the prompt information, adopting

And alarming in a designated mode.

5. The method of claim 1, wherein said determining parsing logic from said stack to be parsed comprises:

judging whether the stack to be analyzed has a synchronous instruction or not, if so, determining that the analysis logic is synchronous analysis;

otherwise, determining the analysis logic as asynchronous analysis.

6. The method of claim 1, wherein parsing the stack to be parsed according to the parsing logic and the parsing rules to generate stack parsing results comprises:

and when the analysis logic is synchronous analysis, directly calling the analysis rule to analyze the stack to be analyzed to generate a stack analysis result.

7. The method of claim 1, wherein parsing the stack to be parsed according to the parsing logic and the parsing rules to generate stack parsing results comprises:

when the analysis logic is asynchronous analysis, placing the stack to be analyzed into a designated queue;

and calling the analysis rule according to a fixed time interval to analyze the stack to be analyzed in the appointed queue so as to generate a stack analysis result.

8. An application execution stack parsing apparatus, comprising:

the system comprises an analysis rule acquisition module, a storage module and a storage module, wherein the analysis rule acquisition module is used for acquiring the analysis rule applied currently, and the analysis rule comprises a symbolized file;

the analysis logic determining module is used for acquiring a stack to be analyzed, and determining analysis logic according to the stack to be analyzed when the data verification results corresponding to the stack to be analyzed and the analysis rules are successful in verification, wherein the analysis logic comprises synchronous analysis and asynchronous analysis;

and the stack analysis result generation module is used for analyzing the stack to be analyzed according to the analysis logic and the analysis rule so as to generate a stack analysis result.

9. An electronic device, the electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.

10. A computer storage medium storing computer instructions for causing a processor to perform the method of any one of claims 1-7 when executed.