|Numéro de publication||US5870575 A|
|Type de publication||Octroi|
|Numéro de demande||US 08/934,644|
|Date de publication||9 févr. 1999|
|Date de dépôt||22 sept. 1997|
|Date de priorité||22 sept. 1997|
|État de paiement des frais||Payé|
|Numéro de publication||08934644, 934644, US 5870575 A, US 5870575A, US-A-5870575, US5870575 A, US5870575A|
|Inventeurs||James Allan Kahle, Soummya Mallick|
|Cessionnaire d'origine||International Business Machines Corporation|
|Exporter la citation||BiBTeX, EndNote, RefMan|
|Citations de brevets (5), Référencé par (50), Classifications (10), Événements juridiques (4)|
|Liens externes: USPTO, Cession USPTO, Espacenet|
The subject matter of this application is related to that disclosed in the following applications, which are assigned to the assignee of the present application and are incorporated herein by reference:
Ser. No. 08,934,645, filed of even date herewith, for ADDRESS TRANSLATION BUFFER FOR DATA PROCESSING SYSTEM EMULATION MODE, by Soummya Mallick.
Ser. No. 08,934,857, filed of even date herewith, for METHOD AND SYSTEM FOR PROCESSING BRANCH INSTRUCTIONS DURING EMULATION IN A DATA PROCESSING SYSTEM, by James A. Kahle and Soummya Mallick.
Ser. No. 08,935,007, filed of even date herewith, for METHOD AND SYSTEM FOR INTERRUPT HANDLING DURING EMULATION IN A DATA PROCESSING SYSTEM, by James A. Kahle and Soummya Mallick.
Ser. No. 08/591,291, now issued U.S. Pat. No. 5,732,235, filed Jan. 25, 1996, for A METHOD AND SYSTEM FOR MINIMIZING THE NUMBER OF CYCLES REQUIRED TO EXECUTE SEMANTIC ROUTINES, by Soummya Mallick.
Ser. No. 08/581,793, now issued U.S. Pat. No. 5,758,140, filed Jan. 25, 1996, for A METHOD AND SYSTEM FOR IMPROVING EMULATION PERFORMANCE BY PROVIDING INSTRUCTIONS THAT OPERATE ON SPECIAL-PURPOSE REGISTER CONTENTS, by Soummya Mallick.
1. Technical Field
The present invention relates in general to a method and system for data processing and, in particular, to a method and system for emulating differing architectures in a data processing system. Still more particularly, the present invention relates to a method and system for emulating guest branch instructions in a data processing system.
2. Description of the Related Art
The PowerPC™ architecture is a high-performance reduced instruction set (RISC) processor architecture that provides a definition of the instruction set, registers, addressing modes, and the like, for a family of computer systems. The PowerPC™ architecture is somewhat independent of the particular construction of the microprocessor chips or chips utilized to implement an instance of the architecture and has accordingly been constructed in various implementations, including the PowerPC 601™, 602™, 603™, and 604™. The design and operation of these processors have been described in published manuals such as the PowerPC 604™ RISC Microprocessor User's Manual, which is available from IBM Microelectronics as Order No. MPR604UMU-01 and is incorporated herein by reference.
As is true for many contemporary processors, a RISC architecture was chosen for the PowerPC™ because of the inherently higher performance potential of RISC architectures compared to CISC (complex instruction set computer) architectures. While it is desirable to optimize the design of a RISC processor to maximize the performance of the processor when executing native RISC instructions, it is also desirable to promote compatibility by accommodating commercial software written for CISC processors such as the Intel x86 and Motorola 68K.
Accordingly, an emulator mechanism can be incorporated into a PowerPC™ processor as disclosed in above-referenced Ser. Nos. 08/591,291 and 08/581,793. The disclosed emulation mechanism allows guest instructions (e.g., variable-length CISC instructions) to be emulated by executing corresponding semantic routines formed from native RISC instructions. Thus, the processor is required to manage two distinct instruction streams: a guest instruction stream containing the instructions to be emulated and a native instruction stream containing the native instructions within the semantic routines utilized to emulate the guest instructions. In order to maintain high performance when emulating guest instructions, an efficient mechanism is needed within the processor for managing both the guest and native instruction steams, with provision for branching and exception handling.
It is therefore one object of the present invention to provide an improved method and system for data processing.
It is another object of the present invention to provide a method and system for emulating differing architectures in a data processing system.
It is yet another object of the present invention to provide a method and system for emulating guest branch instructions in a data processing system.
The foregoing objects are achieved as is now described. According to one embodiment, an emulation mechanism for a host computer system allows guest instructions to be executed by semantic routines made up of native instructions. The native instructions for the host processor are of a particular format, such as that specified by a RISC architecture, whereas the guest instructions are in a format for a different computer architecture, such as variable-length CISC instructions. The processor includes an emulator unit for fetching and processing the guest instructions that utilizes a multiple-entry pointer queue to store the guest instructions currently fetched in order of receipt. Each entry in the pointer queue includes an offset that indicates the location in memory of the semantic routine for the associated guest instruction, immediate data (if any) for the guest instruction, the length of the corresponding semantic routine, a condition field indicating results of arithmetic/logic operations by a guest instruction, valid bits, and other pertinent data. The processor executes a semantic routine, in response to the entries in the pointer queue, using the content of the entry to fetch the semantic routine. The semantic routine utilized to emulate a first type of unconditional indirect guest branch instruction (such as a CALL) calculates a speculative return address, temporarily stores the speculative return address in memory, and initiates fetching at a target address. The semantic routine utilized to emulate a second type of unconditional indirect guest branch instruction (such as a RETURN) retrieves the speculative return address from memory, initiates fetching of guest instructions at the speculative return address, and thereafter calculates a correct return address. After the semantic routine for a guest instruction has been completed by the processor, the associated entry is removed from the pointer queue.
The above as well as additional objects, features, and advantages of the present invention will become apparent in the following detailed written description.
The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself however, as well as a preferred mode of use, further objects and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:
FIG. 1 depicts an illustrative embodiment of a data processing system with which the method and system of the present invention may advantageously be utilized;
FIG. 2 illustrates a more detailed block diagram of the processor depicted in FIG. 1;
FIG. 3 depicts a more detailed block diagram of the emulation assist unit (EAU) in the processor of FIG. 2;
FIG. 4 illustrates a more detailed block diagram of the guest instruction queue within the EAU depicted in FIG. 3; and
FIG. 5 is a logical flowchart depicting a method for processing guest branch instructions in accordance with the present invention.
With reference now to the figures and in particular with reference to FIG. 1, there is depicted a high level block diagram of a data processing system 2 in accordance with the present invention. As illustrated, data processing system 2, which can comprise a desktop computer system, includes one or more CPUs 4, which are connected to the other components of data processing system 2 in a standard hardware configuration. For example, CPUs 4 can be interconnected to main memory 6 via a memory controller 5 and system bus 7. System bus 7 is also coupled to PCI (Peripheral Component Interconnect) bus 12 by a PCI host bridge 11, which permits communication between the devices coupled to system bus 7 and peripherals 10 and I/O components 8. Although for the purpose of illustration, the present invention is described below with reference to an illustrative embodiment in which CPU 4 is implemented with one of the PowerPC™ line of processors manufactured by International Business Machines Corporation, it should be understood that a variety of other processors could alternatively be employed.
When implemented as a PowerPC™ processor, each CPU 4 preferably comprises a single integrated circuit superscalar microprocessor, including various registers, buffers, execution units, and functional units that operate according to reduced instruction set computing (RISC) techniques. Each CPU 4 executes RISC instructions within the PowerPC™ instruction set architecture (e.g., the instructions forming application program 16 and operating system/kernel 18) from a memory map 14. The PowerPC™ instruction set architecture native to CPU 4 is defined in a number of publications such as PowerPC™ User Instruction Set Architecture and PowerPC™ 603 RISC Microprocessor User's Manual (Order No. MPR603UMU-01), both available from IBM Microelectronics. RISC instructions, such as those defined by the PowerPC™ instruction set architecture, can be characterized as having a fixed instruction length (e.g., 32-bits), including only register-to-register and register-to-memory operations and not memory-to-memory operations, and being executed without microcoding, often in one machine cycle.
Each CPU 4 is further adapted in accordance with the present invention to execute guest instructions (e.g., CISC instructions or some other instruction set that is not native to CPU 4) by emulation. As described further hereinbelow, guest instructions 20 are each emulated by fetching and executing one or more semantic routines 19, which each contain two or more native instructions. For example, a guest instruction 20 might be a memory-to-memory CISC instruction such as:
ADD MEM1, MEM2, MEM3
meaning "add the contents of memory location #1 to the contents of memory location #2 and store the result in memory location #3." A semantic routine 19 to emulate this guest CISC instruction might contain the following native RISC instructions:
LOAD REG1, MEM1
LOAD REG2, MEM2
ADD REG3, REG2, REG1
STORE REG3, MEM3
This exemplary semantic routine 19 loads the contents of memory locations #1 and #2 into registers #1 and #2, respectively, adds the contents of registers #1 and #2, stores the result of the addition in register #3, and stores the contents of register #3 to memory location #3. As further illustrated in FIG. 1, memory map 14 preferably further includes semantic routine synthesis code 22, which comprises user level code that can be utilized to synthesize a semantic routine corresponding to a guest instruction if such a semantic routine is not already one of the semantic routines in area 19.
Referring now to FIG. 2, there is illustrated a more detailed block diagram of CPU 4. As depicted, CPU 4 is coupled to system bus 12 via a bus interface unit (BIU) 30 that controls the transfer of information between CPU 4 and other devices that are coupled to system bus 12. BIU 30 is also connected to instruction cache 32 and data cache 34. Both instruction cache 32 and data cache 34 are high-speed caches which enable CPU 4 to achieve a relatively fast access time to instructions and data previously transferred from main memory 6, thus improving the speed of operation of data processing system 2. Instruction cache 32 is further coupled to sequential fetcher 36, which fetches native instructions from instruction cache 32 during each execution cycle. Sequential fetcher 36 transmits branch instructions fetched from instruction cache 32 to branch processing unit (BPU) 38 for execution, but temporarily buffers sequential instructions within instruction queue 40. The sequential instructions stored within instruction queue 40 are subsequently dispatched by dispatch unit 42 to the sequential execution circuitry of CPU 4.
In the depicted illustrative embodiment, the sequential execution circuitry of CPU 4 includes three (or more) execution units, namely, fixed-point unit (FXU) 50, load/store unit (LSU) 52, and floating-point unit (FPU) 54. Each of these three execution units can execute one or more classes of native instructions, and all execution units can operate concurrently during each processor cycle. For example, FXU 50 performs fixed-point mathematical operations such as addition, subtraction, ANDing, ORing, and XORing, utilizing source operands received from specified general purpose registers (GPRs) 60 or GPR rename buffers 62. Following the execution of a fixed-point instruction, FXU 50 outputs the data results of the instruction to GPR rename buffers 62, which provide temporary storage for the data results until the data results are written to at least one of the GPRs 60 during the writeback stage of instruction processing. Similarly, FPU 54 performs floating-point operations, such as floating-point multiplication and division, on source operands received from floating-point registers (FPRs) 64 or FPR rename buffers 66. FPU 54 outputs data resulting from the execution of floating-point instructions to selected FPR rename buffers 66, which temporarily store the data results until the data results are written to selected FPRs 64 during the writeback stage of instruction processing. As its name implies, LSU 52 executes floating-point and fixed-point instructions which either load data from memory (i.e., either data cache 34 or main memory 6) into selected GPRs 60 or FPRs 64 or which store data from a selected one of GPRs 60, GPR rename buffers 62, FPRs 64, or FPR rename buffers 66 to data cache 34 or main memory 6.
CPU 4 employs both pipelining and out-of-order execution of instructions to further improve the performance of its superscalar architecture. Accordingly, multiple instructions can be simultaneously executed by BPU 38, FXU 50, LSU 52, and FPU 54 in any order as long as data dependencies and antidependencies are observed between sequential instructions. In addition, instructions are processed by each of FXU 50, LSU 52, and FPU 54 at a sequence of pipeline stages, including fetch, decode/dispatch, execute, finish and completion/writeback. Those skilled in the art should appreciate, however, that some pipeline stages can be reduced or combined in certain design implementations.
During the fetch stage, sequential fetcher 36 retrieves one or more native instructions associated with one or more memory addresses from instruction cache 32. As noted above, sequential instructions fetched from instruction cache 32 are stored by sequential fetcher 36 within instruction queue 40. In contrast, sequential fetcher 36 removes (folds out) branch instructions from the instruction stream and forwards them to BPU 38 for execution. BPU 38 preferably includes a branch prediction mechanism, which in an illustrative embodiment comprises a dynamic prediction mechanism such as a branch history table, that enables BPU 38 to speculatively execute unresolved conditional branch instructions by predicting whether or not the branch will be taken.
During the decode/dispatch stage, dispatch unit 42 decodes and dispatches one or more native instructions from instruction queue 40 to an appropriate one of sequential execution unit 50, 52, and 54 as dispatch-dependent execution resources become available. These execution resources, which are allocated by dispatch unit 42, include a rename buffer within GPR rename buffers 60 or FPR rename buffers 66 for the data result of each dispatched instruction and an entry in the completion buffer of completion unit 44.
During the execute stage, execution units 50, 52, and 54 execute native instructions received from dispatch unit 42 opportunistically as operands and execution resources for the indicated operations become available. In order to minimize dispatch stalls, each one of the execution units 50, 52, and 54 is preferably equipped with a reservation table that stores dispatched instructions for which operands or execution resources are unavailable.
After the operation indicated by a native instruction has been performed, the data results of the operation are stored by execution units 50, 52, and 54 within either GPR rename buffers 62 or FPR rename buffers 66, depending upon the instruction type. Then, execution units 50, 52, and 54 signal completion unit 44 that the execution unit has finished an instruction. In response to receipt of a finish signal, completion unit 44 marks the completion buffer entry of the instruction specified by the finish signal as complete. Instructions marked as complete thereafter enter the writeback stage, in which instructions results are written to the architected state by transferring the data results from GPR rename buffers 62 to GPRs 60 or FPR rename buffers 66 to FPRs 64, respectively. In order to support precise exception handling, native instructions are written back in program order.
As illustrated in FIG. 2, in order to facilitate the emulation of guest instructions, CPU 4 includes emulation assist unit (EAU) 70, which is shown in greater detail in FIG. 3. As illustrated in FIG. 3, EAU 70 includes a number of special purpose registers (SPRs) 76 for storing, among other things, the logical base address of segments of guest address space containing guest instructions. SPRs 76 include a code segment base register (CSBR) 75 that stores the base address of the current segment and an offset to the current guest instruction. EAU 70 further includes an instruction prefetch unit 74 for fetching guest instructions from data cache 34 and an instruction buffer 72 for temporarily storing guest instructions retrieved from data cache 34. In addition, EAU 70 includes an instruction decoder 78 for decoding guest instructions, a guest branch unit 80 for executing guest branch instructions, tag generation unit 90, which generates opcode tags for each sequential guest instruction, guest cache 92, which stores a semantic routine (SR) offset in association with each of a plurality of opcode tags, a guest instruction queue 100 for storing information associated with guest instructions, and a guest dispatch unit 94 that provides SR addresses to sequential fetcher 36.
Referring now to FIG. 4, there is illustrated a more detailed view of guest instruction queue 100, which provides a synchronization point between the guest instruction stream and native instruction stream. As will become apparent from the following description, the provision of guest instruction queue 100 permits guest instructions emulated by CPU 4 to be pre-processed so that the latency associated with the various emulation pipeline stages can be overlapped.
In the illustrative embodiment, guest instruction queue 100 contains five entries 110, which each include the following fields 112-134:
VI : indicates whether the content of immediate field 116 is valid
VO : indicates whether the content of SR offset field 118 is valid
Immediate: stores immediate data that is specified by the guest instruction and is passed as a parameter to the corresponding semantic routine
SR offset: offset between the base address of the guest instruction (which is maintained in CSBR 75) and the corresponding semantic routine
L: length of semantic routine in native instructions
GIP: offset pointer from CSBR 75 to guest instruction in guest address space
DE: indicates whether two guest instruction queue entries (and two semantic routines) are utilized in the emulation of a single guest instruction
S: indicates whether the guest instruction is in a speculative (i.e., predicted) execution path in the guest instruction stream
BBID: unique basic block ID number sequentially assigned to each semantic routine from pool of BBIDs
GCR: guest condition register that indicates conditions (e.g., equal/not equal) that may be utilized to predict subsequent guest branch instructions
CRM: guest condition register mask that indicates which bits in the GCR field will be altered by the guest instruction
VB : indicates whether the semantic routine native instruction that will set the value of GCR field 130 has executed
As depicted in FIG. 4, guest instruction queue 100 has an associated emulation instruction pointer register (EIPR) 140, preferably implemented as a software-accessible special purpose register (SPR), which contains the offset from the base address specified by CSBR 75 to the current guest instruction that is being interpreted. EAU 70 updates the contents of EIPR 140 in response to the execution of a newly-defined "guest dispatch completion" (gdispc) instruction in the native instruction set and in response to the execution of a guest branch instruction by guest branch unit 80 without invoking a semantic routine. Another special purpose register, emulation instruction pointer next (EIP-- NEXT) register 142, contains the offset from the base address specified in CSBR 75 to the next guest instruction that will be interpreted. EAU 70 updates the contents of EIP-- NEXT register 142 when a gdispc instruction is executed, when a special move to SPR instruction (i.e., mtspr EIP-- NEXT!) is executed having EIP-- NEXT register 142 as a target, and when a guest branch or guest NOOP instruction is emulated without invoking a semantic routine. These two offset pointers permit the state of the guest instruction stream to be easily restored following a context switch, for example, when returning from an exception. That is, by saving both the current EIP and the next EIP, the guest instruction under emulation at the time of the interrupt, which is pointed to by the current EIP, does not need to be reexecuted to compute the next EIP if both the current EIP and next EIP are saved.
Guest instruction queue 100 also has an associated predicted taken flag (PTF) 144, which indicates whether an unresolved guest branch instruction was predicted as taken and therefore whether sequential guest instructions marked as speculative (i.e., S field 126 is set) are within the target or sequential execution path.
Xflags 150 is an architected condition register for which GCR 130 in each of entries 110 is a "renamed" version. When an entry 110 is removed from the bottom of guest instruction queue 100, the bits within Xflags 150 specified by CRM 132 in that entry 110 are updated by the corresponding bit values in GCR 130. Xflags 150, GCR fields 130, CRM fields 132, and VB fields 134 (and the associated access circuitry), which are identified in FIG. 3 simply as guest flags 83, can be referenced by guest branch unit 80 to resolve guest branch instructions as described further herein below.
In cases in which each guest instruction is emulated by executing a single semantic routine, each guest instruction is allocated only a single entry 110 within guest instruction queue 100. However, in some circumstances more than one entry 110 may be allocated to a single sequential guest instruction. For example, in an embodiment in which the guest instructions are x86 instructions, many sequential guest instruction comprise two distinct portions: a first portion that specifies how the addresses of the source(s) and destination of the data are determined and a second portion that specifies the operation to be performed on the data. In such cases, a first semantic routine is utilized to emulate the portion of instruction execution related to the determination of the data source and destination addresses and a second semantic routine is utilized to emulate the portion of instruction execution related to performing an operation on the data. Accordingly, the guest instruction is allocated two entries 110 in guest instruction queue 100--a first entry containing information relevant to the first semantic routine and a second entry containing information relevant to the second semantic routine. Such dual entry guest instructions are indicated within guest instruction queue 100 by setting DE (dual entry) field 124 in the older (first) of the two entries 110. Setting the DE field ensures that both entries 110 will be retired from guest instruction queue 100 when both semantic routines have completed (i.e., in response to a gdispc instruction terminating the second semantic routine). The emulation of guest instructions utilizing two semantic routines advantageously permits some semantic routines to be shared by multiple guest instructions, thereby reducing the overall memory footprint of semantic routines 19.
The ordering of the entries 110 in guest instruction queue 100 is maintained by current entry pointer 95, which points to the oldest entry in guest instruction queue 100, and next entry pointer 97, which points to the next oldest entry. In response to a fetch or completion of a gdispc instruction, the guest instruction queue entry indicated by current entry pointer 95 is retired and both current entry pointer 95 and next entry pointer 97 are updated. Thus, entries are consumed from the "bottom" and inserted at the "top" of guest instruction queue 100.
With reference now to FIGS. 2-4, the operation of EAU 70 will now be described.
To initialize EAU 70 for emulation, the address offset to the first guest instruction to be emulated is loaded into EIP-- NEXT register 142 by executing a native move to SPR (mtspr) instruction having EIP-- NEXT register 142 as a target (i.e., mtspr EIP-- NEXT! in the PowerPC™ instruction set). In a preferred embodiment, this native instruction is equivalent to a guest branch always instruction since the function of such a guest branch instruction would be to load EIP-- NEXT register 142 with a pointer to the next guest instruction to be executed (i.e., the offset value within CSBR 75). VI field 112 and VO field 114 of the oldest entry 110 in guest instruction queue 100 are both cleared in response to the mtspr EIP-- NEXT! instruction. Thereafter, prefetching of guest instruction from data cache 34 can be triggered utilizing a gdispc instruction.
As an aside, VI field 112 and VO field 114 of the oldest entry 110 in guest instruction queue 100 are also cleared in response to mtspr EIP! and mtspr CSBR! instructions, as well as when a guest branch instruction is resolved as mispredicted.
As noted above, prefetching of guest instructions from data cache 34 is triggered by placing a gdispc instruction in the native instruction stream. When fetched by sequential fetcher 36, the gdispc instruction acts as an interlock that stalls fetching by sequential fetcher 36 until VO field 114 of the oldest entry 110 in guest instruction queue 100 is set. In response to the stall of sequential fetcher 36, instruction prefetch unit 74 in EAU 70 makes a fetch request to data cache 34 for the guest instruction at the address specified by the base address and offset contained in CSBR 75.
Guest instructions supplied by data cache 34 in response to fetch requests from instruction prefetch unit 74 are temporarily stored in instruction buffer 72 and then loaded one at a time into instruction decoder 78, which at least partially decodes each guest instruction to determine the instruction length, whether the guest instruction is a branch instruction, and the immediate data of the guest instruction, if any.
If the guest instruction decoded by instruction decoder 78 is a sequential instruction, at least the oldest unused entry 110 of guest instruction queue 100 is allocated to the guest instruction. As illustrated in FIG. 3, instruction decoder 78 then stores the immediate data, if any, and the offset pointer to the guest instruction into immediate field 116 and GIP field 122, respectively, of the allocated entry 110. In response to instruction decoder 78 loading immediate data into immediate field 116, VI field 112 is set.
The sequential guest instruction is then forwarded from instruction decoder 78 to tag generation unit 90, which converts the guest instruction into a unique opcode tag. According to a preferred embodiment, different opcode tags are utilized not only to distinguish between different guest instructions, but also to distinguish between identical guest instructions that access different registers. Thus, different opcode tags are utilized for guest divide (gdiv) and guest multiply (gmult) instructions, as well for gmult R3,R2,R1 and gmult R4,R2,R1 instructions, which target different registers. The unique opcode tag produced by tag generation unit 90 forms an index into guest cache 92 that selects a particular cache entry containing an offset utilized to determine the effective address of the semantic routine corresponding to the guest instruction.
As indicated, in the illustrative embodiment, guest cache 92 comprises a four-way set associative cache having 256 lines that each contain four 4 Kbyte entries. A miss in guest cache 92 generates a user level interrupt, which is serviced by executing semantic routine synthesis code 22. As described above, semantic routine synthesis code 22 synthesizes a semantic routine corresponding to the guest instruction from native instructions and stores the semantic routine in area 19 of memory map 14. The offset from the base address of the guest instruction to the location of the newly synthesized semantic routine is then stored in guest cache 92 for subsequent recall. Because guest instruction sets are typically fairly stable, it is typical for guest cache 92 to achieve hit rates above 99%.
In response to the semantic routine (SR) offset being located (or stored) in guest cache 92, the SR offset is stored in SR offset field 118 of the allocated entry 110, thereby causing VO field 114 to be marked as valid. By the time VO is set to signify that the content of SR offset field 118 is valid, L field 120, DE field 124, S field 126, BBID field 128, and CRM field 132 are also valid within the allocated entry 110. As noted above, GCR field 130 is indicated as valid separately by VB field 134.
When VO field 114 of the oldest entry 110 in guest instruction queue 100 is set by the processing of the first guest instruction in EAU 70 at emulation startup, the value in EIP-- NEXT register 142 is transferred to EIPR 140, signifying that the oldest (i.e., first) instruction in guest instruction queue 100 is the guest instruction currently being processed. In response to this event, guest dispatch unit 94 transmits the SR offset in SR offset field 118 to sequential fetcher 36, which begins to fetch native instructions within the semantic routine corresponding to the first guest instruction. As illustrated in FIG. 4, EAU 70 tracks the guest instruction for which the semantic routine is being fetched utilizing fetch PTR 152 in guest dispatch unit 94.
If instruction decoder 78 determines that a guest instruction is a branch instruction, the guest branch instruction is forwarded to guest branch unit 80 for processing after allocating the guest branch instruction the oldest unused entry 110 of guest instruction queue 100. (In an alternative embodiment, guest instruction ordering can be maintained without assigning guest instruction queue entries to guest branch instructions). Guest branch unit 80 processes the guest branch instruction according to the method illustrated in the logical flowchart of FIG. 5.
With reference now to FIG. 5, the process begins at block 200 in response to receipt of a guest branch instruction by guest branch unit 80. The process proceeds from block 200 to block 210, which depicts a determination of whether or not the guest branch instruction is an unconditional absolute or relative branch instruction such as the x86 JUMP instruction. If so, the process proceeds to block 212, which illustrates guest branch unit 80 calculating the target address utilizing an internal hardware adder. The target address is passed to instruction prefetch unit 74, which forwards the target address to data cache 34 to initiate fetching of guest instructions at the target address, as illustrated at block 214. The process then passes to block 260 and terminates.
Referring again to block 210, in response to a determination that the guest branch instruction is not an unconditional absolute or relative branch, the process passes to block 220, which depicts a determination of whether or not the guest branch instruction is a conditional branch that depends upon the state of at least one condition register bit. If so, the process passes to block 222, which illustrates guest branch instruction examining the entry 110 immediately preceding the guest branch instruction in program order. In particular, as illustrated at block 224, guest branch unit 80 determines whether the bit or bits in CRM field 132 corresponding to the bit(s) upon which the branch depends are set. If not, the process passes to block 232, which depicts a determination of whether guest instruction queue 100 contains an additional entry 110 previous to the one being examined. If so, the process returns to block 222, which has been described. However, if no additional previous entry 110 is present in guest instruction queue 100, the process proceeds from block 232 to block 234, which illustrates guest branch unit 80 resolving the branch by reference to Xflags 150. Thereafter, guest branch unit 80 calculates a fetch address and transmits the fetch address to data cache 34 via instruction prefetch unit 74. The process then terminates, as illustrated at block 280.
Returning to block 224, in response to a determination that the appropriate bits of CRM field 132 are set within the entry 110 being examined, a determination is made at block 226 whether or not VB field 134 of that entry 110 is marked valid (i.e., whether the bits in GCR field 130 have been set by the semantic routine). If VB field 134 is marked valid, the process proceeds to block 228, which illustrates guest branch unit resolving the guest branch instruction with reference to GCR field 130. The process then proceeds to block 229, which depicts guest branch unit 80 calculating the sequential or target address (depending on whether the branch was resolved as taken or not taken) and passing the address to data cache 34 via instruction prefetch unit 74. Thereafter, the process terminates, as illustrated at block 216.
Returning to block 226, in response to a determination that VB field 134 is not marked valid in the entry 110 being examined, the process proceeds to block 230. Block 230 depicts guest branch unit 80 predicting the branch by reference to conventional branch history table (BHT) 82. PTF 144 is set to 1 to indicate that the branch was predicted taken and is cleared (set to 0) to indicated that the branch was predicted not taken. The process then proceeds from block 230 to block 260, which illustrates guest branch unit 80 calculating the address of the predicted path and transmitting the address to data cache 34 via instruction prefetch unit 74. In order to permit recovery from misprediction, the address of the non-predicted path is stored in other path register 81, as illustrated at block 262. As depicted at block 264, all subsequent guest instructions are marked as speculative while the guest branch instruction remains unresolved by setting S field 126 in the appropriate entries 110 of guest instruction queue 100. The process thereafter terminates at block 280.
The gdispc instruction that terminates the last non-speculative semantic routine 50 cannot complete (speculatively) because the semantic routine that its offset specifies is marked as speculative in guest instruction queue 100. When the GCR field 130 upon which the conditional branch depends becomes valid, a branch taken flag (BTF) is generated that indicates whether the branch should have been taken or not. If the BTF has the same value as PTF 144, then the branch was correctly predicted. In this case, speculative fields 126 are cleared and the operation of EAU 70 proceeds normally.
If, however, the BTF does not have the same value as PTF 144, the branch was mispredicted and EAU 70 must return to the correct emulation path. Thus, on completion of the native instruction that set the GCR field 130 upon which the branch depends, EIP-- NEXT register 142 is updated with the correct address (which was saved in other path register 81 at block 262). In addition, all entries 110 marked as speculative are flushed from guest instruction queue 100, and the corresponding semantic routine native instructions are identified by BBID and flushed from CPU 4. The speculative instructions flushed from the native instruction stream include the gdispc instruction for the last semantic routine because the gdispc instruction was still marked speculative. Of course, CPU 4 allows all non-speculative native instructions to complete. Thereafter, CPU 4 restarts by fetching sequentially from an address equal to the last non-speculative instruction address (e.g., which is specified in the PowerPC™ Instruction Address Register (IAR)) plus the length of a native instruction (which is the address of the gdispc instruction that was flushed). This gdispc instruction will cause EAU 70 to fetch guest instructions from the correct address specified in EIP-- NEXT register 144. In this manner, both EAU 70 and CPU 4 are restored following the misprediction of a guest branch instruction.
Referring again to block 220, in response to a determination that the guest branch instruction is not a conditional branch instruction that depends upon the state of condition register bits, the process proceeds to block 240. Block 240 depicts a determination of whether or not the guest branch instruction represents an unconditional register indirect branch (e.g., a CALL or RETURN) instruction. If not, the process proceeds to block 270, which illustrates guest branch unit 80 handling the guest branch instruction another method consistent with the type of the guest branch instruction. However, in response to a determination at block 240 that the guest branch instruction is an unconditional register indirect branch, the process proceeds to block 242. Block 242 illustrates a determination of whether or not the unconditional register indirect branch is a CALL instruction. If so, the process then passes to block 244, which depicts a EAU 70 creating an entry 110 for the CALL instruction in guest instruction queue 100. The immediate data of the CALL instruction is stored in immediate field 116 of the allocated entry 110. Thereafter, a semantic routine corresponding to the CALL instruction is executed by CPU 4. The semantic routine corresponding to the CALL instruction calculates the address of a speculative next guest instruction, pushes the address of the speculative next guest instruction on a multiple-entry push/pop stack in memory, and branches to the guest instruction address specified in immediate field 116. The process then terminates at block 280 upon completion of the CALL semantic routine. Thus, an exemplary semantic routine for a CALL instruction is as follows:
(1) code to calculate the address of the speculative next guest instruction
(2) code to push the address of the speculative next guest instruction on the push/pop stack
(3) a guest branch to the guest instruction address specified in the immediate field of the CALL
Returning to block 242, in response to a determination that the unconditional register indirect branch instruction is not a CALL instruction, a determination is made that the branch instruction is a RETURN instruction. The process then proceeds to block 250, which depicts EAU 70 creating an entry 110 in guest instruction queue 100 for the RETURN instruction. A semantic routine corresponding to the RETURN instruction is then executed as illustrated at block 252. The semantic routine pops the top entry off the stack to obtain the speculative next instruction address pushed on the stack by the most recent CALL and buffers the speculative next instruction address in immediate field 116 of the RETURN instruction's entry. This address is forwarded to data cache 34 via instruction prefetch unit 74 to initiate speculative fetching of guest instructions. Of course, entries 110 corresponding to speculatively fetched instructions are marked as speculative by setting S field 127. The RETURN semantic routine also calculates the address of the actual emulation path and executes a guest branch instruction to place the correct fetch address in EIPR-- NEXT register 142. Thus, an exemplary semantic routine for the RETURN instruction is as follows:
(1) code to pop the speculative next instruction address off of the stack
(2) code to calculate the address of the correct emulation path
(3) guest branch to load the address of the correct emulation path into EIPR-- NEXT register 142
As illustrated at block 254, following the completion of the guest branch instruction that loads the address of the correct emulation path into EIPR-- NEXT register 142, EAU 70 compares the address in EIP-- NEXT register 142 to the speculative next instruction address in immediate field 116. If the addresses match, the guest branch was correctly predicted, and speculative field 126 for each entry 110 subsequent to the RETURN instruction is reset. If the addresses do not match, the speculative instructions are flushed from both guest instruction queue 100 and the native instruction pipeline of CPU 4. The speculative instructions flushed from the native instruction pipeline include the gdispc instruction that concludes the RETURN semantic routine since that instruction initiates execution of speculative native instructions. In addition, the stack is reset to empty.
As discussed above, CPU 4 restarts the native instruction stream by fetching sequentially from an address equal to the last non-speculative instruction address (e.g., which is specified in the PowerPC™ Instruction Address Register (IAR)) plus the length of a native instruction (which is the address of the gdispc instruction that was flushed). The non-speculative execution of this gdispc instruction will cause EAU 70 to fetch guest instructions from the correct address specified in EIP-- NEXT register 142 and permit the entries 110 corresponding to the CALL and RETURN instructions to be retired from guest instruction queue 100. In this manner, both EAU 70 and CPU 4 are restored following the misprediction.
Semantic routine (i.e., native) instructions that are within the standard instruction set of CPU 4 are processed by CPU 4 as described above with reference to FIG. 2. Special instructions inserted into the native instruction set to support guest instruction emulation are handled as described below.
In order to connect guest instructions into a continuous guest instruction stream, a gdispc instruction is preferably inserted at the end of each semantic routine, if the guest instructions are each represented by a single semantic routine, or at the end of the last semantic routine corresponding to the guest instruction, if the guest instruction is emulated by multiple semantic routines. The gdispc instruction is preferably defined as a special form of a native branch instruction so that when fetched from instruction cache 32 by sequential fetcher 36 a gdispc instruction is folded out of the native instruction stream and passed to BPU 38. In response to detecting the gdispc instruction, BPU 38 asserts signal line 96. Guest dispatch unit 94 responds to the assertion of signal line 96 by removing all of the entries 110 corresponding to the current guest instruction from guest instruction queue 100 and by passing the semantic routine offset stored within the next entry to sequential fetcher 36 via signal lines 98. As described above, sequential fetcher 36 then computes the effective address (EA) of the semantic routine corresponding to the next guest instruction by adding the semantic routine offset to the guest instruction's base address and fetches the semantic routine from memory for execution by CPU 4.
When multiple semantic routines are utilized to emulate a single guest instruction, semantic routines other than the final semantic routine are terminated by a "guest dispatch prolog completion" (gdispp) instruction, which is a variant of the gdispc instruction. In general, the gdispp instruction is processed like the gdispc instruction. For example, like the gdispc instruction, the gdispp instruction triggers the fetching of the next semantic routine. In addition, VO field 114 within the guest instruction queue entry 110 corresponding to the semantic routine containing a gdispp instruction must be set in order for the gdispp instruction to be executed. However, in contrast to the processing of a gdispc instruction, the completion of a gdispp instruction does not trigger the removal of an entry 110 from guest instruction queue 100 or the updating of EIPR 140 and EIP-- NEXT register 142.
Another special instruction inserted into the native instruction set as a form of add instruction is the guest add immediate prolog word or half word! (gaddpi w,h!) instruction. The function of the gaddpi w,h! instruction is to add the immediate data specified in the first of two guest instruction queue entries allocated to a guest instruction with the value in a specified GPR 60 and store the sum in another GPR 60. Accordingly, VI field 112 for the first entry 110 must be set in order to permit the corresponding semantic routine to execute.
A similar guest add immediate completion word or half word! (gaddci w,h!) instruction is utilized to add the immediate data stored in the second of two guest instruction queue entries allocated to a guest instruction with value of a specified GPR 60 and store the sum in another GPR 60. VI field 112 for the second entry 110 must be set in order for the corresponding semantic routine to execute.
In response to either a guest instruction or native instruction exception, a non-architected exception flag is set that disables guest instruction fetching by instruction prefetch unit 74. At a minimum, the context of the guest instruction stream is saved during interrupt/exception handling and restored upon returning from the interrupt/exception by saving the contents of EIPR 140 and EIP-- NEXT register 142 in SPRs 76. As a practical matter, it is preferable to save the entire bottom entry 110 of guest instruction queue 100 in SPRs 76 in order to expedite the restart of emulation following the interrupt/exception.
Prefetching of guest instructions from data cache 34 following a return from interrupt can be triggered by the execution of either a gaddpi w,h! instruction or gaddci w,h! instruction, which interlocks with and stalls sequential fetcher 36 until VI field 112 of the appropriate entry 110 in guest instruction queue 100 is set. Guest instruction prefetching may also be restarted through the execution of a gdispc instruction or gdispp instruction. The execution of a gdisp p,c! or gadd p,c!i w,h! instruction clears the exception flag.
While an illustrative embodiment of the present invention has been particularly shown and described, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope hereof. For example, while the present invention has been described with reference to embodiments in which the guest instructions emulated within CPU 4 are x86 CISC instructions, it should be understood that other guest instructions could alternatively be utilized.
|Brevet cité||Date de dépôt||Date de publication||Déposant||Titre|
|US5313634 *||28 juil. 1992||17 mai 1994||International Business Machines Corporation||Computer system branch prediction of subroutine returns|
|US5606582 *||24 juin 1996||25 févr. 1997||Commissariat A L'engergie Atomique||Device for the automatic disconnection of a control rod and a nuclear reactor absorber cluster|
|US5634119 *||6 janv. 1995||27 mai 1997||International Business Machines Corporation||Computer processing unit employing a separate millicode branch history table|
|US5664136 *||9 févr. 1996||2 sept. 1997||Advanced Micro Devices, Inc.||High performance superscalar microprocessor including a dual-pathway circuit for converting cisc instructions to risc operations|
|US5768576 *||29 oct. 1996||16 juin 1998||Intel Corporation||Method and apparatus for predicting and handling resolving return from subroutine instructions in a computer processor|
|Brevet citant||Date de dépôt||Date de publication||Déposant||Titre|
|US5995743 *||22 sept. 1997||30 nov. 1999||International Business Machines Corporation||Method and system for interrupt handling during emulation in a data processing system|
|US6122638 *||26 nov. 1997||19 sept. 2000||International Business Machines Corporation||Object-oriented processor and method for caching intermediate data in an object-oriented processor|
|US6163764 *||12 oct. 1998||19 déc. 2000||Intel Corporation||Emulation of an instruction set on an instruction set architecture transition|
|US6256784 *||14 août 1998||3 juil. 2001||Ati International Srl||Interpreter with reduced memory access and improved jump-through-register handling|
|US6356997 *||4 oct. 2000||12 mars 2002||Hitachi, Ltd.||Emulating branch instruction of different instruction set in a mixed instruction stream in a dual mode system|
|US6701426 *||19 oct. 1999||2 mars 2004||Ati International Srl||Switching between a plurality of branch prediction processes based on which instruction set is operational wherein branch history data structures are the same for the plurality of instruction sets|
|US7092869 *||14 nov. 2001||15 août 2006||Ronald Hilton||Memory address prediction under emulation|
|US7171546||23 mai 2002||30 janv. 2007||Adams Phillip M||CPU life-extension apparatus and method|
|US7331040||6 févr. 2003||12 févr. 2008||Transitive Limted||Condition code flag emulation for program code conversion|
|US7542963 *||14 avr. 2004||2 juin 2009||American Power Conversion Corporation||Method and system for journaling and accessing sensor and configuration data|
|US7647489 *||14 mars 2005||12 janv. 2010||Arm Limited||Function calling mechanism with embedded index for a handler program and an embedded immediate value for passing a parameter|
|US7779407||29 mai 2002||17 août 2010||Adams Phillip M||Computer-hardware, life-extension apparatus and method|
|US8024555||14 déc. 2007||20 sept. 2011||International Business Machines Corporation||Condition code flag emulation for program code conversion|
|US8301434 *||18 sept. 2009||30 oct. 2012||International Buisness Machines Corporation||Host cell spatially aware emulation of a guest wild branch|
|US8428930||18 sept. 2009||23 avr. 2013||International Business Machines Corporation||Page mapped spatially aware emulation of a computer instruction set|
|US8447583||18 sept. 2009||21 mai 2013||International Business Machines Corporation||Self initialized host cell spatially aware emulation of a computer instruction set|
|US8566292||23 juil. 2004||22 oct. 2013||Schneider Electric It Corporation||Method and system for journaling and accessing sensor and configuration data|
|US8621443 *||20 juil. 2012||31 déc. 2013||Sony Computer Entertainment Inc.||Processor emulation using speculative forward translation|
|US8768683||19 avr. 2013||1 juil. 2014||International Business Machines Corporation||Self initialized host cell spatially aware emulation of a computer instruction set|
|US8949106||18 sept. 2009||3 févr. 2015||International Business Machines Corporation||Just in time compiler in spatially aware emulation of a guest computer instruction set|
|US8990536||1 juin 2011||24 mars 2015||Schneider Electric It Corporation||Systems and methods for journaling and executing device control instructions|
|US9158566||13 nov. 2012||13 oct. 2015||International Business Machines Corporation||Page mapped spatially aware emulation of computer instruction set|
|US9436476||11 oct. 2013||6 sept. 2016||Soft Machines Inc.||Method and apparatus for sorting elements in hardware structures|
|US9582322||10 déc. 2013||28 févr. 2017||Soft Machines Inc.||Method and apparatus to avoid deadlock during instruction scheduling using dynamic port remapping|
|US9627038||17 mars 2014||18 avr. 2017||Intel Corporation||Multiport memory cell having improved density area|
|US20030093776 *||14 nov. 2001||15 mai 2003||Ronald Hilton||Memory address prediction under emulation|
|US20030221035 *||23 mai 2002||27 nov. 2003||Adams Phillip M.||CPU life-extension apparatus and method|
|US20030225929 *||29 mai 2002||4 déc. 2003||Adams Phillip M.||Computer-hardware, life-extension apparatus and method|
|US20040158822 *||6 févr. 2003||12 août 2004||Sandham John H.||Condition code flag emulation for program code conversion|
|US20040236718 *||14 avr. 2004||25 nov. 2004||Netbotz, Inc.||Method and system for journaling and accessing sensor and configuration data|
|US20040260674 *||23 juil. 2004||23 déc. 2004||Netbotz, Inc.||Method and system for journaling and accessing sensor and configuration data|
|US20050210226 *||14 mars 2005||22 sept. 2005||Arm Limited||Function calling mechanism|
|US20060155974 *||7 janv. 2005||13 juil. 2006||Moyer William C||Data processing system having flexible instruction capability and selection mechanism|
|US20070118725 *||23 janv. 2007||24 mai 2007||Adams Phillip M||CPU life-extension apparatus and method|
|US20080177985 *||14 déc. 2007||24 juil. 2008||Transitive Limited||Condition code flag emulation for program code conversion|
|US20080195845 *||14 avr. 2008||14 août 2008||Freescale Semiconductor, Inc.||Data processing system having flexible instruction capability and selection mechanism|
|US20110071557 *||18 sept. 2009||24 mars 2011||Dlugos Jr Daniel F||Symmetrical drive system for an implantable restriction device|
|US20110071813 *||18 sept. 2009||24 mars 2011||International Business Machines Corporation||Page Mapped Spatially Aware Emulation of a Computer Instruction Set|
|US20110071814 *||18 sept. 2009||24 mars 2011||International Business Machines Corporation||Self Initialized Host Cell Spatially Aware Emulation of a Computer Instruction Set|
|US20110071815 *||18 sept. 2009||24 mars 2011||International Business Machines Corporation||Host Cell Spatially Aware Emulation of a Guest Wild Branch|
|US20110071816 *||18 sept. 2009||24 mars 2011||International Business Machines Corporation||Just In Time Compiler in Spatially Aware Emulation of a Guest Computer Instruction Set|
|US20120284011 *||20 juil. 2012||8 nov. 2012||Sony Computer Entertainment Inc.||Processor emulation using speculative forward translation|
|US20140281388 *||14 mars 2014||18 sept. 2014||Soft Machines, Inc.||Method and Apparatus for Guest Return Address Stack Emulation Supporting Speculation|
|US20160048679 *||18 sept. 2014||18 févr. 2016||Bitdefender IPR Management Ltd.||Systems And Methods for Exposing A Current Processor Instruction Upon Exiting A Virtual Machine|
|US20160132331 *||12 nov. 2014||12 mai 2016||Mill Computing, Inc.||Computer Processor Employing Instruction Block Exit Prediction|
|CN100444107C||30 mars 2005||17 déc. 2008||阿尔特拉公司||Optimized processors and instruction alignment|
|CN101387951B||30 mars 2005||17 juil. 2013||阿尔特拉公司||Public subcircuit processors with instructions of different kinds|
|DE10161505A1 *||14 déc. 2001||3 juil. 2003||Fujitsu Siemens Computers Gmbh||Method for tracking jumps in the emulation of a processor, with jump commands made relative to the base register, thus improving the efficiency of development of new processor architectures|
|EP2972798A4 *||13 mars 2014||19 avr. 2017||Soft Machines Inc||Method and apparatus for guest return address stack emulation supporting speculation|
|WO2000022524A1 *||6 oct. 1999||20 avr. 2000||Intel Corporation||Emulation of an instruction set on an instruction set architecture transition|
|Classification aux États-Unis||712/209, 703/26, 712/23, 712/211, 712/242, 712/239|
|Classification coopérative||G06F9/3017, G06F9/45504|
|22 sept. 1997||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KAHLE, JAMES A.;MALLICK, SOUMMYA;REEL/FRAME:008813/0075;SIGNING DATES FROM 19970915 TO 19970917
|16 juil. 2002||FPAY||Fee payment|
Year of fee payment: 4
|30 juin 2006||FPAY||Fee payment|
Year of fee payment: 8
|16 juil. 2010||FPAY||Fee payment|
Year of fee payment: 12