A stack overflow detection system and method

Abstract

The invention discloses a stack overflow detection system and method and relates to the technical field of computers. The detection system comprises a first initialization module, a stack overflow detection module and an exception handling module, wherein the first initialization module is arranged at an output port of each task creation function of an executable file and used for acquiring basicinformation of a stack during task creation; the stack overflow detection module is arranged at an input port of each task execution function of the executable file and used for judging whether stackoverflow occurs according to an SP value corresponding to a current execution instruction of the task execution function and the basic information of the stack of the function; the exception handlingmodule is used for recording a judgment result of the stack overflow detection module and recalling illegally covered memory space addresses when stack overflow occurs. Stack overflow can be detectedaccurately in the first time, missing can be avoided, the probably illegally modified memory area beyond stack space can be reminded during stack overflow, and the stack space cost is saved.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a stack overflow detection system and method. Background technique [0002] In computer science, the stack is usually used to store temporary variables, pass parameters to called functions, save task state, save function return addresses, etc. Normally, the base address of the stack, that is, the bottom of the stack is a fixed address, and the top of the stack is the address after a certain amount of space is increased or downward based on the base address of the stack. The space between the top of the stack and the bottom of the stack is for the stack space. SP (Stack Pointer, stack pointer) points to the actual top of the stack, and SP cannot go beyond the top of the stack. The present invention is illustrated with 32-bit MIPS (Microprocessor without Interlocked Piped Stages, the microprocessor without internal interlocking pipeline level) system as an example, MIPS has 32 ...

AI Technical Summary

Problems solved by technology

[0012] For the above-mentioned dynamic analysis method, the detection method of Method 1 relies on scanning the content of the stack space after the event, which belongs to the post-event detection. In fact, it cannot be detected in the first time when the stack overflow occurs. At this time, the stack has overflowed and May rewrite the memory outside the stack space, etc.

Method 2 can be detected in the first time, but if the address accessed by the stack overflow passes through the detection space and breaks through the isolation protection at the top of the stack, the stack overflow will not be detected

For the third method, taking the VxWorks operating system as an example, it is necessary to add the RTSP field in the TCB (Task Control Block, task control block), or to use the reserved field of the TCB, or to use the task variable to implement, and it is necessary to target the kernel task It is more complicated to implement in a different way from user tasks

At the same time, the added RTSP occupies additional space on the top of the stack. When the function call level is very deep, the stack space is also a considerable overhead.

Images