CN112083931A - Program processing method, device and equipment - Google Patents

Abstract

Embodiments of the present application provide a program processing method, device, and device. The method includes: acquiring a first program, where the first program includes a plurality of subprograms; adding a timing code corresponding to each subprogram in the first program , obtain the second program; run the second program, and during the running process of the second program, obtain the running duration corresponding to each subprogram through the timing code; Optimized subroutines. The terminal device can accurately determine the calculation module that needs to be optimized, thereby improving the optimization efficiency of the calculation module.

Description

Program processing method, device and device

technical field

The present application relates to the field of computer technology, and in particular, to a program processing method, apparatus, and device.

Background technique

Currently, scientific calculations can be performed using computational programs. In order to ensure the calculation efficiency of the calculation program, the calculation module can be optimized.

In the prior art, the calculation module is usually optimized according to the experience of the programmer. The programmer selects the calculation module to be optimized according to the composition of the calculation module (eg, the number of codes in the calculation module). However, this method requires the experience of the programmer to select the calculation module to be optimized. Different programmers may choose different calculation modules to be optimized. Therefore, the calculation module to be optimized cannot be accurately determined, resulting in low optimization efficiency.

SUMMARY OF THE INVENTION

The present application provides a program processing method, apparatus and device. The terminal device can accurately determine the calculation module to be optimized, thereby improving the optimization efficiency of the calculation module.

In a first aspect, an embodiment of the present application provides a program processing method, the method comprising:

obtaining a first program, the first program includes a plurality of subprograms;

Add the timing code corresponding to each subroutine in the first program to obtain the second program;

Running the second program, and in the process of running the second program, obtaining the running duration corresponding to each subprogram through the timing code;

The subroutine to be optimized is determined according to the running time corresponding to each subroutine.

In a possible implementation manner, a timing code corresponding to each subroutine is added to the first program to obtain a second program, including:

determining a plurality of sets of locations in the first program, the set of locations including a plurality of addition locations;

Determine the timing code corresponding to each addition position;

Add the corresponding timing code at each addition position.

In a possible implementation, the location set includes:

the starting position of the subroutine code;

the end position of the subroutine code;

The end position of the first program code.

In a possible implementation, the timing code includes:

variable assignment code;

first variable code;

second variable code;

Variable output code.

In a possible implementation manner, determining the timing code corresponding to each adding position includes:

When the addition position is the starting position of the subroutine code, it is determined that the timing code corresponding to the addition position is the variable assignment code and the first variable code; or,

When the added position is the end position of the subroutine code, it is determined that the timing code corresponding to the added position is the second variable code; or,

When the added position is the end position of the first program code, it is determined that the timing code corresponding to the added position is a variable output code.

In a possible implementation manner, the subroutine to be optimized is determined according to the corresponding running time of each subroutine, including:

A subroutine whose running duration is greater than or equal to the first threshold is determined as the subroutine to be optimized.

In a second aspect, an embodiment of the present application provides a program processing apparatus, including an acquisition module, an addition module, an operation module, and a determination module, wherein:

The obtaining module is used to obtain a first program, and the first program includes a plurality of subprograms;

The adding module is used to add the timing code corresponding to each subprogram in the first program to obtain the second program;

The running module is configured to run the second program, and obtain the running duration corresponding to each subprogram through the timing code during the running of the second program;

The determining module is used for determining the subroutine to be optimized according to the running duration corresponding to each subroutine.

In a possible implementation manner, the adding module is specifically used for:

determining a plurality of sets of locations in the first program, the set of locations including a plurality of addition locations;

Determine the timing code corresponding to each addition position;

Add the corresponding timing code at each addition position.

In a possible implementation, the location set includes:

the starting position of the subroutine code;

the end position of the subroutine code;

The end position of the first program code.

In a possible implementation, the timing code includes:

variable assignment code;

first variable code;

second variable code;

Variable output code.

In a possible implementation manner, the adding module is specifically used for:

When the addition position is the starting position of the subroutine code, it is determined that the timing code corresponding to the addition position is the variable assignment code and the first variable code; or,

When the added position is the end position of the subroutine code, it is determined that the timing code corresponding to the added position is the second variable code; or,

When the added position is the end position of the first program code, it is determined that the timing code corresponding to the added position is a variable output code.

In a possible implementation manner, the determining module is specifically used for:

A subroutine whose running duration is greater than or equal to the first threshold is determined as the subroutine to be optimized.

In a third aspect, an embodiment of the present application provides a program processing device, including: a memory, a processor, and a communication interface, where the memory is used for storing program instructions, and the processor is used for calling the program instructions in the memory to execute the execution as in the first aspect The program processing method of any one.

In a fourth aspect, an embodiment of the present application provides a readable storage medium, where a computer program is stored on the readable storage medium; the computer program is used to implement the program processing method according to any one of the first aspect.

In a program processing method, device, and device provided by the embodiments of the present application, a first program is obtained first, wherein the first program includes a plurality of subprograms, and a timing code corresponding to each subprogram is added to the first program to obtain a second program. program; run the second program, and during the running of the second program, obtain the running duration corresponding to each subroutine through the timing code; determine the subroutine to be optimized according to the running duration corresponding to each subroutine. Since the corresponding timing code is added to each subroutine in the second program, when the terminal device runs the second program, the timing code can obtain the running duration of each subroutine, and the user can determine the subroutine to be optimized according to the running duration of each subroutine. The program enables the terminal device to accurately determine the calculation module that needs to be optimized, thereby improving the optimization efficiency of the calculation module.

Description of drawings

FIG. 1 is a schematic diagram of a terminal interface in an application scenario provided by an embodiment of the present application;

2 is a schematic flowchart of a program processing method provided by an embodiment of the present application;

3 is a schematic flowchart of another program processing method provided by an embodiment of the present application;

FIG. 4 is a schematic structural diagram of a program processing apparatus provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of a hardware structure of a program processing device provided by an embodiment of the present application.

Detailed ways

Exemplary embodiments will be described in detail herein, examples of which are illustrated in the accompanying drawings. Where the following description refers to the drawings, the same numerals in different drawings refer to the same or similar elements unless otherwise indicated. The implementations described in the illustrative examples below are not intended to represent all implementations consistent with this disclosure. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present disclosure as recited in the appended claims.

The terms "comprising" and "having", and any variations thereof, in the description and claims of this application and said drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but optionally also includes unlisted steps or units, or optionally also includes For other steps or units inherent to these processes, methods, products or devices.

For ease of understanding, the following describes an application scenario applicable to the present application by taking the terminal device as a computer as an example.

FIG. 1 is a schematic diagram of a terminal interface in an application scenario provided by an embodiment of the present application. Referring to FIG. 1 , the terminal device 101 is a computer, and the terminal interface includes an interface 102 , an interface 103 and an interface 104 .

See interface 102, including a first program, a timing code, and an add icon. Wherein, the first program includes a plurality of subroutines. For example, the first program may be a WRF mode (The Weather Research and Forecasting Model), and the WRF mode includes a radiation process module, a road surface process module, and a planetary boundary layer process module. and Cumulus Process modules, each of which is a subroutine in the WRF schema. The timing codes may include variable assignment codes, first variable codes, second variable codes, and variable output codes. Assuming that the user needs to obtain the running time of each sub-program in the first program, the user can click the "add" icon to cause the terminal device 101 to display the interface 103 .

Please refer to the interface 103, including the second program and the running icon. Wherein, the second program includes multiple subroutines and multiple timing codes. When the user clicks the "Add" icon in the interface 102, the terminal device 101 can process the first program through the program processing method shown in this application to obtain the second program. For example, the terminal device may add a corresponding timing code to the addition position of each subprogram in the first program to obtain the second program. Assuming that the user needs to obtain the running time of each sub-program in the first program, the user can click the “run” icon to cause the terminal device 101 to display the interface 104 .

Please participate in interface 104, including the runtime of the subroutine. When the user clicks the "run" icon in the interface 103, the interface 104 can display the running time of each subprogram in the first program. The terminal device 101 can select the subprogram to be optimized according to the running time of each subprogram.

In the present application, the terminal device can obtain the first program, wherein the first program includes multiple subprograms, add the timing code corresponding to each subprogram in the first program to obtain the second program; run the second program, and in During the running of the second program, the running duration corresponding to each subroutine is obtained through the timing code; the subroutine to be optimized is determined according to the running duration corresponding to each subroutine. Since the corresponding timing code is added to each subroutine in the second program, when the terminal device runs the second program, the timing code can obtain the running duration of each subroutine, and the user can determine the subroutine to be optimized according to the running duration of each subroutine. The program enables the terminal device to accurately determine the calculation module that needs to be optimized, thereby improving the optimization efficiency of the calculation module.

Hereinafter, the method shown in the present application will be described through specific examples. It should be noted that the following embodiments may exist independently or may be combined with each other, and the same or similar content will not be repeated in different embodiments.

FIG. 2 is a schematic flowchart of a program processing method provided by an embodiment of the present application. See Figure 2, including:

S201. Obtain a first program.

The execution body of the embodiment of the present application may be an electronic device, or may be a program processing apparatus provided in the electronic device. The electronic device may be a computer, a server or the like. The electronic device may be a portable electronic device. For example, the electronic device may be a mobile phone, a tablet computer, or the like. The program processing device can be realized by software, or can be realized by a combination of software and hardware.

The first program may include an application program, a numerical calculation program, a driver program of a controller, and the like. For example, the first program may include a WRF mode, a numerical mode that requires extensive computation.

Optionally, the first program includes multiple subprograms. For example, the WRF mode includes a physics module and a chemistry module, wherein the physics module includes a radiation process module, a road surface process module, a planetary boundary layer process module, and a cumulus process module, and each physics module belongs to the subroutine in the WRF mode.

Optionally, the first program may be acquired in the following feasible manner: the first program may be acquired according to the running time of the program. For example, the first program is obtained according to a preset time threshold, and if the running time of the program is greater than or equal to the preset time threshold, the program can be determined as the first program and optimized; if the running time of the program is less than the preset time threshold The time threshold of the program can be determined as a program that does not need optimization.

Optionally, the first program may be acquired in the following feasible manner: the first program may be acquired according to the user's computing requirements. For example, the first program is obtained according to a preset computing demand threshold. In the field of meteorological services, if the computing power demand of meteorological services is greater than or equal to the preset computing demand, the program for computing meteorological services may be determined as the first program, Optimizing it; if the computing power requirement of the meteorological service is less than the preset computing requirement, there is no need to optimize the program for computing the meteorological service.

S202 , adding a timing code corresponding to each subroutine in the first program to obtain a second program.

The timing codes may include variable assignment codes, first variable codes, second variable codes, and variable output codes.

Optionally, timer code external to the first program can be used. For example, the timer code can be edited.

Variable assignment codes are used to assign values to time variables. For example, in WRF mode, before obtaining the running time of the radiation process module, the time variable of the radiation process module can be assigned a value. If the radiation process module is run for the first time, the time variable can be assigned a value of 0. If the radiation process module is run for the second time, the time variable can be assigned a value of 0. Process modules, the time variable can be assigned the time when the radiation process module first ran. This gives the total runtime of all radiation process modules in WRF mode.

The first variable code is used to obtain the system time. For example, adding the first variable code in the first line of the program code, when the program runs, the first time variable code can obtain the system time when the program starts to run.

The second variable code is used to obtain the system time difference. The system time difference may be the difference between the system time obtained by the second variable and the system time obtained by the first variable. For example, the second variable code may be the difference between the current system time and the system time obtained by the first variable code.

Optionally, acquiring the system time code may include a timer code, for example, the timer code may include a stopwatch timer code and a code of the current system time.

Optionally, the timer code may be determined according to the first program. For example, in the WRF mode, the program of the WRF code contains a RSL_INTERNAL_MICROCLOCK() function, whose main function is to obtain the current moment of the operating system, which can be used as a timer code.

The variable output code is used to output the assigned time variable. For example, the time difference obtained by the second time variable code to the system may be the assigned time variable, and the variable output code may output the assigned time variable, that is, the time difference of the output system.

The second program may include a subroutine after adding the timing code. For example, in the WRF mode, the subroutine can be the planetary boundary layer process module in the physics module. After adding the timing code to the planetary boundary layer process module, the second program of the planetary boundary layer process module can be obtained.

Optionally, a timing code can be added to each subprogram in the first program according to the following feasible methods: in the first program, multiple location sets are determined, the location sets include multiple addition locations, and it is determined that each addition location corresponds to , add the corresponding timing code in each addition position.

Wherein, the position set includes a plurality of addition positions, and the addition positions are used to indicate the addition positions of the timing codes. For example, the addition position may be the start position of the subroutine code, the end position of the subroutine code, and the like.

The set of locations may include a start location of the subprogram code, an end location of the subprogram code, and an end location of the first program code. For example, the WRF mode includes two radiation process modules, then the addition positions of the timing codes of the radiation process may include: the end position of the WRF mode code, the start position of the radiation process module code, and the end position of the radiation process module code.

Optionally, the corresponding timing code may be determined according to each addition position. For example, the WRF mode includes two radiation process modules, the end position of the WRF mode code can add the variable output code, the start position of the radiation process module code can add the variable assignment code and the first variable code, and the end position of the radiation process module code can be added A second variable code can be added.

Optionally, a corresponding timing code may be added to each addition position in the first program to obtain the second program. For example, by adding a corresponding timing code to each addition position in the WRF mode, the second program corresponding to the WRF mode can be obtained.

S203. Run the second program, and obtain the running duration corresponding to each subprogram through the timing code during the running of the second program.

A corresponding timing code is added to each addition position in the first program to obtain the second program. During the running of the second program, the timing code can obtain the running duration corresponding to each subroutine.

Optionally, when the second program is running, a corresponding timing code is added to the start position and the end position of each subprogram.

When running the second program, the timing code will also run, and the timing code will output the running time of each subroutine. For example, in the WRF mode, the variable assignment code and the first variable code are added to the starting position of the radiation process module. The variable assignment code can assign a value of 0 to the time variable of the radiation process module in the first run, and the radiation process in the second run. The time variable of the module is assigned the time variable of the last radiation process module operation, and the first variable code can obtain the system time when the radiation process starts to run; the second variable code is added to the end position of the radiation process module, and when the radiation process module finishes running , the second variable code can obtain the time difference between the current system time and the start of the radiation process module, and then obtain the running time of the radiation process module; add a variable output code at the end of the WRF mode, and the variable output code can output the running time of the radiation process module. total time.

S204: Determine the subprogram to be optimized according to the running time length corresponding to each subprogram.

Optionally, the subprogram with the longest running time may be determined as the subprogram to be optimized. For example, in WRF mode, the runtime of the Radiation Process Module is 10 seconds, the Land Surface Process Module is 7 seconds, the Planetary Boundary Layer Process Module is 6 seconds, and the Cumulus Process Module is 4 seconds. The Radiation Process Module can be used as a subroutine to be optimized in the WRF mode.

Optionally, a subprogram whose running duration is greater than or equal to the first threshold may be determined as the subprogram to be optimized. For example, if the first threshold is 10 seconds, if the running duration of the output subroutine is greater than or equal to 10 seconds after running the second program, the subroutine is the subroutine to be optimized, and if the running duration of the output subroutine is less than or equal to 10 seconds 10 seconds, the subroutine is a subroutine that does not need to be optimized.

Optionally, the second program may be run multiple times to obtain the total running time of the multiple subprograms, and the average value is taken as the total running time of the subprograms. For example, in the WRF mode, the total running time of the radiation process module is obtained multiple times, and the average value is taken as the total running time of the radiation process module.

In this application, the terminal device may acquire the first program, where the first program includes multiple subprograms. The terminal device adds the timing code corresponding to each subprogram in the first program to obtain the second program. The terminal device runs the second program, and in the process of running the second program, obtains the running duration corresponding to each subprogram through the timing code. The subroutine to be optimized is determined according to the running time corresponding to each subroutine. Since the corresponding timing code is added to each subroutine in the second program, when the terminal device runs the second program, the timing code can obtain the running duration of each subroutine, and the user can determine the subroutine to be optimized according to the running duration of each subroutine. The program enables the terminal device to accurately determine the calculation module that needs to be optimized, thereby improving the optimization efficiency of the calculation module.

On the basis of any one of the foregoing embodiments, the foregoing program processing method will be described in detail below with reference to FIG. 3 .

FIG. 3 is a schematic flowchart of another program processing method provided by an embodiment of the present application. Referring to Figure 3, the method can include:

S301. Acquire a first program, and determine the structure of the first program.

The first program may include an application program, a numerical calculation program, a driver program of a controller, and the like. For example, the first program may include a WRF mode, a numerical mode that requires extensive computation.

The first program includes a plurality of subroutines. For example, an application includes multiple subroutines with different functions.

Optionally, the first program may be a local program in the terminal device (for example, a system program in the terminal device), or may be a program in the network.

The structure of the first program may be the calling position of the subprogram in the first program, the function name of the subprogram, and the calling sequence of the subprogram. The calling location of the subprogram can be the address of the calling subprogram when the subprogram is running. The function name of the subprogram can be the name of the function called when the subprogram runs. The calling sequence of subroutines is used to indicate the priority of calling subroutines. For example, in the WRF mode, the physical processes all exist in the form of subfunctions in the Fortran language. According to the structure of the WRF mode, it can be known that the main physical process is called in the module_first_rk_step_part1.F program under the WRF code subdirectory dyn_em. The order of calls is the radiation process (the function name is radiation_driver()), the land surface process (the function name is surface_driver()), the planetary boundary layer process (the function name is pbl_driver()), and the cumulus process (the function name is cumulus_driver()) ).

S302. Determine the addition position in the first program according to the structure of the first program.

Optionally, the calling position of each subprogram may be obtained according to the structure of the first program, and the adding position in the first program may be determined according to the calling position of each subprogram. For example, in WRF mode, the physical process is called in the module_first_rk_step_part1.F program in the WRF code subdirectory dyn_em, and the addition location of the physical process can be obtained in this directory.

Optionally, the terminal device may obtain the start position and end position of the subprogram code according to the code of each subprogram.

S303. According to the corresponding relationship between the adding position and the timing code, add the timing code corresponding to each subroutine in the first program to obtain the second program.

The corresponding relationship is used to indicate the relationship between the addition position and the timing code, for example, the corresponding relationship can be as shown in Table 1:

Table 1

serial number Add a location timing code 1 start position of subroutine code variable assignment code 2 start position of subroutine code first variable code 3 the end of the subroutine code second variable code 4 The end position of the first program code variable output code … ... ...

In Table 1, each addition position has a corresponding timing code. It should be noted that Table 1 only shows the corresponding relationship in the form of an example, and does not limit the corresponding relationship.

For example, when the addition position is the start position of the subroutine code, determine that the timing code corresponding to the addition position is the variable assignment code and the first variable code; when the addition position is the end position of the subroutine code, determine the timing code corresponding to the addition position The code is the second variable code; when the added position is the end position of the first program code, it is determined that the timing code corresponding to the added position is the variable output code.

Optionally, the addition position of the variable assignment code is before the addition position of the first variable code, and the variable assignment code can assign a value of 0 to the time variable of the radiation process module in the first run, and the time of the radiation process module in the second run. The variable is assigned the time variable of the last radiation process module run. In this way, when the second program finishes running, the total running time of the same function subroutine can be obtained according to the variable assignment code. For example, in WRF mode, the total running time of all radiation process modules in WRF mode can be obtained through variable assignment codes.

Optionally, variable output code can be added at the end of the last subroutine. For example, in WRF mode, the variable output code can be added at the end of the last radiation process module. When all radiation process modules have finished running, the variable output code can output the total running time of all radiation process modules.

S304. Run the second program, and obtain the running duration corresponding to each subprogram through the timing code.

The following takes the WRF mode as an example to describe in detail the process of obtaining the running duration corresponding to each subroutine through the timing code.

Optionally, the physical processes in the WRF model include radiation processes, land surface processes, planetary boundary layer processes and cumulus processes, taking radiation processes as an example.

According to the structure of the WRF model, it can be determined that the radiation process is called in the module_first_rk_step_part1.F program under the WRF code subdirectory dyn_em. The function name is radiation_driver(), and the radiation process has a higher priority than the land surface process, planetary boundary layer process and cumulus clouds. process.

Optionally, the RSL_INTERNAL_MICROCLOCK() function in the WRF mode is selected as the function for obtaining the current moment of the system.

Add the following code at the beginning of the Radiation Process Module:

BENCH_DECL(rad_driver_tim)rad_driver_tim=0

Assign a value of 0 to the time variable of the Radiation Process Module, then add the code:

BENCH_START(rad_driver_tim)btimex=rsl_internal_microclock()

Gets the system time when the Radiation Process module started running. Add the following code at the end of the Radiation Process Module:

BENCH_END(rad_driver_tim)

rad_driver_tim=rad_driver_tim+rsl_internal_microclock()-btimex

Obtain the difference between the system time at the end of the radiation process module and the system time at the end of the radiation process module, and assign the difference of the system time to the time variable of the radiation process module.

Add the following code at the end of the WRF mode: BENCH_REPORT(rad_driver_tim)write(0,*)'rad_driver_tim=',rad_driver_tim

By outputting the time variable of the radiation process module, the total running time of all radiation process modules in the WRF mode can be obtained.

Optionally, macro definitions can be added before the end of the subroutine variable declaration, which can reduce the complexity of the program. Optionally, you can add the -DBENCH option to the ARCHFLAGS variable definition in the WRF mode compilation configuration file configure.wrf, indicating that the macro BENCH is defined. When adding a macro definition, you can add an empty code. When the program is running, if the macro BENCH is defined, the code will be replaced with the macro definition code. If the macro BENCH is not defined, the code will be replaced with an empty line, which has no effect on the program. influences.

S305. Determine the subprogram to be optimized according to the running time length corresponding to each subprogram.

Optionally, the terminal device may sort the total running time corresponding to the subprograms. For example, the running durations corresponding to the subprograms output by the terminal device are sorted from high to low. The subroutine whose total running time is greater than or equal to the preset time threshold is determined as the subroutine to be optimized.

Optionally, the subroutine to be optimized may be determined according to the running time of each subroutine. For example, in WRF mode, the total operating time of the radiation process module is 10 seconds, the total operating time of the land surface process module is 8 seconds, but the operating time of each radiation process module is 2 seconds, and the operation time of each land surface process module is 2 seconds. The duration is 4 seconds. At this time, the land surface process module can be used as a subroutine to be optimized.

Optionally, the running duration of each subprogram can be obtained multiple times, the average running duration of each subprogram can be obtained, and the subprogram to be optimized is determined according to the average running duration of each subprogram.

In this application, the terminal device may acquire the first program, where the first program includes multiple subprograms. The terminal device adds a timing code to each subroutine according to the corresponding relationship between the added position and the timing code to obtain the second program. The terminal device runs the second program, and in the process of running the second program, obtains the running duration corresponding to each subprogram through the timing code. The subroutine to be optimized is determined according to the running time corresponding to each subroutine. Since the corresponding timing code is added to each subroutine in the second program, when the terminal device runs the second program, the timing code can obtain the running duration of each subroutine, and the user can determine the subroutine to be optimized according to the running duration of each subroutine. The program enables the terminal device to accurately determine the calculation module that needs to be optimized, thereby improving the optimization efficiency of the calculation module.

FIG. 4 is a schematic structural diagram of a program processing apparatus provided by an embodiment of the present application. The apparatus can be set in a terminal device, please refer to FIG. 4 , the program processing apparatus 10 includes an acquisition module 11, an addition module 12, an operation module 13 and a determination module 14, wherein:

The obtaining module 11 is used to obtain a first program, and the first program includes a plurality of subprograms;

The adding module 12 is used to add the timing code corresponding to each subprogram in the first program to obtain the second program;

The running module 13 is used for running the second program, and in the process of running the second program, obtaining the running duration corresponding to each subprogram through the timing code;

The determining module 14 is used for determining the subroutine to be optimized according to the running time corresponding to each subroutine.

In a possible implementation manner, the adding module is specifically used for:

determining a plurality of sets of locations in the first program, the set of locations including a plurality of addition locations;

Determine the timing code corresponding to each addition position;

Add the corresponding timing code at each addition position.

In a possible implementation, the location set includes:

the starting position of the subroutine code;

the end position of the subroutine code;

The end position of the first program code.

In a possible implementation, the timing code includes:

variable assignment code;

first variable code;

second variable code;

Variable output code.

In a possible implementation manner, the adding module is specifically used for:

When the addition position is the starting position of the subroutine code, it is determined that the timing code corresponding to the addition position is the variable assignment code and the first variable code; or,

When the added position is the end position of the subroutine code, it is determined that the timing code corresponding to the added position is the second variable code; or,

When the added position is the end position of the first program code, it is determined that the timing code corresponding to the added position is a variable output code.

In a possible implementation manner, the determining module is specifically used for:

A subroutine whose running duration is greater than or equal to the first threshold is determined as the subroutine to be optimized.

The frequency adjustment apparatus provided in the embodiments of the present application can implement the technical solutions shown in the foregoing method embodiments, and the implementation principles and beneficial effects thereof are similar, which will not be repeated here.

FIG. 5 is a schematic diagram of a hardware structure of a program processing device provided by an embodiment of the present application. Referring to FIG. 5, the program processing device 20 may include: a processor 21 and a memory 22, wherein the processor 21 and the memory 22 can communicate; exemplarily, the processor 21 and the memory 22 communicate through a communication bus 23, and the memory 22 is used to store program instructions, and the processor 21 is used to call the program instructions in the memory to execute the program processing method shown in any of the above method embodiments.

Optionally, the program processing device 20 may further include a communication interface, and the communication interface may include a transmitter and/or a receiver.

Optionally, the above-mentioned processor 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) )Wait. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps in combination with the method disclosed in the present application can be directly embodied as executed by a hardware processor, or executed by a combination of hardware and software modules in the processor.

The present application provides a readable storage medium on which a computer program is stored; the computer program is used to implement the program processing method described in any of the foregoing embodiments.

An embodiment of the present application provides a computer program product, where the computer program product includes instructions, which, when the instructions are executed, cause a computer to execute the above program processing method.

All or part of the steps for implementing the above method embodiments may be completed by program instructions related to hardware. The aforementioned program can be stored in a readable memory. When the program is executed, the steps including the above method embodiments are executed; and the aforementioned memory (storage medium) includes: read-only memory (English: read-only memory, abbreviation: ROM), RAM, flash memory, hard disk, Solid state drive, magnetic tape (English: magnetic tape), floppy disk (English: floppydisk), optical disc (English: optical disc) and any combination thereof.

The embodiments of the present application are described with reference to flowcharts and/or block diagrams of methods, apparatuses (systems), and computer program products according to the embodiments of the present application. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processing unit of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processing unit of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

Obviously, those skilled in the art can make various changes and modifications to the embodiments of the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

It should be understood that, although the steps in the flow charts in the above embodiments are sequentially displayed according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, the execution of these steps is not strictly limited to the order and may be performed in other orders. Moreover, at least a part of the steps in the figure may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but may be executed at different times, and the execution order is not necessarily sequential. Instead, it may be performed in turn or alternately with other steps or at least a portion of sub-steps or stages of other steps.

In this application, the term "comprising" and its variants may mean non-limiting inclusion; the term "or" and its variants may mean "and/or". The terms "first", "second" and the like in this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. In this application, "plurality" means two or more. "And/or", which describes the association relationship of the associated objects, means that there can be three kinds of relationships, for example, A and/or B, which can mean that A exists alone, A and B exist at the same time, and B exists alone. The character "/" generally indicates that the associated objects are an "or" relationship.

Claims (14)

1. A program processing method characterized by comprising:

acquiring a first program, wherein the first program comprises a plurality of subprograms;

adding a timing code corresponding to each subprogram in the first program to obtain a second program;

running the second program, and acquiring the running time corresponding to each subprogram through the timing code in the running process of the second program;

and determining the subprogram to be optimized according to the running time length corresponding to each subprogram.

2. The method of claim 1, wherein adding a timing code corresponding to each sub-program to the first program to obtain a second program comprises:

determining a plurality of position sets in the first program, wherein the position sets comprise a plurality of adding positions;

determining a timing code corresponding to each adding position;

adding a corresponding timing code at each adding position respectively.

3. The method of claim 2, wherein the set of locations comprises:

the starting position of the subprogram code;

an end position of the subroutine code;

an end position of the first program code.

4. A method according to claim 2 or 3, wherein the timing code comprises:

a variable assignment code;

a first variable code;

a second variable code;

the variable outputs the code.

5. The method of claim 2, wherein determining a timing code for each add location comprises:

when the adding position is the initial position of the subprogram code, determining that the timing code corresponding to the adding position is a variable assignment code and a first variable code; or,

when the adding position is the end position of the subprogram code, determining that the timing code corresponding to the adding position is a second variable code; or,

and when the adding position is the end position of the first program code, determining that the timing code corresponding to the adding position is a variable output code.

6. The method according to any one of claims 1 to 3, wherein determining the sub-programs to be optimized according to the running time duration corresponding to each sub-program comprises:

and determining the subprogram with the running time length being greater than or equal to the first threshold value as the subprogram to be optimized.

7. A program processing apparatus comprising an acquisition module, an addition module, an execution module, and a determination module, wherein:

the acquisition module is used for acquiring a first program, and the first program comprises a plurality of subprograms;

the adding module is used for adding a timing code corresponding to each subprogram in the first program to obtain a second program;

the running module is used for running the second program and acquiring the running time corresponding to each subprogram through the timing code in the running process of the second program;

the determining module is used for determining the subprogram to be optimized according to the running time length corresponding to each subprogram.

8. The apparatus of claim 7, wherein the adding module is specifically configured to:

determining a plurality of position sets in the first program, wherein the position sets comprise a plurality of adding positions;

determining a timing code corresponding to each adding position;

adding a corresponding timing code at each adding position respectively.

9. The apparatus of claim 8, wherein the set of locations comprises:

the starting position of the subprogram code;

an end position of the subroutine code;

an end position of the first program code.

10. The apparatus of claim 8 or 9, wherein the timing code comprises:

a variable assignment code;

a first variable code;

a second variable code;

the variable outputs the code.

11. The apparatus of claim 8, wherein the adding module is specifically configured to:

when the adding position is the initial position of the subprogram code, determining that the timing code corresponding to the adding position is a variable assignment code and a first variable code; or,

when the adding position is the end position of the subprogram code, determining that the timing code corresponding to the adding position is a second variable code; or,

and when the adding position is the end position of the first program code, determining that the timing code corresponding to the adding position is a variable output code.

12. The apparatus according to any one of claims 7 to 9, wherein the determining module is specifically configured to:

and determining the subprogram with the running time length being greater than or equal to the first threshold value as the subprogram to be optimized.

13. A program processing apparatus characterized by comprising: a memory for storing program instructions, a processor for calling the program instructions in the memory to perform the program processing method of any one of claims 1-6, and a communication interface.

14. A readable storage medium, characterized in that the readable storage medium has stored thereon a computer program; the computer program is for implementing a program processing method as claimed in any one of claims 1 to 6.

Images