这意味着我们必须手工重新编写栈来仿造一个返回地址，以使得尾部调用的函数能直接返回到调用它的函数。
This means that we have to manually rewrite the stack to fake a return address so that the tail-called function will return directly to our parent.
栈顶的地址就代表最后一次被调用的函数（也就是当前的活动函数）。
The address at the top of the stack represents the function that was last called (that is, the active function).
进程地址空间的首段地址便是栈，它储存了局部变量以及大多数编程语言的函数参数。
The topmost segment in the process address space is the stack, which stores local variables and function parameters in most programming languages.
内存地址空间是由诸如堆、栈等段式内存管理 方式进行管理的。
The distinct bands in the address space correspond to memory segments like the heap, stack, and so on.
由于我们只是跳转到同一个函数，所以返回地址和旧的%ebp是相同的，栈的大小也不会改变。
Because we are just jumping into the same function, the return address and old % ebp will be the same and the stack size won't change.
从IP电话的协议栈出发，介绍了SIP的功能特点、地址格式、呼叫及响应方式、SIP组件以及相关协议。
The function, address format, the mode of call request and response, SIP module and correlative protocol are introduced.
在那种情况下，协议栈将会给每一个目的地址发送一份数据包拷贝。
In that case, the stack will automatically send a copy of the packet to each destination specified in the binding entry.
在不发生返回地址栈溢出时，使用后备栈机制能够获得100%的返回地址预测精度。
With the backup stack technique used to repair the return-address stack, a 100% return-address prediction accuracy can be achieved unless overflow appears.
不同频段的地址空间中对应的内存段，如堆，栈等。
The distinct bands in the address space correspond to memory segments like the heap, stack, and so on.
当协议栈需要获取数值是，它通过调用回调函数来实现，该回调函数以寄存器地址和数量作为参数。
Whenever the protocol stack requires a value it calls one of the callback function with the register address and the number of registers to read as an argument.
这是一种攻击往往需要引用绝对内存地址在栈上的地址，库函数的地址，等等。
An exploit often needs to reference absolute memory locations: an address on the stack, the address for a library function, etc.
这样，协议栈将会根据数据包的命令标识符，通过自身的绑定表查找到所对应的目标设备地址。
This will cause the stack to look up the destination in its internal binding table based on the command identifier of the packet.
通过对栈访问行为的分析，提出一种栈高速缓存方案——快速地址计算的自适应栈高速缓存组织方案。
Adaptive stack cache with fast address generation policy is proposed by investigating stack access behavior of programs.
通过对栈访问行为的分析，提出一种栈高速缓存方案——快速地址计算的自适应栈高速缓存组织方案。
Adaptive stack cache with fast address generation policy is proposed by investigating stack access behavior of programs.
应用推荐