您要查找的是不是:
- stack pointer addressing mode [計] 棧指示字編址方式
- stack pointer address 棧指示字地址
- For example, you can use the stack pointer to follow the stack. 例如,可以使用堆棧指針跟蹤堆棧。
- Stack pointer verification, which detects stack pointer corruption. 堆棧指針驗證,該操作檢測堆棧指針損壞。
- Stack pointer corruption can be caused by a calling convention mismatch. 調用約定不匹配可能導致堆棧指針損壞。
- An invalid pointer address was detected by the underlying socket provider. 基礎套接字提供程序檢測到無效的指針地址。
- The stack pointer is moved down to create new memory and moved up to release that memory. 堆棧指針若向下移,會創建新的內存;若向上移,則會釋放那些內存。
- There are no push or pop instructions and no dedicated stack pointer register defined by the architecture. 體系結構沒有定義壓入或者彈出指令,也沒有定義專門的棧指針寄存器。
- The system detected an invalid pointer address in attempting to use a pointer argument in a call. 系統檢測到在一個調用中嘗試使用指針參數時的無效指針地址。
- Parameter is the offset from the stack pointer to the high-order part of the value. 參數是距離值的高位部分堆棧指針的偏移量。
- This lives in the general RAM (random-access memory) area,but has direct support from the processor via its stack pointer. 駐留於常規RAM(隨機訪問存儲器)區域,但可通過它的「堆棧指針」獲得處理的直接支持。
- The primary exceptions are the stack pointer and malloc or alloca memory, which are aligned to 16 byte, in order to aid performance. 主要異常是堆棧指針和malloc或alloca內存,為了提高性能,它們的對齊方式為16位元組對齊。
- Pointer arithmetic is legal only if the original pointer and the newly calculated pointer address elements of the same array or an element one past the end of that array. 指針的算術操作只有在原指針和計算出來的新指針都指向同一個數組的元素,或指向該數組存儲空間的下一單元時才是合法的。
- The stack pointer must be aligned to 16 bytes, except for leaf functions, in any region of code that isn't part of an epilog or prolog. 在不屬於epilog或prolog的任何代碼部分中,堆棧指針的對齊方式必須為16位元組對齊(葉函數除外)。
- This lives in the general RAM (random-access memory) area, but has direct support from the processor via its stack pointer. 駐留於常規ram(隨機訪問存儲器)區域,但可通過它的「堆棧指針」獲得處理的直接支持。
- Allocation and deallocation are typically fast, since they can be done simply by adding or subtracting the size of the block from the stack pointer. 這兩個限制(上面兩行紅色的字)都可以通過迂迴方式繞過去,方法就是定義一個函數,由它調用構造函數並返回構造起來的對象。這是很幸運的, 因為創建一個對象而又不必知道其確切類型,這常常也很有意義。
- The Java compiler must know,while it is creating the program,the exact size and lifetime of all the data that is stored on the stack,because it must generate the code to move the stack pointer up and down. 創建程序時,Java編譯器必須準確地知道堆棧內保存的所有數據的「長度」以及「存在時間」。這是由於它必須生成相應的代碼,以便向上和向下移動指針。
- The Java compiler must know, while it is creating the program, the exact size and lifetime of all the data that is stored on the stack, because it must generate the code to move the stack pointer up and down. 創建程序時,java編譯器必須準確地知道堆棧內保存的所有數據的「長度」以及「存在時間」。這是由於它必須生成相應的代碼,以便向上和向下移動指針。
- How much do all these figures stack up to? 這些數字的總和是多少?
- This means that,following the load instruction, our machinelanguage orogram would have to load the stack pointer into a trgister, subtract one from it,and store the result back in memory.(P349. 這就意味著,按照已存命令我們機器語言程序把一個棧指針存入寄存器,並將其值減一再將其結果放回內存中。