关键词: 树结构, μC/OS-II, 任务, 栈空间, 函数, 中断嵌套

Abstract: Aiming at the problem that the stack space size of μC/OS-II task is not easily confirmed by existing ways, this paper presented a new way by which the stack space size of μC/OS-II task can be computed based on tree structure. Firstly, the stack space structure of μC/OS-II task was analyzed. Secondly, some tree structures that can show the extreme usage of the stack space were defined. Lastly, the formula that can calculate the stack space which is maximal was presented based on tree structure and the stack space of a real system was calculated by the formula. The stack space size which is calculated by this way can reflect the extreme usage of a stack space factually and can reduce the requirement for RAM.

Key words: tree structure, μC/OS-II, task, stack space, function, interrupt nesting