CN113238883A - Stack backtracking method and device - Google Patents
Stack backtracking method and device Download PDFInfo
- Publication number
- CN113238883A CN113238883A CN202110481079.4A CN202110481079A CN113238883A CN 113238883 A CN113238883 A CN 113238883A CN 202110481079 A CN202110481079 A CN 202110481079A CN 113238883 A CN113238883 A CN 113238883A
- Authority
- CN
- China
- Prior art keywords
- function
- stack
- address
- backtracking
- parent
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000002159 abnormal effect Effects 0.000 claims description 13
- 230000009191 jumping Effects 0.000 claims description 7
- 238000009825 accumulation Methods 0.000 claims description 5
- 230000006870 function Effects 0.000 description 227
- 238000004458 analytical method Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0736—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in functional embedded systems, i.e. in a data processing system designed as a combination of hardware and software dedicated to performing a certain function
-
- 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/362—Software debugging
- G06F11/366—Software debugging using diagnostics
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Debugging And Monitoring (AREA)
- Executing Machine-Instructions (AREA)
Abstract
The invention discloses a method and a device for stack backtracking, which relate to the field of embedded systems, and the method comprises the following steps: recording the stack information, the stack depth and the return address of the function; determining a return address of the function and a stack address of the parent function through the stack frame address; when the return address of the function and the stack address of the parent function are both effective, directly updating the return address of the function and the stack address of the parent function, and then continuing backtracking until the call stack backtracking is completed; when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stacking information of the function and the stack depth of the function, and then continuing backtracking until the call stack backtracking is completed. The method has low implementation difficulty, can quickly and completely trace back the complete stack, and effectively improves the efficiency of stack tracing.
Description
Technical Field
The invention relates to the field of embedded systems, in particular to a stack backtracking method and device.
Background
In an embedded system, when a thread is abnormal, or when a thread receives a signal and needs to analyze a call trace of the thread, or when a function needs to record a call trace of a callee, or when a thread is tracked, a call stack of the function needs to be analyzed.
For the current stack backtracking algorithm, the related technology is designed according to one of stack frame structures, and a stack frame backtracking method or an unwind method is used for stack backtracking. When the stack frame backtracking is used, if the function does not have a stack frame structure, the backtracking can be failed; if the unwind method is used for stack backtracking, the backtracking efficiency is low, so that a fast stack backtracking method is needed at present, and function stack information can be fast backtracked under the condition of existence of a stack frame.
For the problem, in the prior art, the type of the stack frame format is judged through the memory of the FP-4, if the stack frame format does not exist, the stack entry information is judged through an instruction analysis method, however, the implementation difficulty of the instruction analysis method is large, and the difference of different cpu instructions is also large.
Disclosure of Invention
Aiming at the defects in the prior art, the first aspect of the invention provides a stack backtracking method which is low in implementation difficulty, can quickly and completely backtrack a complete stack and effectively improves the efficiency of stack backtracking.
In order to achieve the above purposes, the technical scheme adopted by the invention is as follows:
a method of stack backtracking, the method comprising the steps of:
recording the stack information, the stack depth and the return address of the function;
determining a return address of the function and a stack address of the parent function through the stack frame address;
when the return address of the function and the stack address of the parent function are both effective, directly updating the return address of the function and the stack address of the parent function, and then continuing backtracking until the call stack backtracking is completed;
when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stacking information of the function and the stack depth of the function, and then continuing backtracking until the call stack backtracking is completed.
In some embodiments, when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stack entry information of the function and the stack depth of the function, and then continuing the backtracking until the call stack backtracking is completed, the method includes:
when the return address of the function or the stack address of the parent function is invalid, jumping to an abnormal instruction address;
acquiring the stack information of the function and the offset of the return address of the function relative to the stack frame address;
reading the return address of the function through the offset of the return address of the function relative to the stack frame address;
calculating the length of the function stack according to the stacking information of the function to calculate the frame address of the parent function stack;
and updating the return address of the function and the stack address of the parent function, terminating the backtracking if the backtracking is finished, determining the return address of the function and the stack address of the parent function again through the stack frame address if the backtracking is not finished, and continuously backtracking the call stack information until the call stack backtracking is finished.
In some embodiments, said jumping to an excepted instruction address when the return address of the function or the stack address of the parent function is invalid comprises:
setting an abnormal instruction address by using a sigsetjmp function;
when the return address of the function or the stack address of the parent function is invalid, the siglongjmp function is used to jump to an abnormal instruction address.
In some embodiments, when the stack base address is 0 or the maximum level of the call stack to be traced is traced, the tracing end is determined.
In some embodiments, the determining the return address of the function and the stack address of the parent function by the stack frame address includes:
determining the return address of the function according to the position of the current stack frame + 4;
and determining the stack address of the parent function according to the content of the current stack frame.
In some embodiments, the recording the stack entry information, the function stack depth, and the function return address of the function includes:
reading ELF file information, recording the starting address and the ending address of a function, the instruction address of an operation stack in the function, the stack length of the instruction operation, the stack length of the function accumulation operation and the function return address, and generating an information table of the function stack-in and stack-out operation.
In some embodiments, the information table of the function push operation is created in the order of the function instruction addresses from small to large.
The second aspect of the invention provides a stack backtracking device which has low implementation difficulty, can quickly and completely backtrack a complete stack and effectively improves the efficiency of stack backtracking.
In order to achieve the above purposes, the technical scheme adopted by the invention is as follows:
an apparatus for stack backtracking, comprising:
the recording module is used for recording the stack entry information, the function stack depth and the function return address of the function;
the addressing module is used for determining a return address of the function and a stack address of a parent function through a stack frame address;
a backtracking module for, in use,
when the return address of the function and the stack address of the parent function are both effective, directly updating the return address of the function and the stack address of the parent function, and then continuing backtracking until the call stack backtracking is completed;
when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stacking information of the function and the stack depth of the function, and then continuing backtracking until the call stack backtracking is completed.
In some embodiments, the backtracking module performs: when the return address of the function or the stack address of the parent function is invalid, according to the stacking information of the function and the stack depth of the function, the return address of the function and the stack address of the parent function are determined and updated, and then backtracking is continued until call stack backtracking is completed, wherein the backtracking method comprises the following steps:
when the return address of the function or the stack address of the parent function is invalid, jumping to an abnormal instruction address;
acquiring the stack information of the function and the offset of the return address of the function relative to the stack frame address;
reading the return address of the function through the offset of the return address of the function relative to the stack frame address;
calculating the length of the function stack according to the stacking information of the function to calculate the frame address of the parent function stack;
and updating the return address of the function and the stack address of the parent function, terminating the backtracking if the backtracking is finished, determining the return address of the function and the stack address of the parent function again through the stack frame address if the backtracking is not finished, and continuously backtracking the call stack information until the call stack backtracking is finished.
In some embodiments, the recording module performs: recording the stack information, the stack depth and the return address of the function, including:
reading ELF file information, recording the starting address and the ending address of a function, the instruction address of an operation stack in the function, the stack length of the instruction operation, the stack length of the function accumulation operation and the function return address, and generating an information table of the function stack-in and stack-out operation.
Compared with the prior art, the invention has the advantages that:
the method for backtracking the stack comprises the steps of creating an information table of function stacking and popping operation, recording stacking information of functions and function stacking depth, directly backtracking the function stack through the stack frame in the process of backtracking the stack with the stack frame structure, and finding the return address and the stack depth of the function and updating the stack base address by inquiring the information of the information table of the function stacking and popping operation if the stack frame structure does not exist, so as to continue backtracking. The method can quickly and completely trace back the complete stack, effectively improves the efficiency of stack tracing, has small implementation difficulty compared with the mode of judging the stack entry information by an instruction analysis method in the prior art, has wide applicability because the reason of cpu instruction difference does not need to be considered, and is suitable for most embedded systems.
Drawings
FIG. 1 is a flowchart illustrating a method for stack backtracking according to an embodiment of the present invention;
fig. 2 is a flowchart of step S4 in fig. 1.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Referring to fig. 1, an embodiment of the present invention provides a method for stack backtracking, including the following steps:
s1, recording the stack entry information, the function stack depth and the function return address of the function.
In some embodiments, recording the stack information, the stack depth and the return address of the function is realized by creating an information table of the function stack push operation.
Specifically, the information of the ELF file is read first, the ELF file is composed of 4 parts, one of the parts is a section header table, the part records the header table information of the section, and a section records many contents, such as common code segments, data segments, and bss segments, which are found through the section header table, because each record has an offset, the position of the section is found through the offset, so that the partial contents of the section are analyzed.
Reading eh _ frame section information of the ELF file, recording a starting address and an ending address of a function, an instruction address of an operation stack in the function, a stack length of the instruction operation, a stack length of the operation accumulated by the function and a function return address in sequence according to a function instruction address, and generating an information table of function stack-in and stack-out operation until the establishment of all dependent dynamic library information tables is completed.
In some preferred embodiments, the information table of the function push and pull operation is created according to the order from small to large of the function instruction address, and may also be created according to the order from large to small of the function instruction address as needed, which is not limited herein.
And S2, determining the return address of the function and the stack address of the parent function through the stack frame address.
It should be noted that, in some embodiments, the return address of the function is the position of +4 of the current stack frame, and then the stack address of the parent function is found according to the content of the current stack frame.
And S3, when the return address of the function and the stack address of the parent function are both effective, directly updating the return address of the function and the stack address of the parent function, and then continuing backtracking until the call stack backtracking is completed.
And S4, when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stacking information of the function and the stack depth of the function, and then continuing backtracking until the call stack backtracking is completed.
Specifically, referring to fig. 2, in some embodiments, step S4 includes the following steps:
s41, when the return address of the function or the stack address of the parent function is invalid, jumping to an abnormal instruction address.
In a specific implementation, the sigsetjmp function may be used to set an exceptional instruction address, and when the return address of the function or the stack address of the parent function is invalid, the siglongjmp function may be used to jump to the exceptional instruction address.
And S42, acquiring the stack entry information of the function and the offset of the return address of the function relative to the stack frame address.
S43, reading the return address of the function through the offset of the return address of the function relative to the stack frame address.
And S44, calculating the length of the function stack increase according to the stacking information of the function to calculate the frame address of the parent function stack.
And S45, updating the return address of the function and the stack address of the parent function, terminating the backtracking if the backtracking is finished, determining the return address of the function and the stack address of the parent function again through the stack frame address if the backtracking is not finished, and continuously backtracking the call stack information until the call stack backtracking is finished.
It should be noted that, if the return address of the function or the stack frame address of the parent function is invalid, the information of the function stack push operation is looked up in the information table of the above function stack push operation by the current function instruction address, and the information table of the function stack push operation returns the current function through the function pointer until the stack length of the instruction address operation and the offset of the return address of the function relative to the stack frame.
And then calculating a stack pointer of the return address of the function according to the offset, reading the return address of the function, updating the stack address of the parent function according to the offset, and then continuing to trace back.
It can be understood that if the return address of the function and the stack address of the parent function are both valid, the return address of the function and the stack address of the parent function are directly updated, and then the backtracking is continued.
In both cases, it is necessary to determine whether to terminate the backtracking, specifically, when the stack base address is 0 or the backtracking is to the set maximum level of the call stack to be backtracked, it is determined that the backtracking is finished.
It is worth noting that the stack base address being 0 means that the call relation of the function has ended. And backtracking to the maximum level, for example, the user needs to backtrack the 10-layer call stack, and if the 10-layer call stack is backtracked, the backtracking is ended.
In summary, the method for stack trace-back of the present invention records the stack information of the function and the stack depth of the function by creating an information table of the function stack pull-in operation, and directly traces back the function stack through the stack frame in the stack trace-back process with the stack frame structure, and if the stack frame structure does not exist, finds the return address and the stack depth of the function and updates the stack base address by querying the information table of the function stack pull-in operation, and continues trace-back. The method can quickly and completely trace back the complete stack, effectively improves the efficiency of stack tracing, has small implementation difficulty compared with the mode of judging the stack entry information by an instruction analysis method in the prior art, has wide applicability because the reason of cpu instruction difference does not need to be considered, and is suitable for most embedded systems.
Correspondingly, the embodiment of the invention also provides a device for stack backtracking, which comprises a recording module, an addressing module and a backtracking module.
The recording module is used for recording the stack entry information, the function stack depth and the function return address of the function. The addressing module is used for determining a return address of the function and a stack address of the parent function through the stack frame address;
the backtracking module is used for: when the return address of the function and the stack address of the parent function are both effective, the return address of the function and the stack address of the parent function are directly updated, and then the backtracking is continued until the call stack backtracking is completed.
When the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stacking information of the function and the stack depth of the function, and then continuing backtracking until the call stack backtracking is completed.
In some embodiments, the backtracking module performs: when the return address of the function or the stack address of the parent function is invalid, according to the stacking information of the function and the stack depth of the function, the return address of the function and the stack address of the parent function are determined and updated, and then backtracking is continued until call stack backtracking is completed, wherein the backtracking method comprises the following steps:
when the return address of the function or the stack address of the parent function is invalid, a jump is made to the exceptional instruction address. And acquiring the stack pushing information of the function and the offset of the return address of the function relative to the stack frame address. The return address of the function is read by its offset from the stack frame address. And calculating the length of the function stack growth according to the stacking information of the function so as to calculate the frame address of the parent function stack.
And updating the return address of the function and the stack address of the parent function, terminating the backtracking if the backtracking is finished, determining the return address of the function and the stack address of the parent function again through the stack frame address if the backtracking is not finished, and continuously backtracking the call stack information until the call stack backtracking is finished.
Further, when the return address of the function or the stack address of the parent function is invalid, the jump is made to the abnormal instruction address, in a specific implementation, the abnormal instruction address may be set by using a sigsetjmp function, and when the return address of the function or the stack address of the parent function is invalid, the jump is made to the abnormal instruction address by using a siglongijmp function.
Further, in the process of judging whether the backtracking is finished, when the stack base address is 0 or the maximum level of the call stack to be backtracked is backtracked, the backtracking is judged to be finished.
In some embodiments, the addressing module performs: determining a return address of the function and a stack address of the parent function by the stack frame address, comprising:
and determining the return address of the function according to the position of the current stack frame +4, and determining the stack address of the parent function according to the content of the current stack frame.
In some embodiments, the recording module performs: recording the stack information, the stack depth and the return address of the function, including:
reading ELF file information, recording the starting address and the ending address of a function, the instruction address of an operation stack in the function, the stack length of the instruction operation, the stack length of the function accumulation operation and the function return address, and generating an information table of the function stack-in and stack-out operation.
Further, the information table of the function stack-in and stack-out operation is created according to the sequence of the function instruction addresses from small to large.
In summary, the device for stack trace back of the present invention records the stack information of the function and the stack depth of the function by creating an information table for the stack pull-in operation of the function, directly traces back the function stack through the stack frame in the process of stack trace back with the stack frame structure, and finds the return address and the stack depth of the function and updates the stack base address by querying the information table for the stack pull-in operation of the function if the stack frame structure does not exist, and continues trace back. The method can quickly and completely trace back the complete stack, effectively improves the efficiency of stack tracing, has small implementation difficulty compared with the mode of judging the stack entry information by an instruction analysis method in the prior art, has wide applicability because the reason of cpu instruction difference does not need to be considered, and is suitable for most embedded systems.
The present invention is not limited to the above-described embodiments, and it will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements are also considered to be within the scope of the present invention. Those not described in detail in this specification are within the skill of the art.
Claims (10)
1. A method of stack backtracking, the method comprising the steps of:
recording the stack information, the stack depth and the return address of the function;
determining a return address of the function and a stack address of the parent function through the stack frame address;
when the return address of the function and the stack address of the parent function are both effective, directly updating the return address of the function and the stack address of the parent function, and then continuing backtracking until the call stack backtracking is completed;
when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stacking information of the function and the stack depth of the function, and then continuing backtracking until the call stack backtracking is completed.
2. The method of claim 1, wherein when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stack entry information of the function and the stack depth of the function, and then continuing the backtracking until the call stack backtracking is completed, the method comprises:
when the return address of the function or the stack address of the parent function is invalid, jumping to an abnormal instruction address;
acquiring the stack information of the function and the offset of the return address of the function relative to the stack frame address;
reading the return address of the function through the offset of the return address of the function relative to the stack frame address;
calculating the length of the function stack according to the stacking information of the function to calculate the frame address of the parent function stack;
and updating the return address of the function and the stack address of the parent function, terminating the backtracking if the backtracking is finished, determining the return address of the function and the stack address of the parent function again through the stack frame address if the backtracking is not finished, and continuously backtracking the call stack information until the call stack backtracking is finished.
3. The method of claim 2, wherein jumping to an exception instruction address when a return address of a function or a stack address of a parent function is invalid, comprises:
setting an abnormal instruction address by using a sigsetjmp function;
when the return address of the function or the stack address of the parent function is invalid, the siglongjmp function is used to jump to an abnormal instruction address.
4. The method as claimed in claim 2, wherein the backtracking is determined to be over when the stack base address is 0 or the maximum level of the call stack to be backtracked is backtracked.
5. The method of claim 1, wherein determining the return address of the function and the stack address of the parent function by the stack frame address comprises:
determining the return address of the function according to the position of the current stack frame + 4;
and determining the stack address of the parent function according to the content of the current stack frame.
6. The method of claim 1, wherein the recording stack information, function stack depth and function return address of the function comprises:
reading ELF file information, recording the starting address and the ending address of a function, the instruction address of an operation stack in the function, the stack length of the instruction operation, the stack length of the function accumulation operation and the function return address, and generating an information table of the function stack-in and stack-out operation.
7. The method of claim 6, wherein the information table of the function push operation is created in the order of the function instruction addresses from small to large.
8. An apparatus for stack backtracking, comprising:
the recording module is used for recording the stack entry information, the function stack depth and the function return address of the function;
the addressing module is used for determining a return address of the function and a stack address of a parent function through a stack frame address;
a backtracking module for, in use,
when the return address of the function and the stack address of the parent function are both effective, directly updating the return address of the function and the stack address of the parent function, and then continuing backtracking until the call stack backtracking is completed;
when the return address of the function or the stack address of the parent function is invalid, determining and updating the return address of the function and the stack address of the parent function according to the stacking information of the function and the stack depth of the function, and then continuing backtracking until the call stack backtracking is completed.
9. The apparatus of claim 8, wherein the backtracking module performs: when the return address of the function or the stack address of the parent function is invalid, according to the stacking information of the function and the stack depth of the function, the return address of the function and the stack address of the parent function are determined and updated, and then backtracking is continued until call stack backtracking is completed, wherein the backtracking method comprises the following steps:
when the return address of the function or the stack address of the parent function is invalid, jumping to an abnormal instruction address;
acquiring the stack information of the function and the offset of the return address of the function relative to the stack frame address;
reading the return address of the function through the offset of the return address of the function relative to the stack frame address;
calculating the length of the function stack according to the stacking information of the function to calculate the frame address of the parent function stack;
and updating the return address of the function and the stack address of the parent function, terminating the backtracking if the backtracking is finished, determining the return address of the function and the stack address of the parent function again through the stack frame address if the backtracking is not finished, and continuously backtracking the call stack information until the call stack backtracking is finished.
10. The apparatus of claim 8, wherein the recording module performs: recording the stack information, the stack depth and the return address of the function, including:
reading ELF file information, recording the starting address and the ending address of a function, the instruction address of an operation stack in the function, the stack length of the instruction operation, the stack length of the function accumulation operation and the function return address, and generating an information table of the function stack-in and stack-out operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110481079.4A CN113238883B (en) | 2021-04-30 | 2021-04-30 | Stack backtracking method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110481079.4A CN113238883B (en) | 2021-04-30 | 2021-04-30 | Stack backtracking method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113238883A true CN113238883A (en) | 2021-08-10 |
| CN113238883B CN113238883B (en) | 2022-09-02 |
Family
ID=77131782
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110481079.4A Active CN113238883B (en) | 2021-04-30 | 2021-04-30 | Stack backtracking method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113238883B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114756284A (en) * | 2022-04-21 | 2022-07-15 | 深圳全志在线有限公司 | Method and device for realizing stack backtracking of variable-length instruction set system |
| CN115292201A (en) * | 2022-09-28 | 2022-11-04 | 中国人民解放军国防科技大学 | Function call stack parsing and backtracking method and device |
| WO2023036075A1 (en) * | 2021-09-08 | 2023-03-16 | 华为技术有限公司 | Program call stack creation method, and stack backtrace method and apparatus |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102109975A (en) * | 2009-12-24 | 2011-06-29 | 华为技术有限公司 | Method, device and system for determining function call relationship |
| US20110214109A1 (en) * | 2010-02-26 | 2011-09-01 | Pedersen Soeren Sandmann | Generating stack traces of call stacks that lack frame pointers |
| CN103019707A (en) * | 2012-11-30 | 2013-04-03 | 华为技术有限公司 | Call stack analyzing and processing method and device |
| CN103559123A (en) * | 2013-10-24 | 2014-02-05 | 烽火通信科技股份有限公司 | Function call stack analyzing method and device based on VxWorks operation system |
| CN104484179A (en) * | 2014-12-23 | 2015-04-01 | 上海斐讯数据通信技术有限公司 | Stack recalling method |
| CN106484608A (en) * | 2015-09-01 | 2017-03-08 | 青岛海信电器股份有限公司 | A kind of kernel fault localization method, device and computer |
| US20190227953A1 (en) * | 2018-01-22 | 2019-07-25 | Infineon Technologies Ag | Real time stack protection |
-
2021
- 2021-04-30 CN CN202110481079.4A patent/CN113238883B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102109975A (en) * | 2009-12-24 | 2011-06-29 | 华为技术有限公司 | Method, device and system for determining function call relationship |
| US20110214109A1 (en) * | 2010-02-26 | 2011-09-01 | Pedersen Soeren Sandmann | Generating stack traces of call stacks that lack frame pointers |
| CN103019707A (en) * | 2012-11-30 | 2013-04-03 | 华为技术有限公司 | Call stack analyzing and processing method and device |
| CN103559123A (en) * | 2013-10-24 | 2014-02-05 | 烽火通信科技股份有限公司 | Function call stack analyzing method and device based on VxWorks operation system |
| CN104484179A (en) * | 2014-12-23 | 2015-04-01 | 上海斐讯数据通信技术有限公司 | Stack recalling method |
| CN106484608A (en) * | 2015-09-01 | 2017-03-08 | 青岛海信电器股份有限公司 | A kind of kernel fault localization method, device and computer |
| US20190227953A1 (en) * | 2018-01-22 | 2019-07-25 | Infineon Technologies Ag | Real time stack protection |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023036075A1 (en) * | 2021-09-08 | 2023-03-16 | 华为技术有限公司 | Program call stack creation method, and stack backtrace method and apparatus |
| CN114756284A (en) * | 2022-04-21 | 2022-07-15 | 深圳全志在线有限公司 | Method and device for realizing stack backtracking of variable-length instruction set system |
| CN115292201A (en) * | 2022-09-28 | 2022-11-04 | 中国人民解放军国防科技大学 | Function call stack parsing and backtracking method and device |
| CN115292201B (en) * | 2022-09-28 | 2022-12-20 | 中国人民解放军国防科技大学 | Function call stack parsing and backtracking method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113238883B (en) | 2022-09-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113238883B (en) | Stack backtracking method and device | |
| US20030005414A1 (en) | Program execution stack signatures | |
| CN111341315B (en) | Voice control method, device, computer equipment and storage medium | |
| CN109299352B (en) | Method and device for updating website data in search engine and search engine | |
| CN112269534A (en) | Data reading method, device and equipment and computer readable storage medium | |
| CN108874441B (en) | Board card configuration method, device, server and storage medium | |
| CN103077095A (en) | Error correction method and device for stored data and computer system | |
| CN111104547A (en) | Method and device for processing data in vehicle | |
| CN110968296B (en) | Data acquisition method, device, equipment and readable storage medium | |
| CN114860654A (en) | Method and system for dynamically changing Iceberg table Schema based on Flink data stream | |
| CN110825600B (en) | Page information processing method, server and page display device | |
| CN103488491A (en) | Method for carrying out system upgrade on terminal and terminal | |
| CN112149038B (en) | Browser development method, browser development device, computer equipment and readable storage medium | |
| CN117130618B (en) | Incremental compiling method, device and equipment for executable file of intelligent card | |
| CN111506747B (en) | File analysis method, device, electronic equipment and storage medium | |
| CN116795486A (en) | Analysis method and device for container mirror image file purification, storage medium and terminal | |
| CN110674171A (en) | Script generation method and device and data processing method and device | |
| CN115454710A (en) | Flash memory data reading method and device, electronic equipment and storage medium | |
| CN113342431B (en) | Function call stack backtracking and program exception handling method, device, equipment and medium | |
| CN114968841A (en) | Information flash memory storage method and device, computer equipment and storage medium | |
| CN111061699B (en) | Method and device for updating version of electric energy meter database | |
| CN112306522A (en) | Firmware updating mode identification method and device | |
| CN111309396B (en) | System library access method and device and computer readable storage medium | |
| CN110489125B (en) | File management method and computer storage medium | |
| CN110795297B (en) | Electronic equipment testing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240628 Address after: 430000 No. 6, High-tech Fourth Road, Donghu High-tech Development Zone, Wuhan City, Hubei Province Patentee after: FIBERHOME TELECOMMUNICATION TECHNOLOGIES Co.,Ltd. Country or region after: China Patentee after: Wuhan Changjiang Computing Technology Co.,Ltd. Address before: 430000 No. 6, High-tech Fourth Road, Donghu High-tech Development Zone, Wuhan City, Hubei Province Patentee before: FIBERHOME TELECOMMUNICATION TECHNOLOGIES Co.,Ltd. Country or region before: China |
|
| TR01 | Transfer of patent right |