CN115373998A

CN115373998A - Application program optimization method, device, equipment and medium

Info

Publication number: CN115373998A
Application number: CN202211033352.8A
Authority: CN
Inventors: 王众豪
Original assignee: Beijing Zitiao Network Technology Co Ltd
Current assignee: Beijing Zitiao Network Technology Co Ltd
Priority date: 2022-08-26
Filing date: 2022-08-26
Publication date: 2022-11-22

Abstract

The embodiment of the disclosure relates to an application program optimization method, device, equipment and medium, wherein the method comprises the following steps: sending a control instruction to a target data set, wherein the target data set is a part of data sets in a plurality of data sets in an application program; responding to the control instruction, and calling a target proxy function corresponding to the target data set; calling a system function through a target proxy function, and carrying out memory occupation processing on the system function; the target proxy function updates the memory occupation condition of the target data set according to the processing result; and optimizing the application program according to the memory occupation condition. By adopting the technical scheme, the memory occupation condition of the monitoring target data set and the memory occupation condition based on the target data set can be refined for optimizing the application program, compared with the prior art, the refined memory occupation condition of the specific function of the monitoring application program can be realized, and the targeted optimization of the application program providing the specific function is finally refined.

Description

Application program optimization method, device, equipment and medium

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a medium for optimizing an application.

Background

In recent years, the functions of various application programs are more diversified and complicated, and the memory occupied by the application programs is larger and larger. For example, the application is a video application, and the video application provides more and more special effects, resulting in more and more memory occupied by the application.

In order to facilitate the user to optimize the application program, the memory usage of the application program needs to be monitored. However, the related art can only monitor the memory usage of the whole application program, and the memory usage of the whole application program can only represent the whole usage of the application program in a general manner, and cannot refine the memory usage of different functions of the application program, so that the memory usage based on different functions cannot be refined to optimize the application program.

Disclosure of Invention

In order to solve the technical problems or at least partially solve the technical problems, the present disclosure provides an application optimization method, apparatus, device and medium.

The embodiment of the disclosure provides an application program optimization method, which comprises the following steps:

issuing a control instruction to a target data set, wherein the target data set is a partial data set in a plurality of data sets in an application program;

responding to the control instruction, and calling a target proxy function corresponding to the target data set;

calling a system function through the target proxy function, wherein the system function carries out memory occupation processing;

the target agent function updates the memory occupation condition of the target data set according to the processing result;

and optimizing the application program according to the memory occupation condition.

An embodiment of the present disclosure further provides an application optimization apparatus, where the apparatus includes:

the control instruction issuing module is used for issuing a control instruction to a target data set, wherein the target data set is a part of data sets in a plurality of data sets in an application program;

a control instruction response module, configured to respond to the control instruction and call a target proxy function corresponding to the target data set;

the memory occupation processing module is used for calling a system function through the target proxy function, and the system function carries out memory occupation processing;

the updating module is used for updating the memory occupation condition of the target data set by the target proxy function according to the processing result;

and the application program optimization module is used for optimizing the application program according to the memory occupation condition.

The embodiment of the disclosure also provides a computer-readable storage medium, which stores a computer program for executing the application program optimization method provided by the embodiment of the disclosure.

An embodiment of the present disclosure further provides a terminal device, where the terminal device includes: a processor; a memory for storing the processor-executable instructions; the processor is used for reading the executable instructions from the memory and executing the instructions to realize the application program optimization method provided by the embodiment of the disclosure.

Embodiments of the present disclosure also provide computer program products, which include computer programs/instructions, which when executed by a processor implement the application optimization methods provided by embodiments of the present disclosure.

Compared with the prior art, the technical scheme provided by the embodiment of the disclosure has the following advantages: according to the application program optimization scheme provided by the embodiment of the disclosure, a control instruction is sent to a target data set, wherein the target data set is a part of data sets in a plurality of data sets in an application program; responding to the control instruction, and calling a target proxy function corresponding to the target data set; calling a system function through a target proxy function, and carrying out memory occupation processing on the system function; the target proxy function updates the memory occupation condition of the target data set according to the processing result; and optimizing the application program according to the memory occupation condition. By adopting the technical scheme, the memory occupation condition of the monitoring target data set and the memory occupation condition based on the target data set can be detailed for optimizing the application program, compared with the prior art, the detailed memory occupation condition of the specific function of the monitoring application program can be realized, and the targeted optimization of the application program providing the specific function can be finally detailed.

Drawings

The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.

Fig. 1 is a schematic flowchart of an application optimization method according to an embodiment of the present disclosure;

FIG. 2 is a flowchart illustrating another method for optimizing an application according to an embodiment of the present disclosure;

FIG. 3 is a flowchart illustrating a further method for optimizing an application according to an embodiment of the present disclosure;

FIG. 4 is a schematic diagram of a mapping relationship between a data set and a proxy function provided by an embodiment of the present disclosure;

FIG. 5 is a flowchart illustrating a further method for optimizing an application according to an embodiment of the disclosure;

fig. 6 is a schematic structural diagram of an application optimization apparatus according to an embodiment of the present disclosure;

fig. 7 is a schematic structural diagram of a terminal device according to an embodiment of the present disclosure.

Detailed Description

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.

It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order, and/or performed in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.

The term "include" and variations thereof as used herein are open-ended, i.e., "including but not limited to". The term "based on" is "based, at least in part, on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions for other terms will be given in the following description.

It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence of the functions performed by the devices, modules or units.

It is noted that references to "a" or "an" in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will appreciate that references to "one or more" are intended to be exemplary and not limiting unless the context clearly indicates otherwise.

The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.

The application program can provide different functions, and the memory occupied by each function is different, so that when the different functions of the application program are started, the memories actually occupied by the application program are different. For example, the application program is a video application program, the video application program provides special effect functions, different special effect functions correspond to different properties, and due to different property templates, definitions and property color data corresponding to different special effect functions, the memory actually occupied when the different properties of the application program are started is different, and the memory occupation condition of the specific properties needs to be refined to monitor, and the application program providing the specific properties needs to be optimized in a targeted manner.

In order to solve the above problem, embodiments of the present disclosure provide an application optimization method, which is described below with reference to specific embodiments.

Fig. 1 is a flowchart of an application optimization method provided in an embodiment of the present disclosure, where the method may be executed by an application optimization apparatus, where the apparatus may be implemented by software and/or hardware, and may generally be integrated in a terminal device. As shown in fig. 1, the method includes:

step 101, a control instruction is sent to a target data set, wherein the target data set is a partial data set in a plurality of data sets in an application program.

In this embodiment, when the application optimization is required, a terminal device such as a mobile phone, a computer, or a tablet pre-loads a plurality of data sets of the application, determines a part of the data sets from the plurality of data sets as a target data set, and issues a control instruction for the target data set.

The control instruction refers to a code for indicating the memory occupation condition of the monitoring target data set.

If the memory occupation situation of one or more functions on the application program needs to be monitored, a control instruction needs to be issued to a target data set corresponding to the one or more functions, so that the operation of monitoring the memory occupation situation of the one or more functions is executed based on the instruction.

The plurality of data sets may be local (Native) libraries corresponding to a plurality of functions on the application program. The Native library has the capability of providing the corresponding function, and the detailed explanation is that the Native library is equivalent to an interface and can call a bottom-layer resource package corresponding to the function, so that the application program can provide the function.

Continuing to take the example that the application program is a video application program, the video application program provides different special effect functions, the different special effect functions correspond to different properties, each property corresponds to one Native library, and the corresponding bottom resource package can be called through the Native library, so that the video application program can provide the special effect function.

Taking the application program as a video application program as an example, the video application program provides a beautifying function, the beautifying function is refined into face optimization, wrinkle desalination, eye optimization, nose bridge optimization, lip optimization and the like, each beautifying function corresponds to one Native library, and the corresponding bottom resource package can be called through the Native library, so that the video application program can provide beautifying capability.

Alternatively, different Native libraries may be denoted as a.so, b.so, c.so … x.so.

The target data set refers to one or more Native libraries corresponding to specific functions needing to be monitored on the application program.

And 102, responding to the control instruction, and calling a target proxy function corresponding to the target data set.

In this embodiment, each of the multiple data sets corresponds to a proxy function, and in order to monitor the memory usage of the target data set of the application program, based on the correspondence, the target proxy function corresponding to the target data set is determined and the target proxy function is called.

The proxy function can be used for intercepting the process of function call and returning the parameters for carrying out memory occupation processing corresponding to the local library.

And 103, calling a system function through the target proxy function, wherein the system function carries out memory occupation processing.

In this embodiment, when the terminal device runs the target proxy function, the system function is called through the target proxy function, and the system function is run so that the system function performs memory occupation processing.

The system function is a function that actually executes memory occupation processing.

Specifically, when the terminal device calls the target proxy function, the target proxy function can return parameters for performing memory occupation processing corresponding to the local library, and perform memory allocation processing according to the parameters for performing memory occupation processing returned by the target proxy function and the category of the control instruction for responding to the target proxy function, so as to allocate a memory for the target data set, or perform memory release processing according to the parameters for performing memory occupation processing returned by the target proxy function and the category of the control instruction for responding to the target proxy function, so as to release the memory corresponding to the target data set.

And step 104, updating the memory occupation condition of the target data set by the target proxy function according to the processing result.

In this embodiment, after the memory usage processing is performed by the system function, the target proxy function is continuously used to update the memory usage of the target data set according to the memory processing result, and monitor the latest memory usage corresponding to the target data set.

The memory occupation condition refers to actual memory occupation corresponding to the target data set. The actual occupied memory may be a specific byte number or a memory occupied percentage.

The memory processing result refers to the completion condition of the memory processing.

In an embodiment of the present disclosure, if the memory processing process is completed, the original memory size corresponding to the target data set is added to the memory allocation size to obtain the latest memory occupation condition corresponding to the target data set.

In another embodiment of the present disclosure, if the memory processing process is completed, the latest memory occupation condition corresponding to the target data set is obtained by subtracting the memory release size from the original memory size corresponding to the target data set.

It can be understood that, for the target data set, the memory usage can be obtained through the above steps, so that the memory usage of each data set in the multiple data sets is monitored, and the user can master the memory actually occupied by each data set.

Continuing to take the example that the application program is a video application program, the terminal device monitors the memory occupied by the data set a 'corresponding to the special effect function a in the video application program to obtain the memory occupation condition of the data set a' corresponding to the special effect function a, for example, the memory occupation condition is that the memory occupied by the target data set corresponding to the special effect function a is large.

And 105, optimizing the application program according to the memory occupation condition.

In this embodiment, if the terminal device determines that the memory occupied by the target data set is large according to the memory occupied condition of the target data set, it determines that the bottom resource packet corresponding to the target data set is large, and needs to compress the bottom resource packet corresponding to the target data set.

In other embodiments, the memory leak detection may be performed by monitoring the memory occupation condition of the target data set in real time, so as to accurately locate whether the memory leak exists in the target data set and locate the reason for the memory leak of the target data set.

Taking the application program as a video application program as an example, the terminal device monitors the memory occupation condition of the B-beauty function in the video application program, performs memory leak detection, and determines the reason why the memory leak exists in the data set corresponding to the B-beauty function and further occurs.

According to the application program optimization scheme provided by the embodiment of the disclosure, a control instruction is sent to a target data set, wherein the target data set is a part of data sets in a plurality of data sets in an application program; responding to the control instruction, and calling a target proxy function corresponding to the target data set; calling a system function through a target proxy function, and carrying out memory occupation processing on the system function; the target proxy function updates the memory occupation condition of the target data set according to the processing result; and optimizing the application program according to the memory occupation condition. By adopting the technical scheme, the memory occupation condition of the monitoring target data set and the memory occupation condition based on the target data set can be refined for optimizing the application program, compared with the prior art, the refined memory occupation condition of the specific function of the monitoring application program can be realized, and the targeted optimization of the application program providing the specific function is finally refined.

In another embodiment of the present disclosure, a corresponding proxy function may be configured for a target data set in advance, a mapping relationship between a data set identifier and the proxy function is established, where the mapping relationship may be a one-to-one relationship or a many-to-one relationship, and the target proxy function is further called based on the mapping relationship.

Fig. 2 is a schematic flow chart of another application optimization method provided in the embodiment of the present disclosure, and the embodiment further optimizes the application optimization method based on the above embodiment. As shown in fig. 2, the method includes:

step 201, configuring a corresponding proxy function for the target data set, and establishing a mapping relationship between the data set identifier and the proxy function.

In this embodiment, before the application program is executed, a preconfigured application program optimization logic code is run, where the application program optimization logic code includes a mapping relationship configuration code, a corresponding proxy function is configured for the target data set based on the mapping relationship configuration code, and a mapping relationship between the data set identifier and the proxy function is established.

The application monitoring logic code can be compiled and executed based on a preset framework of an operating system. Alternatively, the preset framework of the operating system may be a Hook framework, which is equivalent to a Hook and is used to intercept the procedure of the function call.

The mapping relation configuration code comprises a data set identifier corresponding to the target data set, an agent function and a mapping relation between the data set identifier and the agent function.

Specifically, the framework of the preset operating system can reserve a proxy function pool, where the proxy function pool includes a proxy function corresponding to each data set.

In some embodiments of the present disclosure, the proxy function pool may include a plurality of proxy functions, and accordingly, the mapping relationship includes: each data set identifies a first mapping relationship that uniquely corresponds to one proxy function.

In other embodiments of the present disclosure, the proxy function pool includes only one proxy function, and accordingly, the mapping relationship includes: the plurality of data sets identifies a second mapping corresponding to a proxy function.

Wherein, the data set identification refers to a symbol or letter for identifying the data set.

In order to facilitate statistics of parameters for memory occupation processing returned by the proxy function, instrumentation can be performed in the proxy function, and a mapping relationship between a data set and instrumentation is established. The instrumentation corresponding to the proxy function can record the parameters of the memory occupation processing of the corresponding data block, so that the parameters of the memory occupation processing returned by the proxy function can be counted conveniently.

Step 202, a control instruction is sent to a target data set, wherein the target data set is a partial data set in a plurality of data sets in an application program.

Step 202 is similar to step 101, and is not described herein.

Step 203, responding to the control instruction, inquiring the first mapping relation according to the target data set identifier of the target data set, and calling a target proxy function corresponding to the target data set identifier.

In an embodiment, each data set identifier uniquely corresponds to a first mapping relationship of an agent function, and then the target agent function corresponding to the target data set identifier is directly called, so that the target agent function returns a parameter which needs to be subjected to memory processing, and memory occupation processing based on the parameter is facilitated subsequently.

And 204, responding to the control instruction, inquiring the second mapping relation according to the target data set identifier of the target data set, calling a target proxy function corresponding to the target data set identifier, and labeling the target data set identifier and the corresponding time identifier for the target proxy function.

In this embodiment, the plurality of data sets may correspond to one proxy function, and for the target data set, the proxy function corresponding to the target data set may be called based on the second mapping relationship, and the target proxy function returns a parameter that needs to be subjected to memory processing, so that memory occupation processing is subsequently performed based on the parameter, and a target data set identifier and a corresponding time identifier need to be labeled for the target proxy function, so that intercepted time corresponding to the target data set is determined based on the time identifier and the target data set identifier.

In some embodiments of the present disclosure, if the number of the target data sets is multiple, the same proxy function may be called based on the stack backtracking principle, and for each stack backtracking process, the target proxy function is labeled with a target data set identifier and a corresponding time identifier.

In other embodiments of the present disclosure, if the number of the target data sets is multiple, a target proxy function may be called once from the first target data set for the first target data set, and after the target proxy function returns the parameter for performing memory processing corresponding to the first target data set, the target proxy function is continuously called once for the next target data set, and the target proxy function returns the parameter for performing memory processing corresponding to the next target data set until the target proxy function is called for all target data sets that need to be monitored. Specifically, each time the target proxy function is called, the target proxy function needs to be labeled with a target data set identifier and a corresponding time identifier.

Step 205, calling the system function through the target proxy function, and performing memory occupation processing on the system function.

And step 206, updating the memory occupation condition of the target data set by the target proxy function according to the processing result.

And step 207, optimizing the application program according to the memory occupation condition.

The implementation manner of step 205 to step 207 may refer to the description of the above embodiment, and is not described herein again.

The technical solution provided in this embodiment may establish a one-to-one mapping relationship for each data set and proxy function, may also establish a many-to-one mapping relationship for a plurality of data sets and proxy functions, and accurately invoke the mapping function corresponding to the target data set based on the mapping relationship.

In another embodiment of the present disclosure, the memory usage processing method may include applying for memory allocation and applying for memory release, so as to record the increased memory allocation size of the target data set and record the decreased memory release size of the target data set.

Fig. 3 is a schematic flow chart of another application optimization method provided in the embodiment of the present disclosure, and the embodiment further optimizes the application optimization method based on the above embodiment. As shown in fig. 3, the method includes:

step 301, a control instruction is issued to a target data set, where the target data set is a partial data set of a plurality of data sets in an application program.

In the above description, the step 301 is realized in a specific manner by referring to the description of the above embodiments.

Step 302, in the case that the control instruction is an open instruction, in response to the open instruction, invoking a first proxy function in the target proxy functions corresponding to the target data set.

In this embodiment, a first proxy function of the target proxy functions corresponding to the target dataset may be invoked based on the first mapping relationship or the second mapping relationship between the dataset identification and the proxy function.

The open instruction may be understood as instruction information for performing memory allocation on the target data set.

The first proxy function refers to a proxy function capable of calling a first system function for memory allocation.

Further, in this embodiment, after the first proxy function is called, the first system function may be called by the first proxy function to apply for memory allocation.

Specifically, the first system function has logic for applying for memory allocation, and may apply for memory allocation to the heap memory based on the logic, so that an appropriate memory space is allocated for the target data set.

The first system function is a system function for executing memory allocation operation.

The heap memory is a memory area which allows dynamic application of memory spaces of different sizes during the running process of an application program.

Step 303, according to the memory allocation result of the first system function, the first proxy function records the memory allocation address and the memory allocation size.

The memory allocation result may be a completion condition of the memory allocation, and if the first system function completes the memory allocation, the first system records a memory allocation address and a memory allocation size.

The memory allocation address refers to a virtual address corresponding to the target data set.

The memory allocation size refers to the size of the memory space allocated for the target data set.

And step 304, recording the increased memory allocation size of the target data set through the first parameter of the first proxy function, and updating the memory occupation condition of the target data set.

The first parameter may be understood as a parameter returned by the first proxy function for performing memory processing.

And the increased memory allocation size of the target data set is equal to the value corresponding to the first parameter.

And the memory occupation condition of the updated target data set is the sum of the memory occupation size before updating and the memory allocation size.

Step 305, in the case that the control instruction is a close instruction, in response to the close instruction, calling a second proxy function in the target proxy functions corresponding to the target data set.

In this embodiment, a second proxy function of the target proxy functions corresponding to the target data set may be invoked based on the first mapping relationship or the second mapping relationship between the data set identifier and the proxy function.

The closing instruction may be understood as instruction information for performing memory release on the target data set.

The second proxy function refers to a proxy function capable of calling the first system function of the memory allocation.

Further, in this embodiment, after the second proxy function is called, the second system function may be called by the second proxy function to apply for the memory release.

Specifically, the second system function has logic for applying for memory release, and may apply for memory release from the heap memory based on the logic, so as to release the memory space corresponding to the target data set.

The second system function is a system function for executing the memory release operation.

Step 306, according to the memory release result of the second system function, the second proxy function records the memory release address and the memory release size.

The memory release result may be a completion condition of the memory release, and if the second system function has completed the memory release, the second system records the memory release address and the memory release size.

The memory release address refers to a virtual address corresponding to the target data set.

The memory release size refers to a size of a reduced memory space of the target data set.

And 307, recording the reduced memory release size of the target data set through a second parameter of the second proxy function, and updating the memory occupation condition of the target data set.

The second parameter may be understood as a parameter returned by the second proxy function for performing memory processing.

And the reduced memory allocation size of the target data set is equal to the value corresponding to the second parameter.

And the memory occupation condition of the updated target data set is the difference between the memory occupation size before updating and the memory allocation size.

To facilitate understanding of the mapping relationship between the data sets and the proxy functions, as shown in fig. 4, the plurality of data sets include data sets a.so, b.so … x.so, the first proxy function includes F1_ a/F2_ a/F3_ a, F1_ b/F2_ b/F3_ b … F1_ x/F2_ x/F3_ x, the second proxy function includes E1_ a/E2_ a/E3_ a, E1_ b/E2_ b/E3_ b … E1_ x/E2_ x/E3_ x, the first system function includes M1/N1/P1, and the second system function includes M2/N2/P2. The data set a.so establishes a mapping relation with the first proxy function F1_ a/F2_ a/F3_ a and the second proxy function E1_ a/E2_ a/E3_ a, and the data set b.so establishes a mapping relation … data set x.so establishes a mapping relation with the first proxy function F1_ b/F2_ b/F3_ b and the second proxy function E1_ b/E2_ b/E3_ b and the first proxy function F1_ x/F2_ x/F3_ x and the second proxy function E1_ x/E2_ x/E3_ x. In addition, the plurality of first proxy functions correspond to the first system functions M1/N1/P1, and the plurality of second proxy functions correspond to the second system functions M2/N2/P2.

Taking a target data set as a.so as an example, when memory allocation needs to be performed on the a.so, in response to an open instruction on the a.so, a first proxy function F1_ a/F2_ a/F3_ a corresponding to the a.so is called, then, a first system function M1/N1/P1 is called through the first proxy function F1_ a/F2_ a/F3_ a to apply for memory allocation, a memory allocation address and a memory allocation size are recorded according to a memory allocation result of the first system function M1/N1/P1, and a memory allocation size increased by the a.so is recorded through a first parameter of the first proxy function, so that a memory occupation condition of the target data set is updated.

When the memory release of the a.so is needed, a second proxy function E1_ a/E2_ a/E3_ a corresponding to the a.so is called in response to a closing instruction of the a.so, then, a second system function M2/N2/P2 is called through the second proxy function E1_ b/E2_ b/E3_ b to apply for the memory release, the memory release address and the memory release size are recorded according to the memory release result of the first system function M2/N2/P2, the memory release size increased by the a.so is recorded through a second parameter of the second proxy function, and the memory occupation condition of the target data set is updated.

And 308, optimizing the application program according to the memory occupation condition.

The specific implementation manner of step 308 is as described in the above embodiments.

According to the technical scheme provided by the embodiment, the memory occupation processing mode can comprise applying for memory allocation and applying for memory release, so that the increased memory allocation size of the target data set is recorded and the reduced memory release size of the target data set is recorded. By the method, the memory occupation condition of the target data set can be conveniently and quickly positioned, and the application program is further optimized and the memory leakage analysis is further carried out on the basis of the memory occupation condition.

In another embodiment of the present disclosure, a security prompt or a positioning to a detailed function can be performed and optimized according to the current memory usage amount and threshold of the target data set.

Fig. 5 is a schematic flowchart of another application optimization method provided by the embodiment of the present disclosure, and the embodiment further optimizes the application optimization method based on the above embodiment. As shown in fig. 5, the method includes:

step 501, a control instruction is sent to a target data set, where the target data set is a partial data set in a plurality of data sets in an application program.

Step 502, in response to the control instruction, invoking a target proxy function corresponding to the target data set.

Step 503, calling the system function through the target proxy function, and performing memory occupation processing on the system function.

And step 504, the target proxy function updates the memory occupation condition of the target data set according to the processing result.

The specific implementation manner of steps 501 to 504 is as described in the foregoing embodiments.

Step 505, detecting whether the current memory occupation quantity of the target data set is greater than a preset first threshold value.

The current memory occupation quantity of the target data set refers to the memory occupation size corresponding to the current monitoring time.

The preset first threshold is used for judging whether the memory occupation quantity of the safety prompt is carried out.

Specifically, it may be determined whether the current memory usage amount of the target data set is greater than a preset first threshold by detecting an insertion in the proxy function corresponding to the target data set, and if the current memory usage amount of the target data set is greater than the preset first threshold, step 506 is executed, otherwise, step 507 is executed.

And step 506, sending safety prompt information of the target data set.

The safety prompt information is used for prompting a user that the occupied memory of the heap is large, so that the user can analyze reasons based on the safety prompt information.

Step 507, detecting whether the current memory occupation quantity of the target data set is greater than a preset second threshold, wherein the second threshold is smaller than the first threshold.

The preset second threshold is used for judging whether to replace the resource data, that is, whether to compress the resource data.

Specifically, if the current memory usage amount of the target data set is greater than the preset second threshold, step 508 is executed, otherwise, the process is ended.

And step 508, determining the current application operation, and acquiring the original resource data associated with the application operation.

Here, the application operation refers to operation information for a function provided by using a certain data set on an application program.

The original resource data may be the largest underlying resource package called by the data set associated with the application operation, and the optimal function can be provided based on the original resource data associated with the application operation.

Continuing to take the example that the application program is a video application program, if the terminal device monitors that the current memory occupied quantity of the target data set corresponding to the a special effect function in the video application program is greater than a preset second threshold, it needs to acquire the original resource data associated with the application operation, that is, acquire the maximum bottom resource packet corresponding to the a special effect function, and based on the maximum bottom resource packet corresponding to the a special effect function, the definition of the a special effect function provided in the video application program is the highest.

Step 509, the original resource data is replaced with target resource data, wherein the capacity of the target resource data is smaller than the capacity of the original resource data.

The target resource data may be a non-maximum underlying resource package called by the data set associated with the application operation, and the provided function is non-optimal based on the target resource data associated with the application operation.

Continuing to take the example that the application program is a video application program, if the terminal device monitors that the current memory occupation quantity of the target data set corresponding to the special effect a function in the video application program is greater than a preset second threshold value, the obtained original resource data associated with the application operation is replaced with the target resource data, so that the definition of the special effect a function provided in the video application program is slightly low.

In this embodiment, the first threshold and the second threshold are determined according to a performance parameter of the terminal device in which the application program operates.

The performance parameters of the terminal equipment are used for representing the operation capacity of the terminal equipment. Optionally, the performance parameters may include parameters such as a central processing unit, a core number, a bus, a cache, and a memory.

According to the technical scheme provided by the embodiment of the disclosure, safety prompt or optimization of positioning to a refining function can be performed according to the current memory occupation quantity and the threshold of the target data set.

Fig. 6 is a schematic structural diagram of an application optimization apparatus, which may be implemented by software and/or hardware, and may be generally integrated in a terminal device according to an embodiment of the present disclosure. As shown in fig. 6, the application optimization apparatus 600 includes:

a control instruction issuing module 601, configured to issue a control instruction to a target data set, where the target data set is a partial data set in a plurality of data sets in an application;

a control instruction response module 602, configured to respond to the control instruction and call a target proxy function corresponding to the target data set;

a memory occupation processing module 603, configured to call a system function through the target proxy function, where the system function performs memory occupation processing;

an updating module 604, configured to update, by the target proxy function, a memory usage of the target data set according to a processing result;

and an application optimization module 605, configured to optimize the application according to the memory usage.

In some optional embodiments, the apparatus further comprises:

and the proxy function configuration module is used for configuring a corresponding proxy function for the target data set and establishing a mapping relation between the data set identifier and the proxy function.

In some optional embodiments, the mapping relationship comprises: each data set identification uniquely corresponds to a first mapping of a proxy function, then,

the control instruction response module 602 is specifically configured to query the first mapping relationship according to the target data set identifier of the target data set, and call a target proxy function corresponding to the target data set identifier.

In some optional embodiments, the mapping relationship comprises: the plurality of data sets identifies a second mapping relationship corresponding to a proxy function, then,

the control instruction response module 602 is specifically configured to query the second mapping relationship according to the target data set identifier of the target data set, call a target proxy function corresponding to the target data set identifier, and label the target data set identifier and a corresponding time identifier for the target proxy function.

In some optional embodiments, the control instruction response module 602 is specifically configured to, in a case that the control instruction is an open instruction, respond to the open instruction, and invoke a first proxy function in target proxy functions corresponding to the target data set;

correspondingly, the memory occupation processing module 603 is specifically configured to record, according to the memory allocation result of the first system function, a memory allocation address and a memory allocation size by the first proxy function;

correspondingly, the updating module 604 is configured to record the memory allocation size added to the target data set through the first parameter of the first proxy function, and update the memory usage of the target data set.

In some optional embodiments, the control instruction response module 602 is specifically configured to, in a case that the control instruction is a close instruction, respond to the close instruction, and invoke a second proxy function in the target proxy functions corresponding to the target data set;

correspondingly, the memory occupation processing module 603 is specifically configured to record, according to the memory release result of the second system function, a memory release address and a memory release size by the second proxy function;

correspondingly, the updating module 604 is configured to record the size of the memory release reduced by the target data set through a second parameter of the second proxy function, and update the memory usage of the target data set.

In some alternative embodiments, the application optimization module 605 includes:

the first detection unit is used for detecting whether the current memory occupation quantity of the target data set is greater than a preset first threshold value or not;

and the safety prompt information sending unit is used for sending the safety prompt information of the target data set if the safety prompt information is larger than or equal to the first threshold value.

In some alternative embodiments, the application optimization module 605 further comprises:

a second detecting unit, configured to detect whether a current memory usage amount of the target data set is greater than a preset second threshold if the current memory usage amount is smaller than the first threshold, where the second threshold is smaller than the first threshold;

a current application operation determination unit, configured to determine a current application operation if the current application operation is greater than or equal to the second threshold;

an original resource data acquisition unit, configured to acquire original resource data associated with the application operation;

and the resource data replacing unit is used for replacing the original resource data with target resource data, wherein the capacity of the target resource data is smaller than that of the original resource data.

In some optional embodiments, the apparatus further comprises:

and the threshold value determining module is used for determining the first threshold value and the second threshold value according to the performance parameters of the terminal equipment operated by the application program.

The application program optimization device provided by the embodiment of the disclosure can execute the application program optimization method provided by any embodiment of the disclosure, and has corresponding functional modules and beneficial effects of the execution method.

To implement the above embodiments, the present disclosure also proposes a computer program product comprising a computer program/instructions which, when executed by a processor, implement the application optimization method in the above embodiments.

Referring now specifically to fig. 7, a schematic diagram of a terminal device suitable for implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.

As shown in fig. 7, the terminal device may include a processing means (e.g., a central processing unit, a graphic processor, etc.) 701, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage means 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the terminal device are also stored. The processing device 701, the ROM 702, and the RAM 703 are connected to each other by a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.

Generally, the following devices may be connected to the I/O interface 705: input devices 706 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 707 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 708 including, for example, magnetic tape, hard disk, etc.; and a communication device 709. The communication means 709 may allow the terminal device to communicate with other devices wirelessly or by wire to exchange data. While fig. 7 illustrates a terminal device having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.

In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated by the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via the communication means 709, or may be installed from the storage means 708, or may be installed from the ROM 702. The computer program performs the above-described functions defined in the program optimization method of the embodiment of the present disclosure when executed by the processing device 701.

It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.

In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.

The computer readable medium may be included in the terminal device; or may exist separately without being assembled into the terminal device.

The computer-readable medium carries one or more programs which, when executed by the terminal device, cause the terminal device to: acquiring a conference text of the conference audio and video; inputting the meeting text into a to-be-handled recognition model, and determining an initial to-be-handled sentence; inputting the initial to-be-handled statement into a temporal judgment model, and determining a temporal result; and determining the conference to-be-handled sentences in the initial to-be-handled sentences based on the temporal results.

Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including but not limited to an object oriented programming language such as Java, smalltalk, C + +, including conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of an element does not in some cases constitute a limitation on the element itself.

The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems on a chip (SOCs), complex Programmable Logic Devices (CPLDs), and the like.

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

The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other combinations of features described above or equivalents thereof without departing from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.

Further, while operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

Claims

1. An application optimization method, comprising:

2. The method of claim 1, further comprising, prior to said issuing a control instruction to a target data set:

and configuring a corresponding proxy function for the target data set, and establishing a mapping relation between the data set identification and the proxy function.

3. The method of claim 2, wherein the mapping comprises: each data set identifies a first mapping that uniquely corresponds to a proxy function, then,

the calling a target proxy function corresponding to the target data set includes:

and inquiring the first mapping relation according to the target data set identifier of the target data set, and calling a target proxy function corresponding to the target data set identifier.

4. The method of claim 2, wherein the mapping comprises: the plurality of data sets identifies a second mapping relationship corresponding to a proxy function, then,

and inquiring the second mapping relation according to the target data set identifier of the target data set, calling a target proxy function corresponding to the target data set identifier, and labeling the target data set identifier and the corresponding time identifier for the target proxy function.

5. The method of claim 1, wherein said invoking a target proxy function corresponding to the target data set in response to the control instruction comprises:

under the condition that the control instruction is a starting instruction, responding to the starting instruction, and calling a first proxy function in target proxy functions corresponding to the target data set;

the calling a system function through the target proxy function, the system function performing memory occupation processing, including:

according to the memory allocation result of the first system function, the first proxy function records the memory allocation address and the memory allocation size;

the target proxy function updates the memory occupation condition of the target data set according to the processing result, and the method comprises the following steps:

and recording the increased memory allocation size of the target data set through a first parameter of the first proxy function, and updating the memory occupation condition of the target data set.

6. The method of claim 1, wherein said invoking a target proxy function corresponding to said target data set in response to said control instruction comprises:

under the condition that the control instruction is a closing instruction, responding to the closing instruction, and calling a second proxy function in the target proxy functions corresponding to the target data set;

according to the memory release result of the second system function, the second proxy function records the memory release address and the memory release size;

and recording the reduced memory release size of the target data set through a second parameter of the second proxy function, and updating the memory occupation condition of the target data set.

7. The method according to any of claims 1-6, wherein said optimizing said application according to said memory footprint comprises:

detecting whether the current memory occupation quantity of the target data set is greater than a preset first threshold value or not;

and if the first threshold value is larger than or equal to the first threshold value, sending safety prompt information of the target data set.

8. The method of claim 7, further comprising:

if the current memory occupation quantity of the target data set is smaller than the first threshold, detecting whether the current memory occupation quantity of the target data set is larger than a preset second threshold, wherein the second threshold is smaller than the first threshold;

if the second threshold value is larger than or equal to the second threshold value, determining the current application operation;

acquiring original resource data associated with the application operation;

and replacing the original resource data with target resource data, wherein the capacity of the target resource data is smaller than that of the original resource data.

9. The method of claim 8, further comprising:

and determining the first threshold value and the second threshold value according to the performance parameters of the terminal equipment operated by the application program.

10. An application optimization apparatus, comprising:

the control instruction response module is used for responding to the control instruction and calling a target proxy function corresponding to the target data set;

11. A computer-readable storage medium having stored therein instructions which, when run on a terminal device, cause the terminal device to carry out the method of any one of claims 1-9.

12. An apparatus, comprising: memory, a processor, and a computer program stored on the memory and executable on the processor, when executing the computer program, implementing the method of any of claims 1-9.

13. A computer program product, characterized in that the computer program product comprises a computer program/instructions which, when executed by a processor, implements the method according to any of claims 1-9.