WO2022188576A1

WO2022188576A1 - Performance issue locating method and apparatus, and electronic device and storage medium

Info

Publication number: WO2022188576A1
Application number: PCT/CN2022/074602
Authority: WO
Inventors: 徐磊
Original assignee: 北京字节跳动网络技术有限公司
Priority date: 2021-03-10
Filing date: 2022-01-28
Publication date: 2022-09-15
Also published as: CN112882857A

Abstract

Disclosed is a performance issue locating method. The method comprises: in response to a performance issue occurring in an application program, determining, according to a message scheduling time sequence diagram, scheduling information of a plurality of historical messages that have been scheduled when the performance issue occurs, wherein the message scheduling time sequence diagram is used for showing the scheduling information of the plurality of historical messages; and locating the performance issue according to the scheduling information of the plurality of historical messages that have been scheduled when the performance issue occurs. By means of the present method, the problem in the prior art of, when a performance issue, such as lagging, application not responding and an application program crash, occurs in an application program, it being difficult to acquire, from an operating system, key information that can be used to locate the issue is solved. Further disclosed are a performance issue locating apparatus, and an electronic device and a storage medium.

Description

Performance problem location method, device, electronic device and storage medium

priority information

This application claims the priority of the Chinese patent application number "202110261774.X" filed on March 10, 2021, and the application name is "Performance Problem Location Method, Device, Electronic Device and Storage Medium", the entire content of the application Incorporated herein by reference.

technical field

The present disclosure relates to the field of information technology, and in particular, to a method, apparatus, electronic device and storage medium for locating performance problems.

Background technique

With the development of information technology, electronic equipment has become an indispensable equipment in daily life. For example, a user may install various application (Application, APP) programs with different functions on the electronic device. Through applications with different functions, users can enjoy services with different functions.

However, the operating system of an electronic device often limits an application's ability to obtain system resources. Therefore, in the case of performance problems such as application freezes, application not responding (Application Not Responding, ANR), and application flashbacks, it is difficult to obtain key information from the operating system that can locate the problem, so that the problem cannot be located. the reason for the appearance. In order to locate the problem, it is necessary to reproduce the problem in some cases, but the reproduction process is time-consuming, and the application freezes for a long time, which affects the user's use.

SUMMARY OF THE INVENTION

In order to solve the above technical problem or at least partially solve the above technical problem, the embodiments of the present disclosure provide a performance problem location method, apparatus, electronic device, and storage medium.

An embodiment of the present disclosure provides a method for locating a performance problem, and the method includes:

In response to a performance problem occurring in the application, determine scheduling information of multiple historical messages that have been scheduled when the performance problem occurs according to a message scheduling sequence diagram, where the message scheduling sequence diagram is used to display the scheduling of the multiple historical messages information;

The performance problem is located according to scheduling information of a plurality of historical messages that have been scheduled when the performance problem occurs.

The embodiment of the present disclosure also provides a performance problem location device, including:

The response module is configured to, in response to a performance problem occurring in the application, determine scheduling information of multiple historical messages that have been scheduled when the performance problem occurs according to a message scheduling sequence diagram, and the message scheduling sequence diagram is used to display the multiple historical messages. scheduling information of a historical message;

A problem locating module, configured to locate the performance problem according to scheduling information of a plurality of historical messages that have been scheduled when the performance problem occurs.

Embodiments of the present disclosure also provide an electronic device, the electronic device comprising:

multiple processors;

a storage device for storing a plurality of programs;

When the multiple programs are executed by the multiple processors, the multiple processors implement the above-described method for locating performance problems.

Embodiments of the present disclosure also provide a computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, implements the above-described method for locating a performance problem.

Compared with the prior art, the technical solutions provided by the embodiments of the present disclosure have at least the following advantages:

In the performance problem location method provided by the embodiments of the present disclosure, in response to a performance problem occurring in an application program, scheduling information of a plurality of historical messages that have been scheduled when the performance problem occurs is determined according to a message scheduling sequence diagram, and the message scheduling sequence The graph is used to display the scheduling information of the multiple historical messages; according to the scheduling information of the multiple historical messages that have been scheduled when the performance problem occurs, the performance problem is located, which is essentially a process of running the application program. The scheduling information of each message generated in the system is recorded and stored to form a message scheduling sequence diagram. When a performance problem occurs in the application program, according to the message scheduling sequence diagram, the previous message scheduling situation at the time of the performance problem is traced back, and the traced result will be traced. Use it as key information for locating performance issues to determine the cause of performance issues. It can solve the problem in the prior art that it is difficult to obtain key information capable of locating the problem from the operating system when performance problems such as application program freeze, application unresponsiveness, and application program flashback occur in the prior art.

Description of drawings

The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent when taken in conjunction with the accompanying drawings and with reference to the following detailed description. 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 the originals and elements are not necessarily drawn to scale.

FIG. 1 is an application scenario diagram of a method for locating a performance problem provided by an embodiment of the present disclosure;

FIG. 2 is a flowchart of a method for locating a performance problem according to an embodiment of the present disclosure;

3 is a schematic diagram of a correspondence between a message and scheduling information according to an embodiment of the present disclosure;

FIG. 4 is a schematic diagram of a corresponding relationship between another message and scheduling information according to an embodiment of the present disclosure;

FIG. 5 is a schematic diagram of a corresponding relationship between another message and scheduling information according to an embodiment of the present disclosure;

FIG. 6 provides a message scheduling sequence diagram according to an embodiment of the present disclosure;

FIG. 7 is a schematic diagram of a method for locating a performance problem according to an embodiment of the present disclosure;

8 is a flowchart of a method for generating a message scheduling sequence diagram according to an embodiment of the present disclosure;

FIG. 9 is a flowchart of another method for generating a message scheduling sequence diagram according to an embodiment of the present disclosure;

10 is a schematic diagram of a counter update provided by an embodiment of the present disclosure;

11-12 are schematic diagrams of two other types of counter updates provided by the embodiments of the present disclosure;

13-14 are schematic diagrams of two other types of counter updates provided by the embodiments of the present disclosure;

FIG. 15 is a flowchart of a method for implementing S320 according to an embodiment of the present disclosure;

FIG. 16 is a flowchart of a method for implementing S330 according to an embodiment of the present disclosure;

FIG. 17 is a flowchart of another method for implementing S330 provided by an embodiment of the present disclosure;

18 is a flowchart of another method for locating performance problems in an embodiment of the present disclosure;

Figure 19 and Figure 20 are a kind of scheduling information display effect diagram formed by adopting the method provided in Figure 18;

21 is a schematic structural diagram of a device for locating performance problems according to an embodiment of the present disclosure;

FIG. 22 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure.

Detailed ways

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 should 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 the purpose of A more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes, and are not intended to limit the protection scope of the present disclosure.

It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and/or in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this regard.

As used herein, the term "including" and variations thereof are open-ended inclusions, ie, "including but not limited to". The term "based on" is "based at least in part on." Relevant definitions of other terms will be given in the description below.

It should be noted that concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or interdependence.

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

FIG. 1 is an application scenario diagram of a method for locating a performance problem provided by an embodiment of the present disclosure. The performance problem location method provided by the present disclosure can be applied to the application environment shown in FIG. 1 . Referring to FIG. 1 , the performance problem location system includes a server and multiple terminals (eg, terminal 1, terminal 2, terminal 3, and terminal 4). Each terminal and the server are connected through network communication. Several applications are installed on each terminal. Exemplarily, it is assumed that when a user uses a certain application in the terminal 1, the application has a performance problem. At this time, any terminal or a server can execute the performance problem locating method provided by the present disclosure. It should be emphasized that if the performance problem locating method provided by the present disclosure is executed by a terminal, in practice, the terminal having a performance problem and the terminal executing the performance problem locating method provided by the present disclosure may be the same terminal or different terminals.

The server can be implemented by an independent server or a server cluster composed of multiple servers. Terminals may include, but are not limited to, smart phones, palmtop computers, tablet computers, wearable devices with display screens, desktop computers, notebook computers, all-in-one computers, smart home devices, and the like.

FIG. 2 is a flowchart of a method for locating a performance problem provided by an embodiment of the present disclosure. The method may be executed by a performance problem locating apparatus, and the apparatus may be implemented in software and/or hardware, and the apparatus may be configured in an electronic device. , for example in a terminal or server. For ease of understanding, the method is described below by taking an example that the method is executed by a terminal having a performance problem.

As shown in Figure 2, the method may specifically include:

S110. In response to a performance problem occurring in the application, determine scheduling information of multiple historical messages that have been scheduled when the performance problem occurs according to a message scheduling sequence diagram, where the message scheduling sequence diagram is used to display the scheduling information of multiple historical messages.

Application programs may be installed in the terminal, and the number and functions of the application programs installed in the terminal are not specifically limited here. During the running of the application, the application may experience performance problems, such as freeze, ANR, crash, etc. Specifically, during the running process of the application, the terminal can detect in real time whether a performance problem occurs in the application.

The message scheduling sequence diagram is a graph that can visually display the scheduling information of each historical message during the running process of the application. In practice, there are various specific methods for generating the message scheduling sequence diagram, which are not limited in this application. Optionally, before a performance problem occurs in the application, the method further includes: acquiring a target message to be scheduled in a message queue corresponding to the application, where the target message is any historical message in a plurality of historical messages; During the process, the scheduling information of the target message is recorded; according to the scheduling information of the target message, a message scheduling sequence diagram is generated.

Specifically, during the running process of the application, the terminal may generate a message corresponding to the application, and put the message into the message queue corresponding to the application. This embodiment does not limit the specific conditions or specific scenarios for the terminal to generate the message. In addition, this embodiment does not limit the number of messages buffered in the message queue. For example, during the running process of the application, the terminal may display the user interface of the application, so that the user can perform operations on the user interface. Specifically, the terminal may generate a message corresponding to the application program according to the user's operation on the user interface, and put the message in a message queue corresponding to the application program. Further, the terminal may schedule the messages in the message queue in sequence, specifically, the main thread in the terminal may schedule the messages in the message queue in sequence.

In this embodiment, the terminal records the scheduling information of each message in the process of scheduling each message in the message queue. FIG. 3 is a schematic diagram of a correspondence between a message and scheduling information according to an embodiment of the present disclosure. In FIG. 3 , the message queue includes message 1 , message 2 , message 3 , message 4 , and message 5 . It can be understood that this embodiment does not limit the specific messages and the number of messages buffered in the message queue. In addition, the specific messages buffered in the message queue and the number of buffered messages may vary with time. For example, after the terminal completes the scheduling of the message 1 in the message queue, the terminal can delete the message 1 from the message queue, so that the specific message and the number of messages in the message queue are changed. Similarly, when the terminal generates a new message, such as message 6, the terminal can add the message 6 to the message queue, so that the specific message and the number of messages in the message queue change.

Continuing to refer to FIG. 3 , in the process of scheduling the message 1 in the message queue, the terminal may record the scheduling information of the message 1 . Further, the terminal may store the scheduling information of the message 1 in a storage space. The scheduling information of the message 1 may include, for example, at least one of the scheduling start time, the scheduling end time, and the scheduling time of the message 1 . It can be understood that the scheduling information of the message 1 may also include other information, for example, identification information of the message 1 and the like. The identification information may specifically be at least one of the type and name of the message.

Optionally, the schedule start time can be set to include CPU time and/or wall time (WALL). Among them, CPU time and wall time are two different dimensions of time. Wall time includes the waiting time of message scheduling and the execution time of message scheduling. Among them, there may be multiple waiting times. The CPU time includes the execution time of the message scheduling.

Similarly, the scheduled end time can be set to include CPU time and/or wall time (WALL).

Further, in the actual setting, the scheduling information and the message can be stored one-to-one, one-to-many, or a combination of one-to-one and one-to-many.

If one-to-one storage is adopted, the terminal can schedule each message in the message queue in turn, and the terminal can record the scheduling information of each message in turn. That is to say, when the terminal finishes scheduling a message, the terminal can record and store the scheduling information of the message in the storage space, so that each scheduled message can correspond to one scheduling information respectively. Exemplarily, in FIG. 3 , scheduling information and messages are stored one-to-one. Continuing to refer to FIG. 3 , the scheduling information corresponding to the

messages

1 , 2 , 3 , 4 , and 5 that have been scheduled are stored in the storage space. It can be understood that this embodiment does not limit the type of the storage space and the location of the storage space in the terminal.

If one-to-many storage is adopted, the terminal is not limited to storing the scheduling information of the message in the storage space when a message is scheduled. For example, the terminal may store the scheduling information of the multiple messages in the storage space when the multiple messages are scheduled. The scheduling information of the multiple messages may include the total number of the multiple messages, the total scheduling time of the multiple messages, and the like. It can be understood that the scheduling information of the multiple messages may also include other information, for example, the scheduling start time of the first scheduled message among the multiple messages, and the scheduling of the last scheduled message among the multiple messages. End time, identification information of the first scheduled message among the multiple messages, identification information of the last scheduled message among the multiple messages, and the like. FIG. 4 is a schematic diagram of another correspondence between messages and scheduling information according to an embodiment of the present disclosure. In Figure 4, scheduling information and messages are stored one-to-many. Referring to FIG. 4 , after scheduling the message 1 and the message 2, the terminal may store the scheduling information of the message 1 and the message 2 in the storage space to form a piece of scheduling information. The terminal may store the scheduling information of message 3, message 4 and message 5 in the storage space after scheduling message 3, message 4 and message 5 to form a piece of scheduling information.

FIG. 5 is a schematic diagram of another correspondence between messages and scheduling information according to an embodiment of the present disclosure. In FIG. 5 , the scheduling information and the message are stored in a combination of one-to-one storage and one-to-many storage. Referring to FIG. 5 , the terminal may store the scheduling information of the message 1 in the storage space after scheduling the message 1 to form a piece of scheduling information. After scheduling the message 2 and the message 3, the terminal may store the scheduling information of the message 2 and the message 3 in the storage space to form a piece of scheduling information. Similarly, the terminal may store the scheduling information of message 4 and message 5 in the storage space after scheduling message 4 and message 5 to form a piece of scheduling information.

In practice, during the running of the application, the message scheduling is extremely frequent, and in most cases, the time-consuming is in the order of milliseconds or even microseconds. By adopting one-to-many storage of scheduling information and messages, or by adopting a combination of one-to-one storage and one-to-many storage for storage, it is possible to improve statistical efficiency, storage efficiency, reduce storage space occupancy rate, and reduce the amount of data collected from storage space. The amount of operations to read and write can even reduce the chance of memory jitter caused by a large number of memory application and release, causing performance problems.

It should be emphasized that, in the present disclosure, the storage space of scheduling information and the message queue are two different storage spaces. When the message is dispatched, the message can be deleted from the message queue. However, the scheduling information of the message needs to be stored in the storage space of the scheduling information and is not deleted.

The above-mentioned "generating a message scheduling sequence diagram according to the scheduling information of the target message" is essentially to generate a message scheduling sequence diagram according to the scheduling information stored in the scheduling information storage space.

FIG. 6 is a message scheduling sequence diagram provided by an embodiment of the present disclosure. Illustratively, referring to FIG. 6 , in FIG. 6 , arrows indicate a time axis, and the time axis includes a plurality of rectangular boxes arranged in sequence. Each box represents a piece of scheduling information. The boxes can be divided into three types according to the filling graph: the first type is the filling point of the boxes 1-53, which is the first identifier, indicating the scheduling information of the message that has been scheduled when the application has a performance problem; the second type is the filling point. The box with type unfilled is the second identifier, indicating the scheduling information of the message being scheduled when the application has performance problems; the third type is the box 1-3 filled with slashes, which is the third identifier, indicating the application Messages that have not yet started scheduling when the program has performance problems.

In this step, the scheduling information of the historical messages that have been scheduled when the performance problem occurs, includes the scheduling information of the messages that have been scheduled when the performance problem occurs in the application program, and the scheduling information of the message that is being scheduled when the performance problem occurs in the application program. . Therefore, referring to FIG. 6 , when this step is performed, the scheduling information to be determined is the scheduling information corresponding to the first identifier and the second identifier.

Optionally, in FIG. 6 , each of the first identifiers and each of the second identifiers displays the detailed content of the scheduling information by means of a display frame (an oval image in the figure). Wherein, MSG represents a message corresponding to the scheduling information. For example, in the display box corresponding to box 1 filled with dots, "MSG 1" indicates that the scheduling information corresponds to 1 message. In the display box corresponding to the box 7 filled with dots, "MSGS 33" indicates that the scheduling information corresponds to 33 messages, which is the combined result of the 33 messages. Wall in the display box indicates the total wall time scheduling time of all messages corresponding to the scheduling information. The CPU in the display box indicates the total CPU time of all messages corresponding to the scheduling information. In the display box corresponding to box 5 filled with dots, "IDLE" means system sleep.

Optionally, continuing to refer to FIG. 6 , the scheduling information corresponding to the messages whose scheduling takes a long time may be further displayed with special effects. For example, the scheduling of the first message corresponding to box 1 takes a very long time. Therefore, the display box corresponding to box 1 is filled with vertical stripes to distinguish it from other display boxes. This setting is convenient for quickly determining which messages are scheduled to take a long time, further shortening the time for locating performance problems, and improving work efficiency.

Based on the above technical solution, optionally, the size of the first identifier is related to scheduling information of historical messages corresponding to the first identifier; the size of the second identifier is related to scheduling information of historical messages corresponding to the second identifier. Exemplarily, in FIG. 6 , the length of the first identifier in the direction of the arrow is positively correlated with the scheduling time of the historical message corresponding to the first identifier. This setting can further quickly determine which messages take a long time to schedule, further shorten the time for locating performance problems, and improve work efficiency.

It should be noted that, in FIG. 6 , the message scheduling sequence diagram includes unscheduled messages (corresponding to the third identifier) when a performance problem occurs in the application program. This is only a specific example of the present application, rather than a limitation of the present application. In practice, the message scheduling sequence diagram can be set to include only the scheduling information (corresponding to the first identifier) of the message that has been scheduled when the application program has a performance problem, and the scheduling information (corresponding to the second identifier) of the message being scheduled, Does not include unscheduled messages.

There are various specific implementation manners of this step. Exemplarily, in response to a performance problem that occurs in the application, determine the type of performance problem that occurs in the application; Scheduling information for multiple historical messages scheduled. This setting is convenient to reduce the amount of scheduling information to be viewed, to quickly find the scheduling information that needs to be focused on, and to improve positioning efficiency.

Alternatively, the specific implementation of this step may also be, in response to a performance problem occurring in the application program, according to the message scheduling sequence diagram, it is determined from the moment when the performance problem occurs in the application program, a number of historical records that have been scheduled within a preset retrospective time range are determined. Scheduling information for the message. The preset retrospective duration can be determined according to the experience of the research and development personnel, which is not limited in this disclosure. This setting is convenient to reduce the amount of scheduling information to be viewed, to quickly find the scheduling information that needs to be focused on, and to improve positioning efficiency.

Optionally, different types of performance problems can be set, and the preset retrospective durations are different. Before executing "Determining the scheduling information of multiple historical messages that have been scheduled within a preset retrospective time range from the moment when the application program has a performance problem according to the message scheduling sequence diagram", it also includes: determining the performance problem of the application program. Type; determine the preset traceback duration based on the type of performance issue.

S120. Locate the performance problem according to scheduling information of multiple historical messages that have been scheduled when the performance problem occurs.

FIG. 7 is a schematic diagram of a method for locating a performance problem provided by an embodiment of the present disclosure. In FIG. 7 , a horizontal arrow represents a time axis, and a plurality of rectangles filled with diagonal lines are drawn above the time axis, and one rectangle represents one message. The intersection of the left edge of each rectangle with the timeline represents the scheduled start time of the message. The intersection of the right edge of each rectangle and the time axis indicates the scheduled end time of the message. Exemplarily, the scheduling start time of message 1 is a, and the scheduling end time is b. As shown in Figure 7, message 1, message 2, message 3, and message 4 have been scheduled and completed before the moment when the application has a performance problem. Message 5 is the message being dispatched at the moment when the performance problem occurs.

In general, the reason for the performance problem of the terminal may be caused by a problem in the process of message scheduling that has been scheduled; it may also be caused by a problem in the process of message scheduling being scheduled; The problem in the process of message scheduling that is scheduled to be completed is caused by the combined effect of the problem in the process of message scheduling being scheduled.

Exemplarily, since in the terminal, multiple messages in the message queue are scheduled in sequence, for example, the terminal schedules information A, then schedules information B, reschedules information C, and reschedules information D. Wherein, when the terminal schedules the information B or the information C, the message B or the message C may have been time-consuming, but it does not cause problems such as freezing and ANR. Problems such as freezing and ANR may not occur until the terminal schedules message D, and message D may not be time-consuming. In this case, it is a problem in the scheduling process of the message B and the message C that causes the performance problem of the terminal.

There are various specific implementation methods for this step. Optionally, the steps include: determining the historical messages whose scheduling time is greater than or equal to a preset duration among the multiple historical messages; historical information to locate performance problems. Studies have shown that message scheduling takes a long time, which is often a symptom of performance problems. This setting is convenient for reducing the amount of scheduling information that needs to be viewed, enabling R&D personnel to quickly find the scheduling information that needs to be focused on, and improving positioning efficiency.

In the method for locating performance problems provided by the embodiments of the present disclosure, the scheduling information of multiple historical messages that have been scheduled when the performance problem occurs is determined according to a message scheduling sequence diagram in response to a performance problem occurring in an application, and the message scheduling sequence diagram is used to display Scheduling information of multiple historical messages; locate the performance problem according to the scheduling information of multiple historical messages that have been scheduled when the performance problem occurs. The essence is to record the scheduling information of each message generated during the running of the application. Store and form a message scheduling sequence diagram. When a performance problem occurs in the application program, according to the message scheduling sequence diagram, trace the previous message scheduling situation when the performance problem occurred, and use the traceback result as the key information for locating the performance problem. to determine the cause of the performance issue. It can solve the problem in the prior art that it is difficult to obtain key information capable of locating the problem from the operating system when performance problems such as application program freeze, application unresponsiveness, and application program flashback occur in the prior art.

FIG. 8 is a flowchart of a method for generating a message scheduling sequence diagram according to an embodiment of the present disclosure. FIG. 8 corresponds to the situation of “one-to-one storage of scheduling information and messages” in the foregoing content. The steps in FIG. 8 are executed before S110 in FIG. 2 , that is, before the terminal detects whether the application program has a performance problem. Referring to FIG. 8 , the method for implementing recording scheduling information includes:

S210: Acquire a target message to be scheduled in a message queue corresponding to the application, where the target message is any historical message among multiple historical messages.

The target message to be scheduled can be understood as an unscheduled message generated by the terminal according to the operation after the user operates the user interface of the terminal application program. The message may include user instructions and/or non-user instructions. Among them, user instructions and non-user instructions may be associated.

It should be noted that, in combination with the above content, those skilled in the art can understand that in this step, the target message may be the message that has been scheduled when the application has a performance problem, or it may be the message that is being dispatched when the application has a performance problem. Scheduled message. However, in practice, since there is no performance problem in the application program when this step is performed, it is actually impossible to distinguish whether the current target message is the message that has been scheduled or the message that is being scheduled when the performance problem occurs in the application program.

S220. When starting to schedule the target message, record the scheduling start time of the target message.

S230. When the scheduling of the target message is ended, record the scheduling end time of the target message.

In practice, when the target message is the message being scheduled when the application program has performance problems (eg, the target message is message 5 in FIG. 7 ), because the application program has performance problems before the message scheduling is completed. In view of this situation, optionally, it may be set to wait for the end of the target message scheduling, and record the end time of the target message scheduling. Or, optionally, when the performance problem occurs, the terminal takes the time when the performance problem occurs as the scheduling end time of the target message. The reason for this setting is that once the terminal has a performance problem, the second message scheduling operation will be suspended, and there is no scheduling end time.

S240. Determine the scheduling time of the target message according to the scheduling start time of the target message and the scheduling end time of the target message.

Optionally, a difference is made between the scheduling end time of the target message and the scheduling start time of the target message, and the difference is used as the scheduling time of the target message.

S250. Record scheduling information of the target message, where the scheduling information includes at least one of a scheduling start time, a scheduling end time, and a scheduling time-consuming.

S260. Generate a message scheduling sequence diagram according to the scheduling information of the target message.

The essence of this setting is that for each target message, the corresponding scheduling information is generated, and the target message and the scheduling information are stored one-to-one, which can ensure that the scheduling information corresponding to each target message is complete, without omission, and can be checked. .

FIG. 9 is a flowchart of another method for generating a message scheduling sequence diagram according to an embodiment of the present disclosure. FIG. 9 corresponds to the situation of “one-to-many storage of scheduling information and messages” in the foregoing content.

The overall inventive concept of realizing "one-to-many storage of scheduling information and messages" is to combine multiple messages whose scheduling time is very short, and count the total time-consuming of multiple messages whose scheduling time is very short. In this case, a piece of scheduling information may only include the identification information of part of the messages, the total time spent, and the number of messages to be merged.

There are many ways to achieve "one-to-many storage of scheduling information and messages". For example, the reference time can be preset; when scheduling the Nth target message, record the scheduling start time and scheduling end time of the Nth target message; According to the scheduling start time and scheduling end time of the Nth target message, determine the scheduling time of the Nth target message. If the scheduling time of the Nth target message is greater than the reference time, the scheduling information of the Nth target message Make separate records. If the scheduling time of the N-th target message is less than or equal to the reference time-consuming, schedule the N+1-th target message, and determine the scheduling time of the N+1-th target message. If the scheduling time of the N+1 th target message is greater than the reference time, the scheduling information of the N th target message and the scheduling information of the N+1 th target message are separately recorded. If the scheduling time of the N+1-th target message is less than or equal to the reference time-consuming, schedule the N+2-th target message, ... until the scheduling time of the N+n-th target message is greater than the reference time-consuming, the For N target messages, the scheduling information of the N+n-1th target message is merged and recorded. Exemplarily, if the scheduling information of the Nth target message to the N+n-1th target message is combined and recorded, the scheduling information at this time includes the scheduling start time of the Nth target message, the N+n-1th target message. The scheduling end time of the message, the total scheduling time from the scheduling of the Nth target message to the end of the N+n-1th target message, and the Nth target message to the N+n-1th target The identification information of the target message of several parts in the message.

Fig. 9 is another method for realizing "one-to-many storage of scheduling information and messages". This method needs to be done with the help of a counter. To this end, optionally, it is set that the sub-thread is used to control the counter to be updated at a set time interval, and the main thread only reads the counter readings respectively at the start time and the end time of scheduling the target message.

Optionally, SetTimeout is used to set the sleep time of the child thread, and make the sleep time of the child thread equal to the time interval between two consecutive updates of the counter. Exemplarily, if the counter is expected to be updated every 30s, the sleep time of the child thread is set to 30s. When the sub-thread is in the dormant state, the counter is not updated. If the sub-thread is dormant, the sub-thread will use Update Tick to update the counter immediately after the sub-thread is woken up. After the child thread updates the counter, it goes to sleep again.

Further, Timeout Verify can be used to correct the sleep time of the child thread. Exemplarily, if preset, the sleep time of the child thread is 5 minutes. The child thread should wake up at 10:00 and 10:05 respectively and update the counter. But in practice, for some reasons, the child thread may be woken up at 10:01. Obviously, this will delay the update time of the counter. To this end, optionally, after the child thread is woken up at 10:01, the sleep time of the child thread is modified so that it becomes 4 minutes. This ensures that at 10:05, the child thread can be woken up. This setting can ensure the accuracy of the scheduling information recorded subsequently.

Since the main thread only reads the counter readings at the start and end moments of scheduling the target message. For this, the concept of monitoring period is set up. The monitoring period specifically refers to the time period during which the main thread reads and updates the counter for two consecutive times.

It should be noted here that, in the present disclosure, the monitoring period is not necessarily equal to the time interval between two actual updates of the counter. Exemplarily, FIG. 10 is a schematic diagram of a counter update provided by an embodiment of the present disclosure. Referring to Figure 10, the counter is updated 4 times in total. Since the main thread only reads the counter information at the start time and end time of scheduling the target message, the information "counter reading is 0" is the start time of the main thread's scheduling of message 1 read. The information "counter reading is 1" is read by the main thread at the end of message 1 scheduling. Therefore, the time period between the start time and the end time of the message 1 scheduling is taken as the monitoring period J1. The message "counter reads 2" is not read by the main thread. The information "counter reading is 3" is read by the main thread at the beginning of message 2 scheduling. Therefore, the time period between the end time of message 1 scheduling and the start time of message 2 scheduling is taken as the monitoring period J2. In FIG. 10 , the monitoring period J1 is smaller than the time interval T ₀ between two adjacent updates. The monitoring period J2 is greater than the time interval T ₀ between two adjacent updates.

The steps in FIG. 9 are executed before S110 in FIG. 2 , that is, before the terminal detects whether the application program has a performance problem. Referring to FIG. 9, the method for generating a message scheduling sequence diagram includes:

S310: Acquire a target message to be scheduled in a message queue corresponding to the application, where the target message is any historical message among multiple historical messages.

S320. When starting to schedule the target message, record the scheduling information of the multiple historical messages that have been scheduled in the first monitoring period before starting the scheduling, and the multiple historical messages that have been scheduled in the first monitoring period are the messages before the target message .

The first monitoring period corresponds to a time period from when the terminal starts to schedule the target message and detects that the counter is updated to the last time that the terminal detects that the counter is updated. 11-12 are schematic diagrams of other two types of counter updates provided by the embodiments of the present disclosure. In practice, the first monitoring period mainly corresponds to two situations: Case 1, referring to Figure 11, the target message is message 5, and the first monitoring period is from the start time of a historical message scheduling to the start time of the target message scheduling Time period; Case 2, see FIG. 12 , the time period from the end moment of a historical message scheduling to the start moment of the target message scheduling. No matter which of the two cases, "a plurality of historical messages that have been scheduled during the first monitoring period" refers to the historical messages of the entire scheduling process during the first monitoring period. Exemplarily, in FIG. 11 and FIG. 12 , message 2, message 3 and message 4 are all multiple historical messages that have been scheduled within the first monitoring period. According to this step, the scheduling information of message 2, message 3 and message 4 needs to be recorded.

S330. When ending the scheduling of the target message, record the scheduling information of the multiple historical messages that have been scheduled within the second monitoring period before ending the scheduling, and the multiple historical messages that have been scheduled within the second monitoring period include the target message.

The second monitoring period corresponds to a time period from when the terminal finishes scheduling the target message and detects that the counter is updated to the last time that the terminal detects that the counter is updated. FIGS. 13-14 are schematic diagrams of other two types of counter updates provided by embodiments of the present disclosure. In practice, the second monitoring period mainly corresponds to two cases: Case 1, see Figure 13, the time period from the start time of a historical message scheduling to the end time of the target message scheduling; Case 2, see Figure 14, from The time period between the end time of a historical message schedule and the end time of the target message schedule. No matter which of the two cases, "historical messages that have been scheduled during the second monitoring period" refer to the historical messages that complete the entire process of scheduling within the second monitoring period. Exemplarily, in FIG. 13 and FIG. 14 , message 2, message 3, message 4 and message 5 are all historical messages that have been scheduled within the second monitoring period. Since in FIG. 13 and FIG. 14 , the target message is message 5, it is obvious that the multiple historical messages that have been scheduled in the second monitoring period include the target message. According to this step, the scheduling information of message 2, message 3, message 4 and message 5 needs to be recorded.

S340. Generate a message scheduling sequence diagram according to the scheduling information of the target message.

The essence of this setting is to classify the monitoring period (divided into the first monitoring period and the second monitoring period) according to the characteristics of the monitoring period, and adopt different strategies for different monitoring periods to merge the scheduling information of multiple historical messages Record. It can improve statistical efficiency, storage efficiency, reduce storage space occupancy, reduce the amount of operations to read and write from storage space, and even reduce the chance of performance problems caused by memory jitter caused by a large number of memory applications and releases.

It should be noted that, in the above technical solution, the relationship between S320 and S330 is and/or.

In the above technical solutions, there are various specific implementation methods of S320, which are not limited in the present disclosure. FIG. 15 is a flowchart of a method for implementing S320 according to an embodiment of the present disclosure. Referring to Fig. 15, the method for implementing S320 may be:

S321. When starting to schedule the target message, check whether the counter is updated; if not, execute S322; if yes, execute S323.

S322. Perform scheduling processing on the target message.

S323. Record the scheduling information of multiple historical messages that have been scheduled within the first monitoring period before starting scheduling; wherein, the first monitoring period corresponds to the time from when the target message is scheduled to be updated when the counter is detected to be updated to the last time when the counter is detected. Between updates; the scheduling information of the multiple historical messages includes the total number of the multiple historical messages and the total scheduling time of the multiple historical messages.

There are various specific implementation methods for this step. Exemplarily, when it is determined that the number of updates of the counter in the first monitoring period is less than or equal to 2, the scheduling information of multiple historical messages that have been scheduled in the first monitoring period is recorded; When it is determined that the counter is updated more than twice during the first monitoring period, the scheduling information of multiple historical messages that have been scheduled within the first monitoring period is recorded, and the sleep time of the system during the first monitoring period is recorded.

Typically, referring to FIG. 11 or FIG. 12 , assuming that the target message is message 4, when the terminal starts scheduling information 4, it detects whether the counter is updated relative to the time at which the scheduling of message 3 ends. Since the counter has not been updated relative to the scheduling end time of message 3, the main thread schedules message 4.

Continue to refer to FIG. 11 or FIG. 12 , assuming that the target message is message 5, when the terminal starts scheduling information 5, it detects whether the counter is updated relative to the time at which the scheduling of message 4 ends. Since the counter is updated relative to the scheduling end time of message 4, it is determined that the first monitoring period ends this time. The terminal records the scheduling information of all historical messages (ie, message 2, message 3, and message 4) that have been scheduled within the first monitoring period of this time.

When "recording the scheduling information of all historical messages that have been scheduled during the first monitoring period (ie, message 2, message 3, and message 4 in Fig. 11 and Fig. 12 )" is executed, it can be further judged that relative to the first monitoring period Whether the number of updates of the counter at the end of the first monitoring period (that is, the start time of message 5 scheduling in Figure 11 or Figure 12) is greater than 2 times. The specific judgment method can be as follows: using the reading of the counter at the end of the first monitoring period to subtract the reading of the counter at the beginning of the first monitoring period, to judge whether the difference is greater than 2, if it is greater than 2, it means that the number of updates of the counter is greater than 2, Otherwise, the counter is updated less than or equal to 2 times.

Continue to refer to Figure 11 or Figure 12, since the main thread has read the scheduling start time of message 2, the scheduling start time of message 3, the scheduling end time of message 3, the scheduling start time of message 4, and the scheduling end time of message 4 Counter readings, no counter updates were found. Therefore, if it is found that the counter is updated at the scheduling start time of message 5, it means that the counter is updated in the time period between the scheduling end time of message 4 and the scheduling start time of message 5. And the sum of the scheduling time of message 2, message 3 and message 4 is less than the time interval T ₀ between two adjacent updates.

On this basis, continue to refer to Figure 11, if the main thread has read the reading of the counter at the beginning of the scheduling of message 5, and finds that the number of updates of the counter is 1, and the condition that the number of updates of the counter is less than or equal to 2 is satisfied, In this case, it is considered that the system does not sleep during the period from the scheduling end time of message 4 to the scheduling start time of message 5 . In this case, optionally, only the scheduling information of message 2, message 3 and message 4 is combined and recorded.

Continue to refer to Figure 12, if the main thread has read the reading of the counter at the beginning of the scheduling of message 5, and finds that the number of updates of the counter is 3 times, and the condition that the number of updates of the counter is greater than 2 times is satisfied, then the scheduling of message 4 ends. The time length from the moment to the scheduling start moment of the message 5 is greater than 2T ₀ . This shows that, during this period of time, there is a situation in which the system sleeps. In this case, optionally, the scheduling information of message 2, message 3 and message 4 is combined and recorded, and the sleep time of the system in the first monitoring period is recorded.

The above solution can capture the sleep time of the system, which can avoid inaccurate recording of scheduling information of each message due to system sleep, thereby leading to inaccurate positioning of subsequent performance problems.

Similarly, in the above technical solution, there are various specific implementation methods of S330, which are not limited in the present disclosure. FIG. 16 is a flowchart of a method for implementing S330 according to an embodiment of the present disclosure. Referring to FIG. 16, the method for implementing S330 may be:

S3311. When the scheduling target message ends, check whether the counter is updated; if not, execute S3312; if yes, execute S3313.

S3312. Obtain the next message of the target message from the message queue.

S3313. Record the scheduling information of the multiple historical messages that have been scheduled within the second monitoring period before ending the scheduling; wherein, the second monitoring period corresponds to the time from the detection of the occurrence of the counter at the end of the scheduling target message to the detection of the occurrence of the counter last time Between updates; the scheduling information of the multiple historical messages includes the total number of the multiple historical messages and the total scheduling time of the multiple historical messages.

There are various specific implementation methods for this step. Exemplarily, when it is determined that the number of updates of the counter in the second monitoring period is less than or equal to 2, the scheduling information of multiple historical messages that have been scheduled in the second monitoring period is recorded; When it is determined that the counter is updated more than 2 times in the second monitoring period, the scheduling information of the target message and the scheduling information of the historical messages other than the target message that have been scheduled in the second monitoring period are recorded.

Typically, referring to FIG. 13 or FIG. 14 , assuming that the target message is message 4, when scheduling information 4 is ended, it is detected whether the counter is updated relative to the scheduling start time of message 4. Since the counter is not updated relative to the scheduling start time of message 4, the main thread obtains the next message (ie, message 5) of the target message from the message queue.

Continuing to refer to FIG. 13 or FIG. 14 , assuming that the target message is message 5, when scheduling information 5 is ended, it is detected whether the counter is updated relative to the scheduling start time of message 5. Since the counter is updated relative to the scheduling start time of message 5, it is determined that the second monitoring period ends this time. The terminal records the scheduling information of all historical messages (ie, message 2, message 3, message 4, and message 5) that have been scheduled within the second monitoring period.

Specifically, when "recording the scheduling information of all historical messages that have been scheduled in this second monitoring period (ie, message 2, message 3, message 4, and message 5 in Fig. 13 and Fig. 14 )", we can further Judgment is relative to the start time of the second monitoring period (that is, the start time of message 2 scheduling in Figure 13, or the end time of message 1 scheduling in Figure 14), the end time of the second monitoring period (that is, the end time of message 5 scheduling in Figure 13 or Figure 14) Whether the counter is updated more than 2 times. The specific judgment method may be as follows: using the reading of the counter at the end of the second monitoring period to subtract the reading of the counter at the beginning of the second monitoring period to determine whether the difference is greater than 2, if it is greater than 2, it means that the number of updates of the counter is greater than 2. Otherwise, the counter is updated less than or equal to 2 times.

Continue to refer to FIG. 13 or FIG. 14, since the main thread is at the scheduling end time of message 2, the scheduling start time of message 3, and the scheduling end time of message 3, the scheduling start time of message 4, the scheduling end time of message 4, and the scheduling end time of message 5 The readings of the counters have been read at the beginning of the scheduling, and no counter updates have been found. Therefore, if the counter is found to be updated at the scheduling end time of message 5, it means that the counter is updated in the time period between the scheduling start time of message 5 and the scheduling end time of message 5. And the sum of the scheduling time of message 2, message 3 and message 4 is smaller than the time interval T ₀ between two adjacent updates.

On this basis, continue to refer to Figure 13, if the main thread has read the reading of the counter at the end of the scheduling of message 5, and finds that the number of updates of the counter is 1, which satisfies the condition that the number of updates of the counter is less than or equal to 2, In this case, it is considered that the scheduling from message 5 does not take long. Optionally, only the scheduling information of message 2, message 3, message 4, and message 5 is combined and recorded.

Continue to refer to Figure 14, if the main thread has read the reading of the counter at the end of the scheduling of message 5, and finds that the number of updates of the counter is 3 times, which satisfies the condition that the number of updates of the counter is greater than 2, then the scheduling of message 5 takes time. greater than 2T ₀ . In this case, optionally, the scheduling information of message 2, message 3, and message 4 is combined and recorded, and the scheduling information of message 4 is recorded separately.

In practice, performance problems are often caused by problems in scheduling messages that take a long time. The above solution can capture messages that take a long time to schedule, and record their scheduling information separately, which can ensure that when locating performance problems later, the scheduling information of messages that take a long time to schedule can be highlighted and the location time can be shortened.

FIG. 17 is a flowchart of another method for implementing S330 according to an embodiment of the present disclosure. FIG. 17 is a specific example of FIG. 16 . Referring to Figure 17, the method for implementing S330 may be:

S3321. When the target message is scheduled to end, check whether the message type of the target message is a preset type; if so, execute S3322; if not, execute S3323.

S3322. Record the scheduling information of the target message.

Here, the preset type includes at least one of the following: Activity, Service, Receiver, and Provider. Among them, Activity is used to display the UI and user interaction interface, such as opening the various interfaces displayed by the application. Service, a component used to satisfy and support background work, such as playing music in the background. Receiver: A component used to monitor system behavior changes, such as mobile phone on and off screen, network switching and other state changes. Provider: A component used to provide data management within an application or other applications, such as address book management.

The essence of this step is to record the scheduling information of a special type of target message separately. In practice, different types of target messages have different chances of causing performance problems in an application. Research has shown that there are certain special types of targeted messages that have a high chance of causing performance problems in applications. The scheduling information for special types of target messages is recorded separately by setting. This can ensure that the scheduling information of special types of target messages can be highlighted when locating performance problems later, shortening the locating time.

S3323: Detect whether the counter is updated, if not, execute S3324; if yes, execute S3325.

S3324. Obtain the next message of the target message from the message queue.

S3325. Record the scheduling information of the multiple historical messages that have been scheduled in the second monitoring period before ending the scheduling; wherein, the second monitoring period corresponds to the time from the time when the scheduling target message is ended that the counter is updated to the last time that the counter is detected. Between updates; the scheduling information of the multiple historical messages includes the total number of the multiple historical messages and the total scheduling time of the multiple historical messages.

The essence of the above technical solution is that when the terminal finishes scheduling the target message, it firstly detects whether the target message is a special type of target message. If so, the scheduling information of the special type of target message is recorded separately. In practice, different types of target messages have different chances of causing performance problems in an application. Research has shown that there are certain types of targeted messages that have a very high chance of causing performance problems in applications. The scheduling information for special types of target messages is recorded separately by setting. This can ensure that the scheduling information of special types of target messages can be highlighted when locating performance problems later, shortening the locating time.

It should be emphasized that, during the execution of the above-mentioned methods for completing the one-to-many storage of scheduling information and messages by means of a counter, the CPU time and/or the wall time (WALL) may not be read at all. At this time, the essence is The scheduling time of the first information is compared with the time interval T ₀ between two adjacent updates, and based on the comparison result, the scheduling time in each scheduling information is determined.

Optionally, it can also be set in the process of executing the above-mentioned methods for completing the one-to-many storage of scheduling information and messages by means of a counter, after each detection of an update of the counter, reading the CPU time and/or the wall time (WALL time). ), and based on the read CPU time and/or wall time (WALL) and the time interval T ₀ between two adjacent updates, jointly determine the scheduling time in each scheduling information. In this way, the scheduling time-consuming determination in the scheduling information is more accurate, which is helpful for accurately locating the performance problem in the future.

FIG. 18 is a flowchart of another method for locating a performance problem in an embodiment of the present disclosure. FIG. 19 and FIG. 20 are effect diagrams for displaying scheduling information formed by using the method provided in FIG. 18 . Referring to FIG. 18 to FIG. 20 , on the basis of the above-mentioned embodiment, the method further includes:

S510. Display a message scheduling sequence diagram, where the message scheduling sequence diagram includes multiple first identifiers and second identifiers, the first identifier is used to identify scheduling information of multiple historical messages that have been scheduled when the performance problem occurs, and the second identifier is used for Scheduling information to identify historical messages that were being scheduled when performance issues occurred.

S520. Display scheduling information of historical messages corresponding to the first identifier according to the first operation of the user on the first identifier.

S530. Display scheduling information of historical messages corresponding to the second identifier according to the second operation performed by the user on the second identifier.

On the basis of this embodiment, the method also includes:

Displays the third identifier corresponding to the historical message that was not scheduled when the performance problem occurred.

Continuing to refer to FIG. 19 , in FIG. 19 , the arrows indicate a time axis including a plurality of sequentially arranged rectangular boxes. The boxes can be divided into three types according to the filling graph: the first type is the filling point of the boxes 1-53, which are the first identification, indicating the scheduling information of the historical messages that have been scheduled when the performance problem occurs; the second type The unfilled box is the second mark, indicating the scheduling information of the historical message being scheduled when the performance problem occurs; the third type is the box 1-3 filled with slashes, which is the third mark, indicating when the performance problem occurs Scheduling information for unscheduled historical messages. When the user wants to know the scheduling information of the first message corresponding to the block 11 in the first identifier, the user performs the first operation on the block 11 . The first operation may specifically be clicking, sliding, or the like. Continuing to refer to FIG. 20 , a display box corresponding to block 11 appears in the display interface. The display box displays the details of the scheduling information. Since the third identifier represents scheduling information of historical messages that were not scheduled when the performance problem occurred, when the user operates the third identifier, a display frame corresponding to the third identifier appears in the display interface. The content of the display box is empty, or it indicates that there is no scheduling information.

This setting is especially suitable for situations where the size of the user display interface is limited, and all scheduling information cannot be fully displayed at the same time.

It should be noted that, in FIG. 18-FIG. 20, the display method of the scheduling information is given. One reason why the scheduling information needs to be displayed is that although the terminal can complete the performance problem location by itself, in some scenarios, users or R&D personnel also want to know the scheduling situation of historical messages before and after the performance problem occurs.

In addition, if a terminal with a performance problem and a terminal executing the method for locating a performance problem provided by the present disclosure are different terminals. Assuming that the first terminal is a terminal with a performance problem, and the second terminal is a terminal that executes the performance problem location method provided by the present disclosure, the method further includes: the first terminal sends a message scheduling sequence diagram in response to the performance problem occurring in the application program to the second terminal. The second terminal determines the scheduling information of the multiple historical messages that have been scheduled when the performance problem occurs according to the message scheduling sequence diagram; and locates the performance problem according to the scheduling information of the multiple historical messages that have been scheduled when the performance problem occurs.

The reason for this setting is that, in practice, there may be a performance problem in the first terminal. However, other personnel who cannot access the first terminal want to know the reasons for the performance problems of the first terminal. At this time, the above solution can be adopted to make the personnel unable to access the first terminal but holding the second device to obtain the performance of the first terminal. Scheduling information before and after the problem, and locating performance problems.

FIG. 20 is a schematic structural diagram of a device for locating performance problems in an embodiment of the present disclosure. The device for locating a performance problem provided by the embodiment of the present disclosure may be configured in a terminal, or may be configured in a server. Referring to Figure 20, the performance problem locating device specifically includes:

The response module 610 is configured to, in response to a performance problem occurring in the application, determine the scheduling information of multiple historical messages that have been scheduled when the performance problem occurs according to the message scheduling sequence diagram, and the message scheduling sequence diagram is used to display the scheduling of multiple historical messages information;

The problem locating module 620 is configured to locate the performance problem according to the scheduling information of a plurality of historical messages that have been scheduled when the performance problem occurs.

Further, the problem location module 620 is specifically used for:

Determine the historical messages whose scheduling time is greater than or equal to the preset duration among the plurality of historical messages;

The performance problem is located according to the historical messages whose scheduling time is greater than or equal to a preset time length among the plurality of historical messages.

Further, the method further includes a message scheduling sequence diagram generation module, the message scheduling sequence diagram generation module includes a target message acquisition unit, a scheduling information recording unit, and a message scheduling sequence diagram generation unit;

Wherein, the target message acquisition unit is used to acquire the target message to be scheduled in the message queue corresponding to the application program before a performance problem occurs in the application program, and the target message is any one of the multiple historical messages historical news;

a scheduling information recording unit, configured to record the scheduling information of the target message in the process of scheduling the target message;

A message scheduling sequence diagram generating unit, configured to generate the message scheduling sequence diagram according to the scheduling information of the target message.

Further, the scheduling information recording unit is specifically used for:

When starting to schedule the target message, record the scheduling start time of the target message;

When finishing scheduling the target message, record the scheduling end time of the target message;

According to the scheduling start time of the target message and the scheduling end time of the target message, determine the scheduling time-consuming of the target message;

Scheduling information of the target message is recorded, where the scheduling information includes at least one of the scheduling start time, the scheduling end time, and the scheduling time-consuming.

Further, the scheduling information recording unit includes a first monitoring period scheduling information recording subunit and/or a second monitoring period scheduling information recording subunit;

The first monitoring period scheduling information recording subunit is configured to, when starting to schedule the target message, record the scheduling information of a plurality of historical messages that have been scheduled within the first monitoring period before the start of scheduling, the first monitoring A plurality of historical messages that have been scheduled within the period are messages before the target message;

The second monitoring period scheduling information recording subunit is configured to record the scheduling information of multiple historical messages that have been scheduled in the second monitoring period before the end of the scheduling when the target message is scheduled, and the second monitoring A number of historical messages that have been scheduled within a period include the target message.

Further, the first monitoring period scheduling information recording subunit is specifically used for:

When starting to schedule the target message, detecting whether the counter is updated;

If it is detected that the counter has not been updated when starting to schedule the target message, perform scheduling processing on the target message;

If it is detected that the counter is updated when starting to schedule the target message, recording the scheduling information of multiple historical messages that have been scheduled within the first monitoring period before starting the scheduling;

Wherein, the first monitoring period corresponds to the period from when the target message is scheduled to be updated when the counter is detected to be updated to the last time the counter is detected to be updated; the scheduling information of the multiple historical messages includes the The total number of the multiple historical messages and the total scheduling time of the multiple historical messages.

Further, the first monitoring period scheduling information recording subunit, when performing recording the scheduling information of multiple historical messages that have been scheduled in the first monitoring period before the start of scheduling, includes:

When it is determined that the number of times of updating the counter within the first monitoring period is less than or equal to 2, the scheduling information of the multiple historical messages that have been scheduled within the first monitoring period is recorded.

Further, the first monitoring period scheduling information recording subunit, when performing recording the scheduling information of multiple historical messages that have been scheduled in the first monitoring period before the start of scheduling, further includes:

When it is determined that the number of times the counter is updated during the first monitoring period is greater than 2, record scheduling information of multiple historical messages that have been scheduled within the first monitoring period, and record the system during the first monitoring period. sleep time.

Further, the second monitoring period scheduling information recording subunit is specifically configured to: when the target message is scheduled to end, detect whether the counter is updated;

If it is detected that the counter has not been updated when the target message is scheduled to end, the next message of the target message is obtained from the message queue;

If it is detected that the counter is updated when scheduling the target message is completed, recording scheduling information of multiple historical messages that have been scheduled within the second monitoring period before the scheduling is completed;

Wherein, the second monitoring period corresponds to the period from when the target message is scheduled to be updated and the counter is detected to be updated last time; the scheduling information of the multiple historical messages includes the The total number of the multiple historical messages and the total scheduling time of the multiple historical messages.

Further, the second monitoring period scheduling information recording subunit, when performing recording the scheduling information of multiple historical messages that have been scheduled in the second monitoring period before the end scheduling, includes:

When it is determined that the number of updates of the counter in the second monitoring period is less than or equal to 2, the scheduling information of a plurality of historical messages that have been scheduled in the second monitoring period is recorded.

Further, the second monitoring period scheduling information recording subunit, when performing recording the scheduling information of multiple historical messages that have been scheduled in the second monitoring period before the end scheduling, further includes:

When it is determined that the number of updates of the counter in the second monitoring period is greater than 2, the scheduling information of the target message is recorded, and the scheduled information other than the target message in the second monitoring period is recorded. Scheduling information for historical messages.

Further, the second monitoring period scheduling information recording subunit is also used for:

When finishing scheduling the target message, detecting whether the message type of the target message is a preset type;

In the case that the message type of the target message is not a preset type, detecting whether the counter is updated;

When the message type of the target message is a preset type, the scheduling information of the target message is recorded.

The device for locating performance problems provided by the embodiments of the present disclosure can execute the steps performed by the terminal or the server in the method for locating performance problems provided by the method embodiments of the present disclosure, and the execution steps and beneficial effects are not repeated here.

FIG. 22 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure. Referring specifically to FIG. 22 below, it shows a schematic structural diagram of the electronic device 1000 suitable for implementing the embodiment of the present disclosure. The electronic device 1000 in the embodiment of the present disclosure may include, but is not limited to, 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-mounted terminal ( Mobile terminals such as in-vehicle navigation terminals), wearable electronic devices, etc., and stationary terminals such as digital TVs, desktop computers, smart home devices, and the like. The electronic device shown in FIG. 22 is only an example, and should not impose any limitation on the function and scope of use of the embodiments of the present disclosure.

As shown in FIG. 22, an electronic device 1000 may include a processing device (eg, a central processing unit, a graphics processor, etc.) 1001, which may be loaded into random access according to a program stored in a read only memory (ROM) 1002 or from a storage device 1008 A program in the memory (RAM) 1003 executes various appropriate actions and processes to implement the performance problem locating method of the embodiment as described in the present disclosure. In the RAM 1003, various programs and data required for the operation of the electronic device 1000 are also stored. The processing device 1001, the ROM 1002, and the RAM 1003 are connected to each other through a bus 1004. An input/output (I/O) interface 1005 is also connected to the bus 1004 .

Typically, the following devices can be connected to the I/O interface 1005: input devices 1006 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; including, for example, a liquid crystal display (LCD), speakers, vibration An output device 1007 such as a computer; a storage device 1008 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009 . The communication means 1009 may allow the electronic device 1000 to communicate wirelessly or by wire with other devices to exchange data. While FIG. 22 shows the electronic device 1000 having various means, it should be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.

In particular, according to embodiments 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 comprising program code for performing the method shown in the flowchart, thereby achieving the above The described performance problem location method. In such an embodiment, the computer program may be downloaded and installed from the network via the communication device 1009, or from the storage device 1008, or from the ROM 1002. When the computer program is executed by the processing apparatus 1001, the above-mentioned functions defined in the methods of the embodiments of the present disclosure are executed.

It should be noted that the computer-readable medium mentioned above in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), fiber optics, portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing. In this disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present disclosure, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with computer-readable program code embodied thereon. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device . Program code embodied on a computer readable medium may be transmitted using any suitable medium including, but not limited to, electrical wire, optical fiber cable, RF (radio frequency), etc., or any suitable combination of the foregoing.

In some embodiments, the client and server can use any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol) to communicate, and can communicate with digital data in any form or medium Communication (eg, a communication network) interconnects. Examples of communication networks include local area networks ("LAN"), wide area networks ("WAN"), the Internet (eg, the Internet), and peer-to-peer networks (eg, ad hoc peer-to-peer networks), as well as any currently known or future development network of.

The above-mentioned computer-readable medium may be included in the above-mentioned electronic device; or may exist alone without being assembled into the electronic device.

The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by the electronic device, the electronic device:

Optionally, when the above one or more programs are executed by the electronic device, the electronic device may also perform other steps described in the above embodiments.

Computer program code for performing operations of the present disclosure may be written in one or more programming languages, including but not limited to object-oriented programming languages—such as Java, Smalltalk, C++, and This includes conventional procedural programming languages - such as the "C" 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 kind of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (eg, using an Internet service provider through Internet connection).

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 that contains one or more logical functions for implementing the specified functions executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the blocks 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 is also noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented in dedicated hardware-based systems that perform the specified functions or operations , or can be implemented in a combination of dedicated hardware and computer instructions.

The units involved in the embodiments of the present disclosure may be implemented in a software manner, and may also be implemented in a hardware manner. Among them, the name of the unit does not constitute a limitation of the unit itself under certain circumstances.

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 Chips (SOCs), Complex Programmable Logical Devices (CPLDs) and more.

In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in connection with the instruction execution system, apparatus or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. Machine-readable media may include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media would include one or more wire-based electrical connections, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM or flash memory), fiber optics, compact disk read only memory (CD-ROM), optical storage, magnetic storage, or any suitable combination of the foregoing.

Embodiments of the present disclosure further provide a computer-readable storage medium, where a computer program is stored in the storage medium. When the computer program is executed by a processor, the method of any of the foregoing embodiments in FIG. 1 to FIG. 20 can be implemented, and The implementation manner and beneficial effects are similar, and are not repeated here.

The above description is merely a preferred embodiment of the present disclosure and an illustration of the technical principles employed. Those skilled in the art should understand that the scope of the disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, and should also cover, without departing from the above-mentioned disclosed concept, the technical solutions formed by the above-mentioned technical features or Other technical solutions formed by any combination of its equivalent features. For example, a technical solution formed by replacing the above-mentioned features with the technical features disclosed in the present disclosure (but not limited to) with similar functions.

Additionally, although operations are depicted in a particular order, this should not be construed as requiring that the operations be performed in the particular order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, although the above discussion contains several implementation-specific details, these should not be construed as limitations on the scope of the present 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 logical acts of method, 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 merely example forms of implementing the claims.

Claims

A method for locating performance problems, characterized in that the method comprises:

In response to a performance problem occurring in the application, determine scheduling information of multiple historical messages that have been scheduled when the performance problem occurs according to a message scheduling sequence diagram, where the message scheduling sequence diagram is used to display the scheduling of the multiple historical messages information;

The performance problem is located according to scheduling information of a plurality of historical messages that have been scheduled when the performance problem occurs.
The method according to claim 1, wherein locating the performance problem according to scheduling information of multiple historical messages that have been scheduled when the performance problem occurs, comprises:

Determine the historical messages whose scheduling time is greater than or equal to the preset duration among the plurality of historical messages;

The performance problem is located according to the historical messages whose scheduling time is greater than or equal to a preset time length among the plurality of historical messages.
The method according to claim 1 or 2, characterized in that, before the application has a performance problem, the method further comprises:

Obtain the target message to be scheduled in the message queue corresponding to the application, where the target message is any historical message in the plurality of historical messages;

In the process of scheduling the target message, recording the scheduling information of the target message;

The message scheduling sequence diagram is generated according to the scheduling information of the target message.
The method according to claim 3, wherein, in the process of scheduling the target message, recording the scheduling information of the target message, comprising:

When starting to schedule the target message, record the scheduling start time of the target message;

When finishing scheduling the target message, record the scheduling end time of the target message;

According to the scheduling start time of the target message and the scheduling end time of the target message, determine the scheduling time-consuming of the target message;

Scheduling information of the target message is recorded, where the scheduling information includes at least one of the scheduling start time, the scheduling end time, and the scheduling time-consuming.
The method according to claim 3, wherein, in the process of scheduling the target message, recording the scheduling information of the target message, comprising:

When starting to schedule the target message, record the scheduling information of the multiple historical messages that have been scheduled in the first monitoring period before the scheduling starts, and the multiple historical messages that have been scheduled in the first monitoring period are all message preceding the target message; and/or

When scheduling the target message is ended, recording the scheduling information of the multiple historical messages that have been scheduled within the second monitoring period before the scheduling is ended, and the multiple historical messages that have been scheduled within the second monitoring period include the the target message.
The method according to claim 5, wherein, when starting to schedule the target message, recording scheduling information of multiple historical messages that have been scheduled within the first monitoring period before starting the scheduling, comprising:

When starting to schedule the target message, detecting whether the counter is updated;

If it is detected that the counter has not been updated when starting to schedule the target message, perform scheduling processing on the target message;

If it is detected that the counter is updated when starting to schedule the target message, recording the scheduling information of multiple historical messages that have been scheduled within the first monitoring period before starting the scheduling;

Wherein, the first monitoring period corresponds to the period from when the target message is scheduled to be updated when the counter is detected to be updated to the last time the counter is detected to be updated; the scheduling information of the multiple historical messages includes the The total number of the multiple historical messages and the total scheduling time of the multiple historical messages.
The method according to claim 6, wherein recording the scheduling information of multiple historical messages that have been scheduled in the first monitoring period before starting the scheduling, comprising:

When it is determined that the number of times of updating the counter within the first monitoring period is less than or equal to 2, the scheduling information of the multiple historical messages that have been scheduled within the first monitoring period is recorded.
The method according to claim 6, wherein recording the scheduling information of multiple historical messages that have been scheduled in the first monitoring period before starting the scheduling, comprising:

When it is determined that the number of times the counter is updated during the first monitoring period is greater than 2, record scheduling information of multiple historical messages that have been scheduled within the first monitoring period, and record the system during the first monitoring period. sleep time.
The method according to claim 5, wherein when scheduling the target message is ended, recording scheduling information of multiple historical messages that have been scheduled within the second monitoring period before the scheduling is ended, comprising:

When finishing scheduling the target message, detecting whether the counter is updated;

If it is detected that the counter has not been updated when the target message is scheduled to end, the next message of the target message is obtained from the message queue;

If it is detected that the counter is updated when scheduling the target message is completed, recording scheduling information of multiple historical messages that have been scheduled within the second monitoring period before the scheduling is completed;

Wherein, the second monitoring period corresponds to the period from when the target message is scheduled to be updated and the counter is detected to be updated last time; the scheduling information of the multiple historical messages includes the The total number of the multiple historical messages and the total scheduling time of the multiple historical messages.
The method according to claim 9, wherein recording scheduling information of multiple historical messages that have been scheduled within the second monitoring period before ending scheduling, comprising:

When it is determined that the number of updates of the counter in the second monitoring period is less than or equal to 2, the scheduling information of a plurality of historical messages that have been scheduled in the second monitoring period is recorded.
The method according to claim 9, wherein recording scheduling information of multiple historical messages that have been scheduled within the second monitoring period before ending scheduling, comprising:

When it is determined that the number of updates of the counter in the second monitoring period is greater than 2, the scheduling information of the target message is recorded, and the scheduled information other than the target message in the second monitoring period is recorded. Scheduling information for historical messages.
The method according to claim 9, wherein, when the target message is scheduled to end, detecting whether the counter is updated, comprising:

When finishing scheduling the target message, detecting whether the message type of the target message is a preset type;

In the case that the message type of the target message is not a preset type, detecting whether the counter is updated;

When the message type of the target message is a preset type, the scheduling information of the target message is recorded.
A device for locating performance problems, comprising:

The response module is configured to, in response to a performance problem occurring in the application, determine scheduling information of multiple historical messages that have been scheduled when the performance problem occurs according to a message scheduling sequence diagram, and the message scheduling sequence diagram is used to display the multiple historical messages. scheduling information of a historical message;

A problem locating module, configured to locate the performance problem according to scheduling information of a plurality of historical messages that have been scheduled when the performance problem occurs.
An electronic device, characterized in that the electronic device comprises:

multiple processors;

a storage device for storing a plurality of programs;

When the plurality of programs are executed by the plurality of processors, the plurality of processors are caused to implement the method of any one of claims 1-12.
A computer-readable storage medium on which a computer program is stored, characterized in that, when the program is executed by a processor, the method according to any one of claims 1-12 is implemented.