栈的原理和缓冲区溢出原理

最新推荐文章于 2023-05-22 12:04:41 发布

无花果树

最新推荐文章于 2023-05-22 12:04:41 发布

阅读量1.8k

点赞数 1

分类专栏：信息安全技术实践文章标签：栈堆栈缓冲区溢出

本文链接：https://blog.csdn.net/write_down/article/details/53039805

版权

7 篇文章 0 订阅

订阅专栏

2 篇文章 0 订阅

订阅专栏

本文的目的是读完本文及参考文献后基本理解什么是栈，C语言函数调用过程中栈的变化，以及缓冲区溢出原理。

Stack(栈) is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle. In the pushdown stacks only two operations are allowed: push the item into the stack, and pop the item out of the stack. A stack is a limited access data structure - elements can be added and removed from the stack only at the top. push adds an item to the top of the stack, pop removes the item from the top [1].
Stack Frame(栈帧) is the collection of all data on the stack associated with one subprogram call. The stack frame generally includes: the return address, the argument variables passed on the stack, local variables and the saved copies of any registers modified by the subprogram that need to be restored [2].
EBP(帧指针) is the base pointer for the current stack frame [3].
ESP(栈指针) is the current stack pointer [3].
每次调用函数时，生成一个新的栈帧，存放于栈的某段空间中。EBP总是指向栈帧的顶部（高地址），而ESP指向栈中的下一个可用字节。EBP在函数执行期间不发生变化，而ESP随着函数执行是变化的[3]。