| 摘要 |
When a function is called, the return address is placed in a look-up table and an index into the table is pushed onto the return stack. If the table is full the least recently used entry in the table may be invalidated. When the function return is executed, the index is removed from the stack and the index entry may be invalidated. When a branch prediction is made, a copy of all or part of the return stack is made. Alternatively, when a function is called, the return address is written to a stack with multiple address slots per entry. A flag is set to indicate the most recently written slot and which slot in the previous entry was most recently written. The stack pointer indicates both the entry and slot of the return address. When a branch prediction is made, a copy of the stack pointer is made. |
