CN110716747B - Program operation efficiency optimization method and terminal equipment based on function parameter statistics - Google Patents

Abstract

The present invention is applicable to the technical field of program optimization, and provides a program operation efficiency optimization method and terminal device based on function parameter statistics. The method includes: acquiring two memory addresses and two execution instructions corresponding to a function name; Replace any one of the two execution instructions; execute the preset exception program corresponding to the preset exception instruction, and restore the corresponding execution instruction to the memory address that triggers the preset exception instruction by the preset exception program corresponding to the preset exception instruction , replace another execution instruction with a preset exception instruction, and update the usage times of the function to be processed. When the preset timer time expires, restore the two execution instructions to the corresponding two memory addresses respectively, and determine the statistics. As a result, the calling frequency of the specified function when the program is running can be obtained without modifying the program code, the statistical efficiency can be improved, the functions with high calling frequency can be optimized, and the program optimization efficiency can be improved.

Description

Program operation efficiency optimization method and terminal equipment based on function parameter statistics

technical field

The invention belongs to the technical field of program optimization, and in particular relates to a program operation efficiency optimization method and terminal device based on function parameter statistics.

Background technique

In the process of program execution, in order to complete the operation, a program usually needs to obtain the execution parameters of other executing programs. In order to optimize the efficiency of program operation, key optimizations can be made for functions that are frequently used in the program, which can play a great role in the operation efficiency of the entire program.

When the frequency of use of a general statistical function in the prior art is generally achieved by modifying the software code corresponding to the program to increase debugging information. However, by repeatedly modifying the software code to count the frequency of use of the function, the statistical efficiency is extremely low, resulting in low program optimization efficiency.

SUMMARY OF THE INVENTION

In view of this, the embodiments of the present invention provide a method for optimizing program operation efficiency and a terminal device based on function parameter statistics, so as to solve the problem that the frequency of use of functions is counted by repeatedly modifying software codes in the prior art, so that the statistical efficiency is extremely low, This leads to the problem of low program optimization efficiency.

A first aspect of the embodiments of the present invention provides a method for optimizing program operation efficiency based on function parameter statistics, including:

Acquiring two memory addresses corresponding to the function name of the function to be processed and two execution instructions on the two memory addresses, and replacing any one execution instruction in the two execution instructions with a preset exception instruction;

When the program runs to the preset exception instruction, the preset exception program corresponding to the preset exception instruction restores the corresponding execution instruction to the memory address that triggered the preset exception instruction, and replaces another execution instruction with another execution instruction. is the preset exception instruction, and updates the usage times of the function to be processed; when the preset timer time reaches, restore the two execution instructions to the corresponding two memory addresses respectively, and determine the statistical result ;

The functions to be processed whose statistical results in the program reach a preset threshold are optimized.

In one embodiment, the two memory addresses include a first memory address and a second memory address;

The two execution instructions include a first execution instruction at the first memory address and a second execution instruction at the second memory address;

When the preset exception instruction is used to replace the execution instruction for the first time, the first execution instruction is replaced with the preset exception instruction.

In an embodiment, before the acquiring two memory addresses corresponding to the function names of the functions to be processed and the two execution instructions on the two memory addresses, the method further includes:

Get the function name and statistical time period of the function to be processed.

In one embodiment, the acquiring two memory addresses corresponding to the function name of the function to be processed and two execution instructions on the two memory addresses includes:

According to the obtained function name of the function to be processed, obtain the first memory address corresponding to the function name;

Read the first execution instruction on the first memory address, and calculate the second memory address corresponding to the second execution instruction according to the first memory address and the length of the first execution instruction, and the first execution instruction The instruction and the second execution instruction are two execution instructions included under the same function to be processed;

After the acquiring the two memory addresses corresponding to the function names of the functions to be processed and the two execution instructions on the two memory addresses, the method further includes:

The first execution instruction and the second execution instruction are backed up.

In an embodiment, after replacing any one of the two execution instructions with the preset exception instruction, the method further includes:

After all the functions to be processed are replaced with preset exception instructions, a preset timer is started according to the statistical time period, and the program starts to run.

In one embodiment, the preset exception program corresponding to the preset exception instruction restores the corresponding execution instruction to the memory address that triggers the preset exception instruction, and replaces another execution instruction with the preset exception instruction. Set an exception instruction, and update the usage times of the to-be-processed function, including:

Execute the preset exception program corresponding to the preset exception instruction;

The preset abnormal program detects a memory address that triggers the preset abnormal instruction;

When the memory address that triggers the preset exception instruction is the first memory address, updating the usage times of the to-be-processed function, and restoring the first execution instruction to the first memory address;

The second execution instruction at the second memory address is replaced with the preset exception instruction.

In one embodiment, after the preset abnormal program detects the memory address that triggers the preset abnormal instruction, the method further includes:

When the memory address that triggers the preset exception instruction is the second memory address, the first execution instruction at the first memory address is replaced with the preset exception instruction, and the second execution instruction is Restore to the second memory address.

In an embodiment, it is characterized in that when the preset timer time reaches, restoring the two execution instructions to the corresponding two memory addresses respectively, and determining the statistical results, including:

When the preset timer time reaches, trigger the timing processing flow;

The timing processing flow stops the running of the program, restores the backed up first execution instruction and second execution instruction to the corresponding first memory address and second memory address, respectively, and reads each function to be processed in the Counting the number of times of use within a time period, and outputting a processing result, where the processing result includes the frequency of use calculated according to the number of times of use and the statistical time period;

After the calculating the usage frequency of the function to be processed, the method further includes:

The processing result is sent to the cloud through the network, so that the cloud can re-designate the function to be processed according to the processing result.

A second aspect of the embodiments of the present invention provides an apparatus for optimizing program operation efficiency based on function parameter statistics, including:

an acquisition module for acquiring two memory addresses corresponding to the function name of the function to be processed and two execution instructions on the two memory addresses;

A replacement module, configured to replace any one of the two execution instructions with a preset abnormal instruction;

The processing module is configured to restore the corresponding execution instruction to the memory address that triggers the preset exception instruction by the preset exception program corresponding to the preset exception instruction when the program runs to the preset exception instruction, and convert the preset exception instruction corresponding to the preset exception instruction. Another execution instruction is replaced with the preset exception instruction, and the number of times of use of the to-be-processed function is updated; and when the preset timer time reaches, the two execution instructions are restored to the corresponding two memory addresses respectively and determine the statistical results;

The optimization module is used to optimize the functions to be processed whose statistical results in the program reach a preset threshold.

A third aspect of the embodiments of the present invention provides a terminal device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer During the program, the steps described in the above-mentioned method for optimizing program operation efficiency based on function parameter statistics are implemented.

Compared with the prior art, the embodiment of the present invention has the following beneficial effects: acquiring two memory addresses and two execution instructions corresponding to the function name; replacing any execution instruction in the two execution instructions with a preset exception instruction; When the program runs to the preset exception instruction, the preset exception program corresponding to the preset exception instruction restores the corresponding execution instruction to the memory address that triggers the preset exception instruction, and replaces another execution instruction with the preset exception instruction, And update the number of times of use of the function to be processed, when the preset timer time reaches, restore the two execution instructions to the corresponding two memory addresses, and determine the statistical results, so that the program code does not need to be modified. The calling frequency of the specified function when the program is running can be obtained, so as to improve the statistical efficiency, and optimizing the function with high calling frequency can improve the program optimization efficiency.

Description of drawings

In order to illustrate the technical solutions in the embodiments of the present invention more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only for the present invention. In some embodiments, for those of ordinary skill in the art, other drawings can also be obtained according to these drawings without any creative effort.

Fig. 1 is the implementation flow diagram of the program operation efficiency optimization method based on function parameter statistics provided by the embodiment of the present invention;

FIG. 2 is a schematic flowchart of the implementation of a method for optimizing program operation efficiency based on function parameter statistics provided by another embodiment of the present invention;

3 is a schematic diagram of a method for obtaining function parameters provided by another embodiment of the present invention;

4 is an exemplary diagram of an apparatus for optimizing program operation efficiency based on function parameter statistics provided by an embodiment of the present invention;

FIG. 5 is a schematic diagram of a terminal device provided by an embodiment of the present invention.

Detailed ways

In the following description, for the purpose of illustration rather than limitation, specific details such as specific system structures and technologies are set forth in order to provide a thorough understanding of the embodiments of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced in other embodiments without these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.

In order to illustrate the technical solutions of the present invention, the following specific embodiments are used for description.

FIG. 1 is a schematic diagram of an implementation flowchart of a method for optimizing program operation efficiency based on function parameter statistics provided by an embodiment of the present invention, which is described in detail as follows.

Step 101: Acquire two memory addresses corresponding to the function name of the function to be processed and two execution instructions on the two memory addresses.

Optionally, the function to be processed here may be a single function or multiple functions.

As shown in Figure 2, before this step, it can also include:

Step 201: Obtain the function name and statistical time period of the function to be processed.

Optionally, step 201 may be to obtain the name of the function whose usage frequency needs to be counted.

Optionally, in this embodiment, the two memory addresses include a first memory address and a second memory address; the two execution instructions include a first execution instruction on the first memory address and the second memory address. The second execution instruction at the second memory address. As shown in FIG. 2, step 101 may include:

Step 202, according to the acquired function name of the function to be processed, acquire a first memory address corresponding to the function name.

Optionally, if the function to be processed includes multiple execution instructions, first obtain the first memory address corresponding to the first execution instruction corresponding to the function name.

Step 203: Read the first execution instruction on the first memory address, and calculate the second memory address corresponding to the second execution instruction according to the first memory address and the length of the first execution instruction. The first execution instruction and the second execution instruction are two execution instructions included under the same function to be processed.

Optionally, in step 203, the first memory address may be represented by A1, the second memory address may be represented by A2, the first execution instruction may be represented by I1, and the second execution instruction may be represented by I2. The process of calculating the memory address A2 according to A1 may be calculated according to the direction of the CPU fetching the instruction and the instruction length. For example, the CPU sequentially fetches instructions from the low address of the memory to the high address for execution, and the length of the executed instruction can be fixed to 4 bytes, then the memory address of the next instruction is A2=A1+4. If the length of the executed instruction is variable, the memory address of the next instruction is determined according to the length of the currently executed instruction.

Step 204: Clear the counted usage times of the to-be-processed function to zero.

This step is an optional step, which is represented by a dashed box in FIG. 2 . When the timing period is used for the first time to obtain the statistical results, it is enough to directly count the usage times of the functions to be processed. , so that the statistics can be started from zero to ensure that the statistical results are correct.

Step 205, back up the first execution instruction and the second execution instruction.

Optionally, after the original execution instructions of the functions to be processed in the program are backed up, step 102 can be continued.

Optionally, the execution order of step 204 and step 205 is not limited.

Step 102: Replace any one of the two execution instructions with a preset exception instruction.

Optionally, when the preset exception instruction is used to replace the execution instruction for the first time, the preset exception instruction is used to replace the first execution instruction of the two execution instructions; that is, in this embodiment, the A1 memory location can be Replace the I1 with the preset exception instruction.

During the subsequent execution of the program, when the preset exception program corresponding to the preset exception instruction is run, the preset exception program replaces the execution instruction on the memory address that does not trigger the preset exception instruction with the preset exception instruction. It may be the first execution instruction among the two execution instructions, or it may be the second execution instruction. That is, I1 on the A1 memory location can be replaced with a preset exception instruction, or I2 on the A2 memory location can be replaced with a preset exception instruction, as the case may be.

Optionally, steps 101 and 102 are repeated until all execution instructions of the functions to be processed are replaced by preset exception instructions. After all the functions to be processed are replaced with preset abnormal instructions, a preset timer is started according to the statistical time period, and the program starts to run. Optionally, the preset timer may be an expiration timer, and the set time is the time corresponding to the statistical time period.

Optionally, the program may refer to an execution program including multiple functions, may be a program of the system itself, or may be another program dynamically installed and loaded.

Step 103, when the program runs to the preset exception instruction, the preset exception program corresponding to the preset exception instruction restores the corresponding execution instruction to the memory address that triggers the preset exception instruction, and the other The execution instruction is replaced with the preset exception instruction, and the number of times of use of the function to be processed is updated; when the preset timer time reaches, the two execution instructions are restored to the corresponding two memory addresses respectively, and Determine statistical results.

Wherein, the preset abnormal program is a program set according to a processing target.

Optionally, as shown in FIG. 2, step 103 may include the following steps:

Step 206, when the program runs to the preset exception instruction, execute the preset exception program corresponding to the preset exception instruction.

Optionally, when the program runs to the preset exception instruction, an exception will be triggered and jump to the preset exception program corresponding to the preset exception instruction.

Step 207, the preset exception program detects the memory address that triggers the preset exception instruction.

Optionally, here the preset exception program detects whether the memory address that triggers the preset exception instruction is A1 or A2, and different processing methods are required for different memory addresses, so as to obtain the number of times the frequency is accurately counted.

Step 208 , when the memory address that triggers the preset exception instruction is the first memory address, update the usage times of the function to be processed, and restore the first execution instruction to the first memory address.

Step 209: Replace the second execution instruction at the second memory address with the preset exception instruction.

Optionally, after step 209 is processed, the instruction may be returned to the first memory address that triggers the exception to re-execute the instruction, which will not be described in detail in this embodiment.

Step 210, when the memory address that triggers the preset exception instruction is the second memory address, replace the first execution instruction on the first memory address with the preset exception instruction, and at the same time replace the first execution instruction at the first memory address with the preset exception instruction. 2. The execution instruction is restored to the second memory address;

Optionally, after step 210 is processed, the instruction may be returned to the second memory address that triggers the exception to re-execute the instruction, which will not be described in detail in this embodiment.

Optionally, the purpose of using two execution instructions in steps 206 to 210 and replacing them with exception instructions as needed is: the first execution instruction is set as a preset exception instruction, in order to execute when the function to be processed is called. Statistics, after the statistics are completed, the first execution instruction is restored; the second execution instruction is replaced with a preset exception instruction, in order to realize the statistics when the function to be processed is repeatedly called multiple times. If the second execution instruction is replaced with a preset exception instruction at this time, if it is restored to the first execution instruction, the exception program cannot be triggered again for statistics when the function to be processed is called next time. Then, after the function executes the first execution instruction, and then executes the second execution instruction, it will have the opportunity to replace the execution instruction at the A1 position with the abnormal instruction again, thus realizing that when the function is called multiple times, the first execution instruction All are in abnormal instructions, triggering exceptions to implement statistical functions.

Optionally, when the preset timer time reaches as shown in FIG. 2 , this step may further include:

Step 211, when the preset timer time reaches, trigger the timing processing flow.

Step 212, the timing processing flow stops the running of the program, restores the backup first execution instruction and second execution instruction to the corresponding first memory address and second memory address respectively, and reads each function to be processed. The number of times of use within the statistical time period, and the processing result is output.

The processing result includes the frequency of use of the function to be processed calculated and obtained according to the number of times of use and the statistical time period.

Step 213: Send the processing result to the cloud through the network, so that the cloud can re-designate the function to be processed according to the processing result.

Optionally, according to the processing result, the cloud can re-designate the required function statistics usage frequency and send it to the local machine, so as to achieve the purpose of dynamically adjusting the function to be processed. Statistics with different precisions can be achieved by specifying different time periods. The longer the time period, the higher the frequency of use of the statistics.

Step 104: Optimize the functions to be processed whose statistical results in the program reach a preset threshold.

Optionally, statistics on the usage frequency of the functions to be processed in the program are performed, and key optimization is performed on functions with higher usage frequencies, which plays a great role in improving the running efficiency of the entire program.

Optionally, the preset threshold may be set according to requirements, and the value range of the preset threshold is not limited in this application.

Optionally, when the function to be processed includes only one execution instruction, the parameters of the function can be obtained according to the process shown in FIG. 3 . As shown in FIG. 3 , obtaining the parameters of the function includes the following steps.

Step 301: Obtain the function name of the function to be processed.

The function to be processed here can be a single function or multiple functions.

Step 302 , according to the acquired function name of the function to be processed, acquire a memory address corresponding to the function name.

Step 303: Read the execution instruction on the memory address.

Optionally, read the instruction block whose memory space is S at the memory address. It should be noted that, the memory space occupied in the memory by the execution instruction in step 303 is the same as the memory space occupied in the memory by the set default exception instruction.

Step 304, back up the execution instruction.

Step 305 , replace the execution instruction with a preset exception instruction.

After all the functions to be processed in the program are replaced with preset exception instructions, the program is executed.

Step 306 , when the program runs to the preset exception instruction, execute the preset exception program corresponding to the preset exception instruction and process it, and restore the execution instruction to the memory address after the processing is completed.

Optionally, in the process of obtaining function parameters as shown in FIG. 3, when the program is running, when the function to be processed is called by other functions, the running instruction block is jumped to the preset exception program, and the preset exception program is based on the process. The Procedure Call Standard (PCS) rule reads the corresponding registers of the CPU and the corresponding content on the stack space, and analyzes, processes, saves and other operations. It should be noted that the mutual calls between functions need to follow PCS, and PCS will make specific regulations on function parameter transfer and return value. PCS can be formulated by various technical alliances, or can be designed by programmers themselves. The rules for passing function parameters are different for different PCSs. The transfer of function parameters, most PCS are basically based on the CPU's working registers and stack space to transfer, of course, other methods can also be used. Therefore, when the function is called, the parameters passed by the caller only need to read the contents of the corresponding registers and stack space according to the specific PCS, and then parse according to the PCS rules to get the parameters passed by the function caller. parameter.

Step 307: Acquire the processing result, and continue to execute the execution instruction and subsequent programs.

After the preset exception program acquires the function parameters, the previously backed up instruction block is read and restored to the memory address, and the preset exception program jumps to the memory address to complete the acquisition of the function parameters.

The acquisition of the function parameters described in accompanying drawing 3 can obtain the parameter values passed by the caller when the specified function is running in the program without modifying the program code, and analyze the specific transmission situation of each function parameter in the running process in the program, Can assist in verifying program logic design.

The above-mentioned method for optimizing program operation efficiency based on function parameter statistics can obtain two memory addresses and two execution instructions corresponding to the function name of the function to be processed; and replace any one of the two execution instructions with a preset abnormal instruction; When the program runs to the preset exception instruction, the preset exception program corresponding to the preset exception instruction restores the corresponding execution instruction to the memory address that triggered the preset exception instruction, and replaces another execution instruction with the specified exception instruction. The preset exception instruction is updated, and the number of times of use of the function to be processed is updated. When the preset timer time is reached, the two execution instructions are restored to the corresponding two memory addresses respectively, and the statistical results are determined, so as to achieve Without modifying the software code, it can quickly count the frequency that any number of functions are called in a specified time period, and the efficiency is very high, and the objects to be counted do not need to have statistical functions themselves. In addition, focusing on optimizing the functions with high frequency can greatly improve the running efficiency of the whole program.

It should be understood that the size of the sequence numbers of the steps in the above embodiments does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.

Corresponding to the method for optimizing program operation efficiency based on function parameter statistics described in the above embodiments, FIG. 4 shows an example diagram of an apparatus for optimizing program operation efficiency based on function parameter statistics provided by an embodiment of the present invention. As shown in FIG. 4 , the apparatus may include: an acquisition module 401 , a replacement module 402 , a processing module 403 and an optimization module 404 .

an acquisition module 401, configured to acquire two memory addresses corresponding to the function names of the functions to be processed and two execution instructions on the two memory addresses;

A replacement module 402, configured to replace any one of the two execution instructions with a preset abnormal instruction;

The processing module 403 is configured to restore the corresponding execution instruction to the memory address that triggers the preset exception instruction by the preset exception program corresponding to the preset exception instruction when the program runs to the preset exception instruction, Replace another execution instruction with the preset exception instruction, and update the usage times of the to-be-processed function; and when the preset timer time reaches, restore the two execution instructions to the corresponding two memories respectively address and determine statistical results;

The optimization module 404 is configured to optimize the to-be-processed function for which the statistical result in the program reaches a preset threshold.

Optionally, the two memory addresses include a first memory address and a second memory address;

The two execution instructions include a first execution instruction at the first memory address and a second execution instruction at the second memory address.

Optionally, the obtaining module 401 may also be used to obtain the function name and statistical time period of the function to be processed.

Optionally, when the obtaining module 401 obtains two memory addresses corresponding to the function name of the function to be processed and two execution instructions on the two memory addresses, it can obtain the function name of the function to be processed according to the obtained function name. The first memory address corresponding to the function name; read the first execution instruction on the first memory address, and calculate the second execution instruction according to the first memory address and the length of the first execution instruction The corresponding second memory address, the first execution instruction and the second execution instruction are two execution instructions included under the same function to be processed. and backing up the first execution instruction and the second execution instruction.

Optionally, the replacement module 402 is configured to replace the first execution instruction in the two execution instructions with the preset exception instruction when replacing the execution instruction with the preset exception instruction for the first time.

After all functions to be processed are replaced with preset exception instructions, the processing module 403 may start a preset timer according to the statistical time period, and start running the program.

Optionally, the processing module 403 may be configured to: execute a preset exception program corresponding to the preset exception instruction; the preset exception program detects a memory address that triggers the preset exception instruction; when the preset exception instruction is triggered; When setting the memory address of the abnormal instruction as the first memory address, update the usage times of the function to be processed, and restore the first execution instruction to the first memory address; The execution instruction is replaced with the preset exception instruction.

and when the memory address that triggers the preset abnormal instruction is the second memory address, replace the first execution instruction on the first memory address with the preset abnormal instruction, and simultaneously execute the second execution instruction. The instruction is restored to the second memory address.

Optionally, when the preset timer time reaches, the processing module 403 restores the two execution instructions to the corresponding two memory addresses respectively, and when determining the statistical result, can be used for:

When the preset timer time reaches, trigger the timing processing flow;

The timing processing flow stops the running of the program, restores the backed up first execution instruction and second execution instruction to the corresponding first memory address and second memory address, respectively, and reads each function to be processed in the Counting the number of times of use within a time period, and outputting a processing result, where the processing result includes the frequency of use calculated according to the number of times of use and the statistical time period;

Optionally, the processing module 403 is further configured to send the processing result to the cloud through the network, so that the cloud can re-designate the function to be processed according to the processing result.

In the above-mentioned device for optimizing program operation efficiency based on function parameter statistics, the acquisition module can acquire two memory addresses corresponding to the function name and two execution instructions; the replacement module replaces any one of the two execution instructions with a preset abnormal instruction. and the processing module is used to restore the corresponding execution instruction to the memory address that triggers the preset exception instruction by the preset exception program corresponding to the preset exception instruction, and replace another execution instruction with the preset exception instruction, and update the number of times of use of the function to be processed; and when the preset timer time reaches, restore the two execution instructions to the corresponding two memory addresses respectively, and determine the statistical results, so that the Without modifying the software code, it can quickly count the frequency that any number of functions are called in a specified time period, and the efficiency is extremely high, and the objects to be counted do not need to have statistical functions themselves. In addition, the optimization module focuses on optimizing the functions with high frequency, which plays a great role in improving the running efficiency of the whole program.

FIG. 5 is a schematic diagram of a terminal device according to an embodiment of the present invention. As shown in FIG. 5 , the terminal device 500 of this embodiment includes: a processor 501, a memory 502, and a computer program 503 stored in the memory 502 and executable on the processor 501, for example, based on function parameter statistics Program running efficiency optimization program. When the processor 501 executes the computer program 503, the steps in the above-mentioned embodiments of the method for optimizing program operation efficiency based on function parameter statistics are implemented, for example, steps 101 to 104 shown in FIG. 1, or steps or diagrams shown in FIG. 2. In the step shown in 3, when the processor 501 executes the computer program 503, the functions of the modules in the above device embodiments are implemented, for example, the functions of the modules 401 to 404 shown in FIG. 4 .

Exemplarily, the computer program 503 can be divided into one or more program modules, and the one or more program modules are stored in the memory 502 and executed by the processor 501 to complete the present invention . The one or more program modules may be a series of computer program instruction segments capable of accomplishing specific functions, and the instruction segments are used to describe the computer program 503 in the program operation efficiency optimization apparatus or terminal device 500 based on function parameter statistics. in the execution process. For example, the computer program 503 can be divided into an acquisition module 401 , a replacement module 402 , a processing module 403 and an optimization module 404 , and the specific functions of each module are shown in FIG. 4 , which will not be repeated here.

The terminal device 500 may be a computing device such as a desktop computer, a notebook computer, a palmtop computer, and a cloud server. The terminal device may include, but is not limited to, a processor 501 and a memory 502 . Those skilled in the art can understand that FIG. 5 is only an example of the terminal device 500, and does not constitute a limitation on the terminal device 500. It may include more or less components than the one shown, or combine some components, or different components For example, the terminal device may further include an input and output device, a network access device, a bus, and the like.

The so-called processor 501 may be a central processing unit (Central Processing Unit, CPU), and may also be other general-purpose processors, digital signal processors (Digital Signal Processors, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), Off-the-shelf programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The memory 502 may be an internal storage unit of the terminal device 500 , such as a hard disk or a memory of the terminal device 500 . The memory 502 may also be an external storage device of the terminal device 500, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), and a Secure Digital (SD) card equipped on the terminal device 500. , Flash Card (Flash Card) and so on. Further, the memory 502 may also include both an internal storage unit of the terminal device 500 and an external storage device. The memory 502 is used for storing the computer program and other programs and data required by the terminal device 500 . The memory 502 can also be used to temporarily store data that has been output or is to be output.

Those skilled in the art can clearly understand that, for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example. Module completion, that is, dividing the internal structure of the device into different functional units or modules to complete all or part of the functions described above. Each functional unit and module in the embodiment may be integrated in one processing unit, or each unit may exist physically alone, or two or more units may be integrated in one unit, and the above-mentioned integrated units may adopt hardware. It can also be realized in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing from each other, and are not used to limit the protection scope of the present application. For the specific working process of the units and modules in the above-mentioned system, reference may be made to the corresponding process in the foregoing method embodiments, which will not be repeated here.

In the foregoing embodiments, the description of each embodiment has its own emphasis. For parts that are not described or described in detail in a certain embodiment, reference may be made to the relevant descriptions of other embodiments.

Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of the present invention.

In the embodiments provided by the present invention, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other manners. For example, the apparatus/terminal device embodiments described above are only illustrative. For example, the division of the modules or units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units. Or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.

The integrated modules/units, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium. Based on this understanding, the present invention can implement all or part of the processes in the methods of the above embodiments, and can also be completed by instructing relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium. When the program is executed by the processor, the steps of the foregoing method embodiments can be implemented. . Wherein, the computer program includes computer program code, and the computer program code may be in the form of source code, object code, executable file or some intermediate form, and the like. The computer-readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM, Read-Only Memory) , Random Access Memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer-readable media may be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction, for example, in some jurisdictions, according to legislation and patent practice, the computer-readable media Electric carrier signals and telecommunication signals are not included.

The above-mentioned embodiments are only used to illustrate the technical solutions of the present invention, but not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it is still possible to implement the foregoing implementations. The technical solutions described in the examples are modified, or some technical features thereof are equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should be included in the within the protection scope of the present invention.

Claims (9)

1. a program operating efficiency optimization method based on function parameter statistics, is characterized in that, comprises: Acquire two memory addresses corresponding to the function name of the function to be processed and two execution instructions on the two memory addresses, and replace any one of the two execution instructions with a preset exception instruction, and the The two memory addresses include a first memory address and a second memory address, and the two execution instructions include a first execution instruction at the first memory address and a second execution instruction at the second memory address; When the program runs to the preset exception instruction, the preset exception program corresponding to the preset exception instruction restores the corresponding execution instruction to the memory address that triggered the preset exception instruction, and replaces another execution instruction with another execution instruction. is the preset exception instruction, and updates the usage times of the function to be processed; when the preset timer time reaches, restore the two execution instructions to the corresponding two memory addresses respectively, and determine the statistical result ; Optimizing the function to be processed whose statistical result in the program reaches a preset threshold; The acquiring two memory addresses corresponding to the function name of the function to be processed and the two execution instructions on the two memory addresses include: According to the obtained function name of the function to be processed, obtain the first memory address corresponding to the function name; Read the first execution instruction on the first memory address, and calculate the second memory address corresponding to the second execution instruction according to the first memory address and the length of the first execution instruction, and the first execution instruction The instruction and the second execution instruction are two execution instructions included under the same function to be processed; After the acquiring the two memory addresses corresponding to the function names of the functions to be processed and the two execution instructions on the two memory addresses, the method further includes: The first execution instruction and the second execution instruction are backed up. 2. The method for optimizing program operation efficiency based on function parameter statistics as claimed in claim 1, wherein replacing any one of the two execution instructions with a preset exception instruction, comprising: When the preset exception instruction is used to replace the execution instruction for the first time, the first execution instruction is replaced with the preset exception instruction. 3. the program operation efficiency optimization method based on function parameter statistics as claimed in claim 2, it is characterized in that, in described obtaining two memory addresses corresponding to the function name of the function to be processed and the two memory addresses on the memory address. Before the two execute instructions, also include: Get the function name and statistical time period of the function to be processed. 4. The program operation efficiency optimization method based on function parameter statistics as claimed in claim 3, characterized in that, after replacing any one of the two execution instructions with the preset exception instruction, the method further comprises: After all the functions to be processed are replaced with preset exception instructions, a preset timer is started according to the statistical time period, and the program starts to run. 5 . The method for optimizing program operation efficiency based on function parameter statistics according to claim 1 , wherein the preset abnormal program corresponding to the preset abnormal instruction restores the corresponding execution instruction to trigger the preset abnormal instruction. 6 . At the memory address of the exception instruction, replace another execution instruction with the preset exception instruction, and update the usage times of the to-be-processed function, including: Execute the preset exception program corresponding to the preset exception instruction; The preset abnormal program detects a memory address that triggers the preset abnormal instruction; When the memory address that triggers the preset exception instruction is the first memory address, updating the usage times of the to-be-processed function, and restoring the first execution instruction to the first memory address; The second execution instruction at the second memory address is replaced with the preset exception instruction. 6. The method for optimizing program operation efficiency based on function parameter statistics as claimed in claim 5, wherein after the preset abnormal program detection triggers the memory address of the preset abnormal instruction, the method further comprises: When the memory address that triggers the preset exception instruction is the second memory address, the first execution instruction at the first memory address is replaced with the preset exception instruction, and the second execution instruction is Restore to the second memory address. 7. The method for optimizing program operation efficiency based on function parameter statistics according to any one of claims 1 to 6, wherein when the preset timer time is reached, the two execution instructions are restored respectively to the corresponding two memory addresses, and determine the statistical results, including: When the preset timer time reaches, trigger the timing processing flow; The timing processing flow stops the running of the program, restores the backed up first execution instruction and second execution instruction to the corresponding first memory address and second memory address, respectively, and reads the statistical time of each function to be processed. The number of times of use within the segment, and the processing result is output, and the processing result includes the frequency of use calculated according to the number of times of use and the statistical time period; After calculating the frequency of use of the function to be processed, it also includes: The processing result is sent to the cloud through the network, so that the cloud can re-designate the function to be processed according to the processing result. 8. A program operation efficiency optimization device based on function parameter statistics, characterized in that, comprising: an acquisition module, configured to acquire two memory addresses corresponding to the function names of the functions to be processed and two execution instructions on the two memory addresses, where the two memory addresses include a first memory address and a second memory address, The two execution instructions include a first execution instruction at the first memory address and a second execution instruction at the second memory address; A replacement module, configured to replace any one of the two execution instructions with a preset abnormal instruction; The processing module is configured to restore the corresponding execution instruction to the memory address that triggers the preset exception instruction by the preset exception program corresponding to the preset exception instruction when the program runs to the preset exception instruction, and convert the preset exception instruction corresponding to the preset exception instruction. Another execution instruction is replaced with the preset exception instruction, and the number of times of use of the to-be-processed function is updated; and when the preset timer time reaches, the two execution instructions are restored to the corresponding two memory addresses respectively and determine the statistical results; an optimization module for optimizing the functions to be processed whose statistical results in the program reach a preset threshold; The acquisition module is also used for: According to the obtained function name of the function to be processed, obtain the first memory address corresponding to the function name; Read the first execution instruction on the first memory address, and calculate the second memory address corresponding to the second execution instruction according to the first memory address and the length of the first execution instruction, and the first execution instruction The instruction and the second execution instruction are two execution instructions included under the same function to be processed; and backing up the first execution instruction and the second execution instruction. 9. A terminal device, comprising a memory, a processor and a computer program stored in the memory and running on the processor, wherein the processor implements the computer program as claimed in the claims when executing the computer program The steps of any one of 1 to 7 of the method.

Images