所有的PowerPC程序都需要由一个指向寄存器1中的这个堆栈的指针启动。
All PowerPC programs start off with a pointer to this stack in register 1.
单击应用程序的后退和前进按钮时，不会在堆栈中添加新的事件，而是移动堆栈的指针。
When clicking the backward and forward buttons for the application, we won't be adding new events to the stack but we will be moving the pointer within the stack.
因为结构，也就是通常所说的值类型，可以被用在堆栈里，并不能总是为它们创建一个指针。
Because structures, also known as value types, can appear on the stack, it is not always possible to create a pointer to them.
函数可以自由使用288字节的内存，对于不调用其他函数的函数来说，这段内存物理上在堆栈指针之下。
Functions are free to use the 288 bytes that are physically below the stack pointer for functions that do not call other functions.
因此，使用简化ABI 的函数实际上可以通过从堆栈指针开始的负偏移量来保存、使用和恢复非易失性寄存器。
Therefore, functions using the simplified ABI actually can save, use, and restore non-volatile registers by using negative offsets from the stack pointer.
在Linux - x86平台上的堆栈指针可以实现为。
Getting the stack pointer on Linux-x86 can be implemented as.
在pop方法中，在顶部指针递减之后，elements仍然会保留对将弹出堆栈的对象的引用。
In the pop method, after the top pointer is decremented, elements still maintains a reference to the object being popped off the stack.
mbackchain和 -mno-backchain：这些选项控制调用方帧的地址是否作为 “backchain”指针存储到被调用方的堆栈帧。
mbackchain and -mno-backchain: These options control whether the address of the caller's frame is stored as so-called "backchain" pointer into the callee's stack frame.
这对函数了解自己的活动记录在什么地方提供了方便——它们可以使用堆栈指针的形式简单地进行定义。
This makes it easy for functions to know where their activation record is — they are simply defined in terms of the stack pointer.
每个堆栈框架都有一个指向前一个堆栈框架的指针(称为回链指针)，还有一个当它调用其他函数时用于存放返回地址的空间。
Each stack frame holds a pointer to the previous stack frame (called the back chain pointer), as well as a space for return addresses for when it calls other functions.
这会保存原来的堆栈指针，并自动分配堆栈内存。
This will save the old stack pointer and allocate stack memory atomically.
如果一个函数正在执行，那么堆栈指针就会指向整个堆栈的顶部，这也是该函数活动记录的顶部。
If a function is executing, then the stack pointer is pointing to the top of the whole stack, which is also the top of that function's activation record.
当我们在应用程序中单击的时候，新的事件将被压入堆栈顶部，指针指向最后添加的元素。
As we click around in the application, new events will be pushed onto the top of the stack, and the pointer will identify the last element added.
因为在堆栈中压入一个变量会让堆栈指针移动一个双字，所以给堆栈指针加4(双字的大小)(第32行)。
Since pushing a variable essentially moves the stack pointer by a dword, the stack pointer is adjusted by adding 4 (the size of a dword) to it (line 32).
接下来，当前堆栈框架指针会被存储为指向下一个堆栈框架的后向指针，虽然尚未建立堆栈框架(这是通过负的偏移量实现的)。
Next, the current stack frame pointer is stored as the back pointer for the next stack frame, even though you haven't established the stack frame yet (this is done through negative offsets).
堆栈指针给出的是当前堆栈框架的结束位置。
The stack pointer tells you where the end of your current stack frame is.
这将产生更好的堆栈回溯，因为帧指针寄存器被用作帧指针而不是通用寄存器。
This will lead to better stack tracebacks, as the frame pointer register is used as a frame pointer rather than a general purpose register.
与堆栈在一起的还有一个指针，指示我们在堆栈中的当前位置。
Working in conjunction with our stack, we'll have a pointer that identifies our current position in the stack.
回链指针指向前一个堆栈框架的回链指针。
The back chain pointer points to the back chain pointer of the previous stack frame.
专用寄存器是那些有预定义的永久功能的寄存器，例如堆栈指针(寄存器1)和TOC指针(寄存器2)。
Dedicated registers are registers that have a predefined, permanent function, like the stack pointer (register 1) and the TOC pointer (register 2).
打开应用程序并单击链接，就会看到存储在浏览器cookie中的历史堆栈和指针。
If you open the application and click around, you'll see our history stack and pointer stored in the browser's cookies.
堆栈帧中的最后一个条目是一个指向前一堆栈帧的指针，通常被称为后向指针（backpointer）。
The final item in the stack frame is a pointer to the previous stack frame, often called the back pointer.
在堆栈指针上加上双字变量的大小(即esp +12、esp + 16等等)，就可以访问所有后续参数。
All subsequent arguments are accessed by adding the size of a dword variable to the stack pointer (that is, esp + 12, esp + 16, and so on).
因此，代码回到循环的开头，指向正确的top指针(线程b修改后的)，调用CAS，把20压入堆栈后结束。
So, the code loops back, points to the proper top pointer (which was changed because of Thread b), invokes CAS, and is done with pushing 20 into the stack.
从单一线程的角度来看，创建了一个新节点，它的next指针指向堆栈的顶部。
From the standpoint of a single thread, a new node is created whose next pointer points to the top of the stack.
它使用这些信息来优化整个程序中的寄存器使用、堆栈分配和指针。
It USES this information to optimize register usage, stack allocations and Pointers across the whole program.
这取决于平台abi；通常在一组指定的寄存器或从“堆栈指针”以固定偏移量。
It depends on the platform ABI; generally either in a designated set of registers or at fixed offsets from a "stack pointer".
堆栈是一个后进先出(LIFO)队列，它保存了子例程的返回地址、数据项、指针等等。
The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, Pointers, and so on.
堆栈常常在函数调用中用于存储本地参数，但在函数中，由于存储在堆栈中的值使得堆栈指针的值常常会发生变化。
The stack is used during a function call to store local arguments. But in the function, the stack pointer may change because values are stored on the stack.
堆栈常常在函数调用中用于存储本地参数，但在函数中，由于存储在堆栈中的值使得堆栈指针的值常常会发生变化。
The stack is used during a function call to store local arguments. But in the function, the stack pointer may change because values are stored on the stack.
应用推荐