-
公开(公告)号:JPH11259298A
公开(公告)日:1999-09-24
申请号:JP925899
申请日:1999-01-18
Applicant: IBM
Inventor: HILGENDORF ROLF , LAUB OLIVER , TAST HANS-WERNER
IPC: G06F9/38 , G06F9/42 , G06F12/0875
Abstract: PROBLEM TO BE SOLVED: To reduce a processing time for defining the target address of a sub-routine return instruction. SOLUTION: In a computer having a processor equipped with an instruction prefetch mechanism including a branch history table for storing the target address of plural branch instructions to be found in an instruction stream, a sub-routine calling and return operation is executed. In this case, the branch history table 22 includes a latent calling instruction tag and a return instruction tag. Each time the latent sub-routine calling instruction is found in the prefetch instruction stream, a pair of addresses including the calling target address of the instruction and the next successive instruction address are stored in a return identification stack 24. Then, a detected branch instruction activates associative retrieval for the next successive instructing part identifying the branch instruction as the return instruction by a matched entry in the return identification stack. Then, a pair of addresses included in the matched entry are transferred to a return cache 30 provided in parallel to the branch history table.
-
公开(公告)号:DE19855806A1
公开(公告)日:1999-07-29
申请号:DE19855806
申请日:1998-12-03
Applicant: IBM
Inventor: HILGENDORF ROLF , LAUB OLIVER , TAST HANS-WERNER
IPC: G06F9/38 , G06F9/42 , G06F12/0875 , G06F12/08
Abstract: The program branching evaluation is performed by a unit (20) that addresses a table of protocols (22) . The same information is fed to jump instruction identification unit (24). Coupled to the identification unit and receiving data from the table is a cache memory (26). This connects to a selector (30) that provides the next address to be read. An Independent claim is included for a method for executing subroutines and jump operations.
-
公开(公告)号:DE19929051C2
公开(公告)日:2001-10-04
申请号:DE19929051
申请日:1999-06-25
Applicant: IBM
Inventor: GAERTNER UTE , GETZLAFF KLAUS J , LAUB OLIVER , PFEFFER ERWIN
Abstract: A method and system for renaming registers of said system is proposed in which mixed instruction sets, e.g. 32 bit and 64 bit instructions are carried out concurrently in one program. In case of an instruction sequence of a preceding 64 bit instruction and one or more 32 bit instructions to be executed in-order after the 64 bit instruction and where the 32 bit instructions having a data dependence to the preceding 64 bit instruction, said rest of the register range changed by the preceding 64 bit instruction is copied to the corresponding location in a target register of the succeeding 32 bit instruction, at least if the same logical register is specified by the 32 bit instruction as it was specified by the preceding 64 bit instruction. The copy source is addressed by the register number and hold in a list (28).
-
公开(公告)号:DE19929050C2
公开(公告)日:2002-01-03
申请号:DE19929050
申请日:1999-06-25
Applicant: IBM
Inventor: GAERTNER UTE , HAESS JUERGEN , LAUB OLIVER , MAURER EBERHARD , PFEFFER ERWIN
-
公开(公告)号:DE19929051A1
公开(公告)日:2000-02-24
申请号:DE19929051
申请日:1999-06-25
Applicant: IBM
Inventor: GAERTNER UTE , GETZLAFF KLAUS J , LAUB OLIVER , PFEFFER ERWIN
Abstract: The data processing system is designed to handle a mixed sequence of 64 and 32 bit long instructions by using an identification process based around the register contents. The 32 bit instruction is located and is copied into a target register . The copy source and register numbers are listed in table form.
-
公开(公告)号:DE19929050A1
公开(公告)日:2000-02-24
申请号:DE19929050
申请日:1999-06-25
Applicant: IBM
Inventor: GAERTNER UTE , HAESS JUERGEN , LAUB OLIVER , MAURER EBERHARD , PFEFFER ERWIN
Abstract: The data processor has a condition code buffer (10) and counter (26) and a number of execution units (22,24). The buffer is configured as a matrix and the data is stored in mirrored form in the buffer. In order to determine if the code for the following operation is valid a comparison (28) is made between values.
-
-
-
-
-