Tasks stack overflow real-time detection method and apparatus

Abstract

The invention discloses a method and a device for the real-time detection of task stack overflow, relating to the computer operating system field. The method comprises the following steps that: when task stack is allocated, memories in the part adjacent to the top of task stack are set to be an isolation region, and the attribute of the isolation region is set to be non-writable; in the process of pressing the task stack, if stack pressing operation carries out write operation to the isolation region, the task stack is judged to be overflowing. The invention also discloses a device for the real-time detection of task stack overflow. A technical proposal of the invention positions tasks generating stack overflow, and can position concrete positions causing stack overflow by analyzing the stack of the tasks.

Description

technical field [0001] The invention relates to the field of computer operating systems, in particular to a real-time detection method and device for task stack overflow. Background technique [0002] In computer operating systems, the detection and processing of task stack overflow is a very important technology. In existing operating system technologies, the task refers to a thread commonly referred to in operating system books, and a process may consist of one or more tasks, and these tasks share the address space of the process. The stack size of each task is specified by the creator, which requires the programmer to have a clear understanding of the stack size of the task when creating the task. If the specified stack size is relatively small, and the task itself has been related Recursive operations or the definition of relatively large local variables will cause the actual stack size used by the task to exceed the stack size allocated by the programmer, which is what...

AI Technical Summary

Problems solved by technology

The stack size of each task is specified by the creator, which requires the programmer to have a clear understanding of the stack size of the task when creating the task. If the specified stack size is relatively small, and the task itself has been related Recursive operations or the definition of relatively large local variables will cause the actual stack size used by the task to exceed the stack size allocated by the programmer, which is what we usually call stack overflow

Since the address space used by the task that generated the stack overflow shares the address space with other tasks in the same process, the stack overflow of this task will destroy the data of other tasks, resulting in the crash of the entire process

[0003] In a common embedded system, the entire system has only one process space, and all tasks and the operating system itself run in the same address space, such a stack overflow of a task will even destroy the resources of the operating system itself, causing the entire system to crash

Moreover, the stack overflow has a hysteresis effect and extensive implications. The stack overflow of a task will destroy the data of another or even multiple tasks or the operating system, but if the damaged data is a non-fatal error for the task or the operating system, It will not cause system failure immediately, only when other tasks refer to these corrupted data, it will cause system failure or even system crash

At this time, it is difficult for us to locate which task caused the fault, which makes it difficult for us to locate the fault

Images