CN118152278A - Memory leakage positioning method and device - Google Patents
Memory leakage positioning method and device Download PDFInfo
- Publication number
- CN118152278A CN118152278A CN202410259747.2A CN202410259747A CN118152278A CN 118152278 A CN118152278 A CN 118152278A CN 202410259747 A CN202410259747 A CN 202410259747A CN 118152278 A CN118152278 A CN 118152278A
- Authority
- CN
- China
- Prior art keywords
- memory
- determining
- objects
- background process
- tracking object
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 103
- 230000008569 process Effects 0.000 claims abstract description 50
- 238000012546 transfer Methods 0.000 claims abstract description 17
- 230000008859 change Effects 0.000 claims description 11
- 238000011084 recovery Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3604—Software analysis for verifying properties of programs
- G06F11/3612—Software analysis for verifying properties of programs by runtime analysis
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application provides a memory leakage positioning method and a device, wherein the method comprises the following steps: importing a first transfer file, wherein the first transfer file is a file stored by aiming at memory data of a background process of a target program in an operation state; analyzing the first transfer file to obtain a plurality of pieces of analysis data, wherein the plurality of pieces of analysis data comprise a plurality of first objects corresponding to a background process of the target program and the memory size occupied by each first object; determining a candidate object from the plurality of objects according to the memory size occupied by the plurality of first objects; and determining the position where memory leakage exists in the background process of the target program based on the stage of the candidate object in the life cycle. The application locates the position of memory leakage in the background process of the target program through offline analysis under the condition of not influencing the program operation.
Description
Technical Field
The application relates to the field of computers, in particular to a memory leakage positioning method and device.
Background
Memory Leak (Memory Leak) refers to serious consequences of a program running speed being slow or even a system crash, which are caused by that the Memory of a heap that has been dynamically allocated in the program is not released or cannot be released for some reason, resulting in waste of system Memory.
The memory leakage defect has the characteristics of concealment and accumulation, and is more difficult to detect than other illegal memory access errors. Because the memory leakage occurs because the memory blocks are not released and accumulate gradually, the overall performance of the system is reduced, and in extreme cases, the system may crash.
The existing various memory leakage positioning tools all need to add related processes before the program is run, then whether the memory leakage condition exists can be analyzed after a period of running, inconvenience exists in operation, and no method exists for positioning the position where the memory leakage exists through offline analysis under the condition that the program running is not affected.
Disclosure of Invention
In view of the above, the present application aims to provide a memory leak positioning method and apparatus, which can position the memory leak in the background process of the target program through offline analysis without affecting the program operation.
In a first aspect, an embodiment of the present application provides a memory leak location method, where the method includes: importing a first transfer file, wherein the first transfer file is a file stored by aiming at memory data of a background process of a target program in an operation state; analyzing the first transfer file to obtain a plurality of pieces of analysis data, wherein the plurality of pieces of analysis data comprise a plurality of first objects corresponding to a background process of the target program and the memory size occupied by each first object; determining a candidate object according to the memory size occupied by the plurality of first objects; and determining the position where memory leakage exists in the background process of the target program based on the stage of the candidate object in the life cycle.
In an optional embodiment of the present application, the determining a candidate object according to the memory size occupied by the plurality of first objects includes: sequencing the plurality of first objects according to the occupied memory size, and determining the first object with the largest occupied memory as a tracking object; and determining a candidate object from the plurality of reference objects according to the referenced times of the plurality of reference objects corresponding to the tracking object, wherein the reference object is the object called by the tracking object.
In an optional embodiment of the present application, the determining, based on a stage of the candidate object in the life cycle, a location where a memory leak exists in a background process of the target program includes: detecting a stage in the life cycle at which the candidate is located; if the candidate object is detected not to be in the recovery stage in the life cycle, determining a calling method name for the candidate object; and determining an instruction line where the calling method name is located in a background process of the target program as a position where memory leakage exists.
In an alternative embodiment of the present application, the lifecycle includes a creation phase, a use phase, and a reclamation phase, where the candidate object is in the reclamation phase to indicate that the memory corresponding to the candidate object has been released.
In an optional embodiment of the present application, the determining a candidate object according to the memory size occupied by the plurality of first objects includes: determining a first tracking object from the plurality of first objects according to the memory size occupied by the plurality of first objects; importing a second dump file, wherein the second dump file is a file stored by aiming at memory data of a background process of the target program in the running state after the preset time of storing the first dump file; determining a second tracking object from a plurality of second objects according to the memory size occupied by the plurality of second objects corresponding to the background process in the second dump file; a candidate object is determined based on the first tracked object and the second tracked object.
In an alternative embodiment of the present application, the determining a candidate object based on the first tracking object and the second tracking object includes: judging whether the first tracking object is consistent with the second tracking object; if the first tracking object and the second tracking object are consistent, determining a candidate object based on any one of the first tracking object and the second tracking object; if the first tracking object is inconsistent with the second tracking object, judging whether the first tracking object exists in the plurality of second objects or not, and the memory change is in a growing trend; if the first tracking object exists in the plurality of second objects and the memory change is in a growing trend, determining a candidate object based on the first tracking object; and if the first tracking object is not present in the plurality of second objects and/or the memory change is not in a growing trend, determining a candidate object based on the second tracking object.
In an alternative embodiment of the application, the first transfer file is stored by the electronic device by: and acquiring memory data of a background process of the target program in an operating state in real time, and storing the memory data under a target path.
In a second aspect, an embodiment of the present application further provides a memory leak location apparatus, where the apparatus includes: the importing module is used for importing a dump file, wherein the dump file is a file stored aiming at memory data of a background process of a target program in an operating state; and an analysis module: the method comprises the steps of analyzing the dump file to obtain a plurality of pieces of analysis data, wherein the plurality of pieces of analysis data comprise a plurality of objects corresponding to a background process of the target program and the memory size occupied by each object; and a determination module: the candidate object is determined from the objects according to the memory size occupied by the objects; and a positioning module: and the method is used for determining the position where the memory leak exists in the background process of the target program based on the stage of the candidate object in the life cycle.
In a third aspect, an embodiment of the present application further provides an electronic device, including: the system comprises a processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor, when the electronic device is running, the processor and the memory are communicated through the bus, and the machine-readable instructions are executed by the processor to perform the steps of the memory leak location method.
In a fourth aspect, embodiments of the present application also provide a computer readable storage medium having a computer program stored thereon, which when executed by a processor performs the steps of memory leak location as described above.
The embodiment of the application provides a memory leakage positioning method and a memory leakage positioning device, which are used for determining a candidate object by analyzing a dump file, determining the position of memory leakage in a background process of a target program based on the stage of the candidate object in a life cycle, and positioning the position of memory leakage in the background process of the target program through offline analysis under the condition that the program operation is not influenced.
In order to make the above objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a memory leak location method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a memory leak location device according to an embodiment of the present application;
Fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more apparent, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. The components of the embodiments of the present application generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the application, as presented in the figures, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. Based on the embodiments of the present application, every other embodiment obtained by a person skilled in the art without making any inventive effort falls within the scope of protection of the present application.
First, an application scenario to which the present application is applicable will be described. The application can be applied to the field of computers.
According to research, various memory leakage positioning tools in the prior art are required to be added with related processes before the program is operated, then whether the memory leakage condition exists can be analyzed after a period of operation, inconvenience exists in operation, and no method is provided for positioning the position where the memory leakage exists through offline analysis under the condition that the program operation is not affected.
In view of at least one aspect of the foregoing, an embodiment of the present application provides a memory leak location method and apparatus, which determine a candidate object by analyzing a dump file, determine a location of a memory leak in a background process of a target program based on a stage of the candidate object in a life cycle, and locate the location of the memory leak in the background process of the target program by offline analysis without affecting the program operation.
Referring to fig. 1, fig. 1 is a flowchart of a memory leak positioning method according to an embodiment of the application. As shown in fig. 1, the memory leak positioning method provided by the embodiment of the application includes:
S101, importing a first transfer file, wherein the first transfer file is a file stored by aiming at memory data of a background process of a target program in an operation state.
In this step, the first transfer file is stored by the electronic device by: and acquiring memory data of a background process of the target program in the running state in real time, and storing the memory data under the target path.
And detecting whether the target program in the running state has page stuck or page unresponsive conditions in real time, and judging that the target program possibly has memory leakage after detecting the conditions.
Specifically, a task manager is opened, a background process of a target program in an operating state is selected, stored memory data is downwards transferred from a target path, a first dump file is created, preferably, the target process is a process corresponding to semiconductor production management software, and the created dump file is of a dmp type.
S102, analyzing the first transfer file to obtain a plurality of pieces of analysis data, wherein the plurality of pieces of analysis data comprise a plurality of first objects corresponding to a background process of the target program and the memory size occupied by each first object.
Each piece of analysis data corresponds to an object, each object corresponds to the memory size occupied by the object, and a specific software is used for opening the first transfer file and analyzing, for example, the specific software may be a visual studio.
S103, determining a candidate object according to the memory size occupied by the plurality of first objects.
In the step, a plurality of first objects are ordered according to the size of the occupied memory, and the first object with the largest occupied memory is determined to be the tracking object.
And determining a candidate object from the plurality of reference objects according to the number of times of being referred by the plurality of reference objects corresponding to the tracked object, wherein the reference object is the object called by the tracked object.
Specifically, for each object, each object corresponds to a plurality of reference objects, each reference object corresponding to one referenced number of times.
When a tracking object is selected, a plurality of reference objects corresponding to the tracking object and the referenced times of each reference object are displayed, the referenced times of each reference object are ordered, and the reference object with the largest referenced times is determined to be a candidate object.
And determining a first tracking object from the plurality of first objects according to the memory size occupied by the plurality of first objects.
Here, the first objects with the largest memory occupied by the plurality of first objects are selected as the first tracking objects according to the memory size occupied by the plurality of first objects.
And importing a second dump file, wherein the second dump file is a file stored by aiming at memory data of a background process of the target program in an operating state after the preset time for storing the first dump file.
The second dump file, which is a file stored after the first dump file has been stored after a preset time, and the first dump file are stored in the same manner.
And determining a second tracking object from the plurality of second objects according to the memory sizes occupied by the plurality of second objects corresponding to the background process in the second dump file.
Specifically, the second objects with the largest memory occupied by the plurality of second objects are selected as the second tracking objects according to the memory size occupied by the plurality of second objects.
A candidate object is determined based on the first tracked object and the second tracked object.
A candidate object is determined from the first tracked object and the second tracked object by:
and judging whether the first tracking object and the second tracking object are consistent.
If the first tracking object and the second tracking object are consistent, a candidate object is determined based on either of the first tracking object and the second tracking object.
If the first tracking object is consistent with the second tracking object, determining a plurality of reference objects corresponding to the first tracking object and the second tracking object according to any object in the first tracking object and the second tracking object, sequencing the number of times of being referred to the plurality of reference objects, and determining the reference object with the largest number of times of being referred to as a candidate object.
If the first tracking object is inconsistent with the second tracking object, judging whether the first tracking object exists in a plurality of second objects or not, and the memory change is in a growing trend.
If the first tracked object exists in the plurality of second objects and the memory change is in an increasing trend, a candidate object is determined based on the first tracked object.
Specifically, if the first tracking object exists in the plurality of second objects and the memory change is in a growing trend, determining a plurality of reference objects corresponding to the object according to the first tracking object, sorting the cited times of the plurality of reference objects, and determining the reference object with the largest cited times as a candidate object.
If the first tracked object is not present in the plurality of second objects and/or the memory change is not in a growing trend, a candidate object is determined based on the second tracked object.
Specifically, if the first tracking object does not exist in the plurality of second objects and/or the memory change is not in a growing trend, it is determined that the reference object with the largest number of references corresponding to the first tracking object does not have memory leakage.
And determining the reference object with the largest number of references as a candidate object in a plurality of reference objects corresponding to the first tracking object through the verification of the first tracking object again, so that the positioning result is more accurate under the condition of not affecting the online operation.
And continuously importing a third dump file, wherein the third dump file is a file stored by aiming at memory data of a background process of the target program in an operating state after the preset time of storing the second dump file, a third tracking object is determined according to a plurality of third objects corresponding to the third dump file, the second tracking object is judged according to the judgment standard of the first tracking object, and a candidate object is determined.
S104, determining the position where memory leakage exists in the background process of the target program based on the stage of the candidate object in the life cycle.
The method comprises the steps of detecting the phase of a candidate object in a life cycle, wherein the life cycle comprises a creation phase, a use phase and a recovery phase, and the candidate object is in the recovery phase and is used for indicating that the memory corresponding to the candidate object is released.
If the candidate object is detected not to be in the recovery stage in the life cycle, determining the name of the calling method aiming at the candidate object.
And determining an instruction line where the name of the calling method is located in the background process of the target program as a position where memory leakage exists.
And sending the calling method name to a developer, allowing the developer to search the calling method name in the source code, positioning an instruction row where the calling method name is located, and determining that the position of memory leakage exists.
The application analyzes the first transfer file corresponding to the target program in the running state, determines a plurality of first objects, further determines a candidate object, determines the position of memory leakage in the background process of the target program based on the stage of the candidate object in the life cycle, provides memory leakage positioning, and can position the position of memory leakage in the background process of the target program through offline analysis under the condition of not influencing the running of the program.
Under the condition of not influencing on-line operation, the application can help a developer to analyze the specific position of the memory leakage in the positioning and developing process by storing the form of the dump file and analyzing the code of the memory leakage offline by means of a specific software tool, thereby being capable of rapidly positioning the problem and further improving the robustness of the code.
Referring to fig. 2, in the memory leak positioning device 200 corresponding to the memory leak positioning method in the embodiment of the application shown in fig. 2, as shown in fig. 2, the memory leak positioning device 200 includes:
An importing module 201, configured to import a dump file, where the dump file is a file stored for memory data of a background process of a target program in an running state;
the parsing module 202 is configured to parse the dump file to obtain a plurality of pieces of analysis data, where the plurality of pieces of analysis data include a plurality of objects corresponding to a background process of the target program and a memory size occupied by each object;
a determining module 203, configured to determine a candidate object from the plurality of objects according to the memory sizes occupied by the plurality of objects;
the positioning module 204 is configured to determine, based on a stage of the candidate object in the life cycle, a location where a memory leak exists in a background process of the target program.
Because the principle of solving the problem by the device in the embodiment of the present application is similar to that of the memory leak positioning method in the embodiment of the present application, the implementation of the device may refer to the implementation of the method, and the repetition is not repeated.
The embodiment of the application also provides electronic equipment. The electronic device includes: a processor, a memory, and a bus.
Referring to fig. 3, fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the application. As shown in fig. 3, the electronic device 300 includes a processor 310, a memory 320, and a bus 330.
The memory 320 stores machine-readable instructions executable by the processor 310, when the electronic device 300 is running, the processor 310 communicates with the memory 320 through the bus 330, and when the machine-readable instructions are executed by the processor 310, the steps of the memory leak location method in the method embodiment shown in fig. 1 can be executed, and the specific implementation can refer to the method embodiment and will not be described herein.
The embodiment of the present application further provides a computer readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the steps of the memory leak positioning method in the embodiment of the method shown in fig. 1 may be executed, and the specific implementation manner may refer to the embodiment of the method and will not be described herein.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on this understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the above examples are only specific embodiments of the present application, and are not intended to limit the scope of the present application, but it should be understood by those skilled in the art that the present application is not limited thereto, and that the present application is described in detail with reference to the foregoing examples: any person skilled in the art may modify or easily conceive of the technical solution described in the foregoing embodiments, or perform equivalent substitution of some of the technical features, while remaining within the technical scope of the present disclosure; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application. Therefore, the protection scope of the application is subject to the protection scope of the claims.
Claims (10)
1. A memory leak location method, comprising:
importing a first transfer file, wherein the first transfer file is a file stored by aiming at memory data of a background process of a target program in an operation state;
analyzing the first transfer file to obtain a plurality of pieces of analysis data, wherein the plurality of pieces of analysis data comprise a plurality of first objects corresponding to a background process of the target program and the memory size occupied by each first object;
determining a candidate object according to the memory size occupied by the plurality of first objects;
and determining the position where memory leakage exists in the background process of the target program based on the stage of the candidate object in the life cycle.
2. The memory leak location method as recited in claim 1, wherein determining a candidate object based on the memory size occupied by the plurality of first objects comprises:
sequencing the plurality of first objects according to the occupied memory size, and determining the first object with the largest occupied memory as a tracking object;
And determining a candidate object from the plurality of reference objects according to the referenced times of the plurality of reference objects corresponding to the tracking object, wherein the reference object is the object called by the tracking object.
3. The memory leak location method as set forth in claim 1, wherein the determining a location of the memory leak in a background process of the target program based on a stage in a life cycle of the candidate object includes:
detecting a stage in the life cycle at which the candidate is located;
if the candidate object is detected not to be in the recovery stage in the life cycle, determining a calling method name for the candidate object;
And determining an instruction line where the calling method name is located in a background process of the target program as a position where memory leakage exists.
4. The memory leak location method of claim 3, wherein the lifecycle includes a creation phase, a use phase, and a reclamation phase, wherein the candidate object is in the reclamation phase to indicate that the memory corresponding to the candidate object has been released.
5. The memory leak location method as recited in claim 1, wherein determining a candidate object based on the memory size occupied by the plurality of first objects comprises:
determining a first tracking object from the plurality of first objects according to the memory size occupied by the plurality of first objects;
Importing a second dump file, wherein the second dump file is a file stored by aiming at memory data of a background process of the target program in the running state after the preset time of storing the first dump file;
Determining a second tracking object from a plurality of second objects according to the memory size occupied by the plurality of second objects corresponding to the background process in the second dump file;
A candidate object is determined based on the first tracked object and the second tracked object.
6. The memory leak location method as recited in claim 5, wherein the determining a candidate object based on the first tracking object and the second tracking object comprises:
judging whether the first tracking object is consistent with the second tracking object;
if the first tracking object and the second tracking object are consistent, determining a candidate object based on any one of the first tracking object and the second tracking object;
If the first tracking object is inconsistent with the second tracking object, judging whether the first tracking object exists in the plurality of second objects or not, and the memory change is in a growing trend;
if the first tracking object exists in the plurality of second objects and the memory change is in a growing trend, determining a candidate object based on the first tracking object;
and if the first tracking object is not present in the plurality of second objects and/or the memory change is not in a growing trend, determining a candidate object based on the second tracking object.
7. The memory leak location method of claim 1, wherein the first transfer file is stored by the electronic device by:
and acquiring memory data of a background process of the target program in an operating state in real time, and storing the memory data under a target path.
8. A memory leak location apparatus, comprising:
The importing module is used for importing a dump file, wherein the dump file is a file stored aiming at memory data of a background process of a target program in an operating state;
And an analysis module: the method comprises the steps of analyzing the dump file to obtain a plurality of pieces of analysis data, wherein the plurality of pieces of analysis data comprise a plurality of objects corresponding to a background process of the target program and the memory size occupied by each object;
and a determination module: the candidate object is determined from the objects according to the memory size occupied by the objects;
And a positioning module: and the method is used for determining the position where the memory leak exists in the background process of the target program based on the stage of the candidate object in the life cycle.
9. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory in communication over the bus when the electronic device is running, the processor executing the machine-readable instructions to perform the steps of the method of any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that it has stored thereon a computer program which, when executed by a processor, performs the steps of the method according to any of claims 1 to 7.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202410259747.2A CN118152278A (en) | 2024-03-07 | 2024-03-07 | Memory leakage positioning method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202410259747.2A CN118152278A (en) | 2024-03-07 | 2024-03-07 | Memory leakage positioning method and device |
Publications (1)
Publication Number | Publication Date |
---|---|
CN118152278A true CN118152278A (en) | 2024-06-07 |
Family
ID=91294157
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202410259747.2A Pending CN118152278A (en) | 2024-03-07 | 2024-03-07 | Memory leakage positioning method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN118152278A (en) |
-
2024
- 2024-03-07 CN CN202410259747.2A patent/CN118152278A/en active Pending
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR102025556B1 (en) | Processing apparatus, trace unit and diagnostic apparatus | |
US9256517B1 (en) | Display of aggregated stack traces in a source code viewer | |
EP2615552A1 (en) | System testing method | |
CN105204968B (en) | A kind of failure memory detection method and device | |
CN113761519B (en) | Method and device for detecting Web application program and storage medium | |
US10324784B2 (en) | Mitigating crashes of an application server executing a monitoring agent | |
CN110866258A (en) | Method for quickly positioning bug, electronic device and storage medium | |
US20130185602A1 (en) | Heap dump occurrence detection | |
CN115686961A (en) | Processor testing method and device and electronic equipment | |
US20150089482A1 (en) | Automated Identification of Redundant Method Calls | |
CN106533812B (en) | Application server | |
CN118152278A (en) | Memory leakage positioning method and device | |
CN111552616A (en) | Memory monitoring method and device | |
CN115828244A (en) | Memory leak detection method and device and related equipment | |
KR20190055776A (en) | Method and apparatus for identifying security vulnerability and cause point thereof of executable binaries | |
CN114741700A (en) | Public component library vulnerability availability analysis method and device based on symbolic taint analysis | |
CN113127874A (en) | Method and device for processing intranet sensitive information | |
CN111124730A (en) | Error positioning method and device for server and computer storage medium | |
CN113900914A (en) | Exception handling method and device, electronic equipment and computer storage medium | |
CN111694715A (en) | Abnormity warning method, device, equipment and machine readable storage medium | |
CN114443330A (en) | Watchdog restart fault determination method and device, electronic equipment and storage medium | |
CN117407207B (en) | Memory fault processing method and device, electronic equipment and storage medium | |
CN114253846B (en) | Automatic test abnormality positioning method, device, equipment and readable storage medium | |
CN116502239B (en) | Memory vulnerability detection method, device, equipment and medium for binary program | |
CN115202857A (en) | Memory use analysis method, storage medium and electronic device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination |