Embodiments of this invention relate to emulation of a target computer platform on a host computer platform and more particularly to invalidation of blocks of translated code in emulation of the target platform.
The process of emulating the functionality of a first computer platform (the “target system”) on a second computer platform (the “host system”) so that the host system can execute programs designed for the target system is known as “emulation.” Emulation has commonly been achieved by creating software that converts program instructions designed for the target platform (target code instructions) into the native-language of a host platform (host instructions), thus achieving compatibility. More recently, emulation has also been realized through the creation of “virtual machines,” in which the target platform's physical architecture—the design of the hardware itself—is replicated via a virtual model in software.
Two main types of emulation strategies currently are available in the emulation field. The first strategy is known as “interpretation”, in which each target code instruction is decoded in turn as it is addressed, causing a small sequence of host instructions then to be executed that are semantically equivalent to the target code instruction. The main component of such an emulator is typically a software interpreter that converts each instruction of any program in the target machine language into a set of instructions in the host machine language, where the host machine language is the code language of the host computer on which the emulator is being used. In some instances, interpreters have been implemented in computer hardware or firmware, thereby enabling relatively fast execution of the emulated programs.
The other main emulation strategy is known as “translation”, in which the target instructions are analyzed and decoded. This is also referred to as “recompilation” or “cross-compilation”. It is well known that the execution speed of computer programs is often dramatically reduced by interpreters. It is not uncommon for a computer program to run ten to twenty times slower when it is executed via emulation than when the equivalent program is recompiled into target machine code and the target code version is executed. Due to the well known slowness of software emulation by interpretation, a number of products have successfully improved on the speed of executing source applications by translating portions of the target program at run time into host machine code, and then executing the recompiled program portions. While the translation process may take, e.g., 50 to 100 machine or clock cycles per instruction of the target code, the greater speed of the resulting host machine code is, on average, enough to improve the overall speed of execution of most source applications.
Emulation of the target platform by translation relies on blocks of translated instructions. As long as the emulated target platform memory including the original target platform code is unchanged, the target platform emulation can execute the corresponding translated instructions safely. However, certain sections of target code may be modified during normal operation of the target platform. As a result, a corresponding area of the target system memory is changed when the code is modified during operation. To emulate this, the host system may respond to a change in an area of memory by invalidating the corresponding translated target platform instructions. The potentially modified target platform instructions must then be retranslated. However, not all of the code in memory may have been changed and retranslating whole sections of previously translated code when only a few blocks are invalid can take up extra time and processor resources.
Thus, there is a need in the art, for a method and system for translation block invalidation that overcomes the above disadvantage.
The disadvantages associated with the prior art are overcome by embodiments of the present invention directed to invalidating blocks of translated code in emulation of a target system on a host system in which one or more components of the target system are emulated by translation of target system code. One or more blocks of target system code are translated by the host system to produce one or more corresponding blocks of translated code. The host system uses one or more native target system instructions as hints to invalidate or potentially invalidate one or more blocks of translated code. Blocks containing such hints cause the host system to mark some or all of the one or more blocks of translated code as potentially invalid. The potentially invalid blocks may be re-translated immediately. Alternatively, the potentially invalid blocks may be checked to see if the code in these blocks has been modified. If the code has been modified, corresponding blocks of target code may be re-translated.
The teachings of the present invention can be readily understood by considering the following detailed description in conjunction with the accompanying drawings, in which:
Although the following detailed description contains many specific details for the purposes of illustration, anyone of ordinary skill in the art will appreciate that many variations and alterations to the following details are within the scope of the invention. Accordingly, the exemplary embodiments of the invention described below are set forth without any loss of generality to, and without imposing limitations upon, the claimed invention.
In embodiments of the invention certain native EE instructions can be used as hints to invalidate or potentially invalidate one or more blocks of instructions and initiate a new translation. In response to these instructions, such as an EE cache invalidate instruction, the EE emulation marks all or some of the translated blocks of code as invalid and begins retranslation.
Embodiments of the present invention may be generally understood by reference to the software block diagram of
Embodiments of the present invention make use of certain native instructions in the target system code 11 as pre-hints to whether a given block 13, 13′ of target system code 11 is no longer valid as a result of a modification of the underlying target system code 11. For example, in normal operation the target system may generate a cache invalidation instruction when a block 13′ of target system code has been modified during execution of the target system program 11. The cache invalidation instruction provides a pre-hint 19 that the target system block 13′ may have been modified since it was translated and is therefore no longer valid. Other types of instructions that may be used as pre-hints include direct memory access from other processors or local memory in the target system, external events, such as external modification of random access memory (RAM) and software patches. When an invalidation pre-hint instruction 19 is detected in a target system code block 13′ the translator 12 inserts an event check instruction into the corresponding block of translated code 15′. The translator 12 may also generate a hash or checksum 16 for the target system code block 13′ upon translation.
The event check instruction may take the form of a call to a handler 18 to perform a validation and checksum compare 20 on the target system code block 13′ containing the pre-hint instruction 19.
The checksum compare routine 20 accounts for the situation in which a block 13′ contains a pre-hint instruction yet is still valid. The checksum routine 20 compares the hash or checksum 16 generated upon translation with a current checksum for the target system code block 13′. If the two hashes/checksums are the same, the translated block 15′ has not been modified and the translated block 15′ is a valid block 26. Otherwise, the target system code block 13′ has been modified and is an invalid block 31. Valid translated blocks 26 may be executed at 28 by the block handler 14. Invalid translated blocks 31 or groups of blocks that are linked to an invalid block may be deleted at 33 and the memory space for that block may be overwritten. Overwriting the memory space may include marking the memory space as available for overwriting and subsequently overwriting the space with a new block of translated code 17. The block handler 14 then requests a new translation of modified target system code block 13′.
The translator 12, block handler 14 and checksum compare routine 20 may be configured to check and/or re-translate the invalidated or potentially invalidated blocks of translated code in any suitable order. By way of example, the blocks 15, 15′ may be checked, validated and/or re-translated in most recently used (MRU) order.
If only some translated blocks 15, 15′ are potentially invalidated (e.g., because they contain pre-hints 19), the valid blocks 15 may be executed until a potentially invalid block 15′. The checksum compare routine 20 may then check whether the potentially invalid block 15′ is invalid. Alternatively, the potentially invalid block 15′ may be re-translated without checking. If all of the blocks 15, 15′ of translated code 17 are potentially invalidated, execution of the translated code in the cache 17 may be halted and the full resources of a host system processor may be devoted to verification and/or retranslation of the target system code underlying translated blocks 15, 15′.
In embodiments of the invention, the block handler 14 may generate a pointer table 24 that maps program counter values 22 for blocks of target system code to corresponding blocks of translated code. When translated blocks 15′ are invalidated, one or more pointers in the pointer table 24 may be set to point to memory locations for one or more blocks corresponding to host system code for the block handler 14. To re-translate the target system code 11, the pointer table 24 is invalidated and then rebuilt so that the pointers in the pointer table 24 point to blocks of target system code that haven't been modified. With the pointer table 24 rebuilt in this manner, the translator 12 translates blocks of code 11 that haven't been modified.
An emulation method 30 that may be implemented by the software 10 may be understood by referring simultaneously to
Translations may be chained together so that a function call to the chained translations doesn't always require a pointer table look-up. Once a look-up has been done in the desired chain it can directly branch to the translated function. When a block in such a chain is invalidated the look-up table for this chain must be invalidated. It is also often necessary to keep track of which blocks of translated code are chained to each other and undo that chain. However, such unchaining may be avoided. For example, as shown in
By way of example
As shown in
The CPU core 122 may be a 128-bit processor operating at a 300 megahertz clock frequency using a MIPS instruction set with 64-bit instructions operating as a 2-way superscalar with 128-bit multimedia instructions. These instructions are handled using 128-bit registers 123. The CPU 122 may include a data cache, an instruction cache and an area of on-chip memory sometimes referred to as a scratchpad. The scratchpad serves as a small local memory that is available so that the CPU 122 can perform certain operations while the main bus 134 is busy transferring code and/or data. The first vector unit 126 may be used for animation and physics calculations. The second vector unit 128 may be used for geometry transformations. The GIF 130 serves as the main interface between the EE 102 and the GS 104.
The IOP 106 may include a processor for backwards compatibility with prior versions of the target system 100 and its own associated RAM 112. The IOP 106 handles input and output from external devices such as controllers, USB devices, a hard disc, Ethernet card or modem, and other components of the system such as the sound processor unit 108, a ROM 114 and a CD/DVD unit 116. A target program 118 may be stored on a CD/ROM disc loaded in the CD/DVD unit 116. Instructions from the target program 118 may be stored in EE RAM 110 or IOP RAM 112 and executed by the various processors of the target system 100 in a native machine code that can be read by these processors.
In embodiments of the present invention, target system instructions involving direct memory access (DMA) from the IOP 106 or the scratchpad, may be used as pre-hints for invalidation of translated target system code, as described above.
In embodiments of the present invention, the target system 100 may be emulated using a parallel processing host system 200 so that the host system 200 can run programs written in code native to the target system 100 such as target program 118.
By way of example, in an embodiment of the invention, a translator 212 running on the PPE 204 may emulate the EE 102 of the target system 100 by translating EE instructions of the target program 118 into machine code 213 that can be run on the PPE 204. In certain embodiments of the invention a dedicated SPE 206 may implement a software interpreter 214 that emulates the IOP 106 by interpreting IOP instructions of the target program 118.
When developing certain pieces of emulated code it may be necessary to invalidate an instruction cache (I-cache) to make sure that it is running coherent code. By way of example, the cache for the EE 102 may be emulated in memory 202. To invalidate an entry in the I-cache appropriately, instructions to overwrite the emulated I-cache may be trapped. In the case of PS2 emulation, two instructions may be trapped for invalidating—one for the EE 102 and one for VU1128. Flushing the cache for the EE 102 typically requires retranslation of parts of EE code. The re-translated code has to match the code that is currently in memory 202. Thus, when executing a specific instruction to the I-cache to invalidate a particular entry it is important to keep track of which instructions straddle which cache translations. The idea is to look for event that requires re-optimization or recompiling of code, read the instruction, translate it to another instruction and change the state of the emulated machine.
While the above is a complete description of the preferred embodiment of the present invention, it is possible to use various alternatives, modifications and equivalents. Therefore, the scope of the present invention should be determined not with reference to the above description but should, instead, be determined with reference to the appended claims, along with their full scope of equivalents. Any feature described herein, whether preferred or not, may be combined with any other feature described herein, whether preferred or not. In the claims that follow, the indefinite article “A”, or “An” refers to a quantity of one or more of the item following the article, except where expressly stated otherwise. The appended claims are not to be interpreted as including means-plus-function limitations, unless such a limitation is explicitly recited in a given claim using the phrase “means for.”
This application is a continuation and claims the benefit of priority of U.S. patent application Ser. No. 12/855,634, to Stewart Sargaison et al, entitled TRANSLATION BLOCK INVALIDATION PREHINTS IN EMULATION OF A TARGET SYSTEM ON A HOST SYSTEM (now U.S. Pat. No. 7,957,952), filed Aug. 12, 2010, the entire disclosures of which are incorporated herein by reference. Application Ser. No. 12/855,634 is a continuation and claims the benefit of priority of U.S. patent application Ser. No. 11/696,684, to Stewart Sargaison et al, entitled TRANSLATION BLOCK INVALIDATION PREHINTS IN EMULATION OF A TARGET SYSTEM ON A HOST SYSTEM (now U.S. Pat. No. 7,792,666), filed Apr. 4, 2007, the entire disclosures of which are incorporated herein by reference. The present application claims the priority benefit of application Ser. No. 11/696,684 and all applications to which application Ser. No. 11/696,684 is entitled to claim the priority benefit including the following claims of benefit of priority. This application claims the benefit of priority of US provisional application No. 60/746,267, to Stewart Sargaison et al, entitled TRANSLATION BLOCK INVALIDATION PREHINTS IN EMULATION OF A TARGET SYSTEM ON A HOST SYSTEM, filed May 3, 2006, the entire disclosures of which are incorporated herein by reference. This application claims the benefit of priority of U.S. provisional application No. 60/746,268, to Stewart Sargaison et al, entitled REGISTER MAPPING IN EMULATION A TARGET SYSTEM ON A HOST SYSTEM, filed May 3, 2006, the entire disclosures of which are incorporated herein by reference. This application claims the benefit of priority of U.S. provisional application No. 60/746,273 entitled METHOD AND APPARATUS FOR RESOLVING CLOCK MANAGEMENT ISSUES IN EMULATION INVOLVING BOTH INTERPRETED AND TRANSLATED CODE, filed May 3, 2006, the entire disclosures of which are incorporated herein by reference. This application claims the benefit of priority of U.S. provisional application No. 60/797,762, to Victor Suba, entitled STALL PREDICTION THREAD MANAGEMENT, filed May 3, 2006, the entire disclosures of which are incorporated herein by reference. This application claims the benefit of priority of US provisional application No. 60/797,435, to Stewart Sargaison et al, entitled DMA AND GRAPHICS INTERFACE EMULATION, filed May 3, 2006, the entire disclosures of which are incorporated herein by reference. This application also claims the benefit of priority of U.S. provisional application No. 60/797,761, to Stewart Sargaison et al, entitled CODE TRANSLATION AND PIPELINE OPTIMIZATION, filed May 3, 2006, the entire disclosures of which are incorporated herein by reference. This application claims the benefit of priority of U.S. patent application Ser. No. 11/700,448 (now U.S. Pat. No. 7,577,826), filed Jan. 30, 2007, which claims the benefit of priority of U.S. provisional patent application No. 60/763,568 filed Jan. 30, 2006. The entire disclosures of application Ser. Nos. 11/700,448 and 60/763,568 are incorporated herein by reference. This application is related to and claims the priority benefit of U.S. patent application Ser. No. 11/696,691, to Stewart Sargaison et al, entitled REGISTER MAPPING IN EMULATION A TARGET SYSTEM ON A HOST SYSTEM (now U.S. Pat. No. 7,813,909), filed Apr. 4, 2007, the entire disclosures of which are incorporated herein by reference. This application is related to and claims the priority benefit of U.S. patent application Ser. No. 11/696,699, to Stewart Sargaison et al, entitled METHOD AND APPARATUS FOR RESOLVING CLOCK MANAGEMENT ISSUES IN EMULATION INVOLVING BOTH INTERPRETED AND TRANSLATED CODE (now U.S. Pat. No. 7,770,050), filed Apr. 4, 2007, the entire disclosures of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4587612 | Fisk et al. | May 1986 | A |
4791558 | Chaitin et al. | Dec 1988 | A |
5546552 | Coon et al. | Aug 1996 | A |
5551015 | Goettelmann et al. | Aug 1996 | A |
5560013 | Scalzi et al. | Sep 1996 | A |
5649203 | Sites | Jul 1997 | A |
5751982 | Morley | May 1998 | A |
5768593 | Walters et al. | Jun 1998 | A |
5790825 | Traut | Aug 1998 | A |
5815720 | Buzbee | Sep 1998 | A |
6016542 | Gottlieb et al. | Jan 2000 | A |
6031992 | Cmelik et al. | Feb 2000 | A |
6047381 | Klein | Apr 2000 | A |
6115054 | Giles | Sep 2000 | A |
6142682 | Skogby | Nov 2000 | A |
6151670 | Lange et al. | Nov 2000 | A |
6158047 | Le et al. | Dec 2000 | A |
6247172 | Dunn et al. | Jun 2001 | B1 |
6314560 | Dunn et al. | Nov 2001 | B1 |
6327704 | Mattson et al. | Dec 2001 | B1 |
6332214 | Wu | Dec 2001 | B1 |
6397242 | Devine et al. | May 2002 | B1 |
6463582 | Lethin et al. | Oct 2002 | B1 |
6502237 | Yates et al. | Dec 2002 | B1 |
6529862 | Mann et al. | Mar 2003 | B1 |
6532532 | Eaton et al. | Mar 2003 | B1 |
6631514 | Le | Oct 2003 | B1 |
6672963 | Link | Jan 2004 | B1 |
6704925 | Bugnion | Mar 2004 | B1 |
6728950 | Davis et al. | Apr 2004 | B2 |
6763328 | Egolf et al. | Jul 2004 | B1 |
6884171 | Eck et al. | Apr 2005 | B2 |
6992968 | Ueyanagi | Jan 2006 | B2 |
6993751 | Bhansali et al. | Jan 2006 | B2 |
7000226 | Gao et al. | Feb 2006 | B2 |
7096460 | Banning et al. | Aug 2006 | B1 |
7107580 | Zemach et al. | Sep 2006 | B2 |
7111096 | Banning et al. | Sep 2006 | B1 |
7117143 | Wang et al. | Oct 2006 | B2 |
7181601 | Rudd et al. | Feb 2007 | B2 |
7210144 | Traut | Apr 2007 | B2 |
7260815 | Chen et al. | Aug 2007 | B1 |
7418580 | Campbell et al. | Aug 2008 | B1 |
7624384 | Zhang et al. | Nov 2009 | B2 |
7644210 | Banning et al. | Jan 2010 | B1 |
7770050 | Sargaison et al. | Aug 2010 | B2 |
7792666 | Sargaison et al. | Sep 2010 | B2 |
7957952 | Sargaison | Jun 2011 | B2 |
20020066086 | Linden | May 2002 | A1 |
20020156977 | Derrick et al. | Oct 2002 | A1 |
20030093649 | Hilton | May 2003 | A1 |
20030093774 | Hilton | May 2003 | A1 |
20030093775 | Hilton | May 2003 | A1 |
20030093776 | Hilton | May 2003 | A1 |
20030101439 | Desoli et al. | May 2003 | A1 |
20040158681 | Hooker | Aug 2004 | A1 |
20040205733 | Souloglou et al. | Oct 2004 | A1 |
20040221273 | Sandham et al. | Nov 2004 | A1 |
20040221278 | Dankel et al. | Nov 2004 | A1 |
20050015754 | Werner et al. | Jan 2005 | A1 |
20050015756 | Brown et al. | Jan 2005 | A1 |
20050015758 | North | Jan 2005 | A1 |
20050149697 | Enright et al. | Jul 2005 | A1 |
20060029234 | Sargaison | Feb 2006 | A1 |
20060114132 | Zhang et al. | Jun 2006 | A1 |
20070180438 | Suba | Aug 2007 | A1 |
20070260446 | Suba et al. | Nov 2007 | A1 |
20070261038 | Sargaison et al. | Nov 2007 | A1 |
20070261039 | Sargaison et al. | Nov 2007 | A1 |
20070277052 | Sargaison et al. | Nov 2007 | A1 |
20080040093 | Sargaison et al. | Feb 2008 | A1 |
20080052691 | Neelakantam et al. | Feb 2008 | A1 |
20080092151 | Brown | Apr 2008 | A1 |
20090164205 | Sargaison | Jun 2009 | A1 |
Number | Date | Country |
---|---|---|
0945796 | Sep 1999 | EP |
WO2007096602 | Aug 2007 | WO |
Number | Date | Country | |
---|---|---|---|
20110238403 A1 | Sep 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12855634 | Aug 2010 | US |
Child | 13153129 | US |