您要查找的是不是:
- There are no push or pop instructions and no dedicated stack pointer register defined by the architecture. 体系结构没有定义压入或者弹出指令,也没有定义专门的栈指针寄存器。
- stack pointer register 栈指针寄存器
- You could, in fact, manually dump the contents of the frame pointer register and trace the entire stack. 实际上,您可以手工转储帧指针寄存器的内容并跟踪整个堆栈。
- This will lead to better stack tracebacks, as the frame pointer register is used as a frame pointer rather than a general purpose register. 这将产生更好的堆栈回溯,因为帧指针寄存器被用作帧指针而不是通用寄存器。
- 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. 调用约定不匹配可能导致堆栈指针损坏。
- Option was set during kernel compilation, the frame pointer register is used to maintain stacks and, hence, the stack traceback can be performed correctly. 选项,那么就用帧指针寄存器来维护堆栈,从而就可以正确地执行堆栈回溯。如果没有设置。
- The stack pointer is moved down to create new memory and moved up to release that memory. 堆栈指针若向下移,会创建新的内存;若向上移,则会释放那些内存。
- 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字节对齐。
- 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编译器必须准确地知道堆栈内保存的所有数据的“长度”以及“存在时间”。这是由于它必须生成相应的代码,以便向上和向下移动指针。
- 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. 这就意味着,按照已存命令我们机器语言程序把一个栈指针存入寄存器,并将其值减一再将其结果放回内存中。
- How much do all these figures stack up to? 这些数字的总和是多少?
- This incrementing of the stack pointer for push instructions also ensures that the stack will reach location 0 at the bottom of RAM, and consequently run out of space for the stack. 专题可以分领域,但一般均是由指导老师带领或学生自行收集、思考、再与指导老师讨论出来的题目,其使用之基础同常需要涵盖多方面的,但会专注在这个特定题目上。