Patent Application
20160179662
The present disclosure pertains to the field of processing logic, microprocessors, and associated instruction set architecture that, when executed by the processor or other processing logic, perform logical, mathematical, or other functional operations. The present disclosure further pertains to field of handling self-modifying code and the interaction with virtual memory.
Multiprocessor systems are becoming more and more common. Applications of multiprocessor systems range from the highest-performance systems down to embedded low-power computers. Applications of multiprocessor systems include dynamic domain partitioning all the way down to desktop computing. In order to take advantage of multiprocessor systems, code to be executed may be separated into multiple threads for execution by various processing entities. Each thread may be executed in parallel with one another. Furthermore, in order to increase the utility of a processing entity, out-of-order execution may be employed. Out-of-order execution may execute instructions when needed input to such instructions is made available. Thus, an instruction that appears later in a code sequence may be executed before an instruction appearing earlier in a code sequence. Together, these interact with virtual memory and the system's memory model.
Embodiments are illustrated by way of example and not limitation in the Figures of the accompanying drawings:
The following description describes an instruction and processing logic for change bits associated with page table walks that may occur in conjunction with binary translation within or in association with a processor, virtual processor, package, computer system, or other processing apparatus. Such bits may include bits indicating whether a given page table was accessed or is dirty (that is, modified). Such a processing apparatus may include an out-of-order processor. The binary translation may include, for example, self-modifying code, cross-modifying code, or direct memory access (DMA)-modified code. In the following description, numerous specific details such as processing logic, processor types, micro-architectural conditions, events, enablement mechanisms, and the like are set forth in order to provide a more thorough understanding of embodiments of the present disclosure. It will be appreciated, however, by one skilled in the art that the embodiments may be practiced without such specific details. Additionally, some well-known structures, circuits, and the like have not been shown in detail to avoid unnecessarily obscuring embodiments of the present disclosure.
Although the following embodiments are described with reference to a processor, other embodiments are applicable to other types of integrated circuits and logic devices. Similar techniques and teachings of embodiments of the present disclosure may be applied to other types of circuits or semiconductor devices that may benefit from higher pipeline throughput and improved performance. The teachings of embodiments of the present disclosure are applicable to any processor or machine that performs data manipulations. However, the embodiments are not limited to processors or machines that perform 512-bit, 256-bit, 128-bit, 64-bit, 32-bit, or 16-bit data operations and may be applied to any processor and machine in which manipulation or management of data may be performed. In addition, the following description provides examples, and the accompanying drawings show various examples for the purposes of illustration. However, these examples should not be construed in a limiting sense as they are merely intended to provide examples of embodiments of the present disclosure rather than to provide an exhaustive list of all possible implementations of embodiments of the present disclosure.
Although the below examples describe instruction handling and distribution in the context of execution units and logic circuits, other embodiments of the present disclosure may be accomplished by way of a data or instructions stored on a machine-readable, tangible medium, which when performed by a machine cause the machine to perform functions consistent with at least one embodiment of the disclosure. In one embodiment, functions associated with embodiments of the present disclosure are embodied in machine-executable instructions. The instructions may be used to cause a general-purpose or special-purpose processor that may be programmed with the instructions to perform the steps of the present disclosure. Embodiments of the present disclosure may be provided as a computer program product or software which may include a machine or computer-readable medium having stored thereon instructions which may be used to program a computer (or other electronic devices) to perform one or more operations according to embodiments of the present disclosure. Furthermore, steps of embodiments of the present disclosure might be performed by specific hardware components that contain fixed-function logic for performing the steps, or by any combination of programmed computer components and fixed-function hardware components.
Instructions used to program logic to perform embodiments of the present disclosure may be stored within a memory in the system, such as DRAM, cache, flash memory, or other storage. Furthermore, the instructions may be distributed via a network or by way of other computer-readable media. Thus a machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer), but is not limited to, floppy diskettes, optical disks, Compact Disc, Read-Only Memory (CD-ROMs), and magneto-optical disks, Read-Only Memory (ROMs), Random Access Memory (RAM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), magnetic or optical cards, flash memory, or a tangible, machine-readable storage used in the transmission of information over the Internet via electrical, optical, acoustical or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.). Accordingly, the computer-readable medium may include any type of tangible machine-readable medium suitable for storing or transmitting electronic instructions or information in a form readable by a machine (e.g., a computer).
A design may go through various stages, from creation to simulation to fabrication. Data representing a design may represent the design in a number of manners. First, as may be useful in simulations, the hardware may be represented using a hardware description language or another functional description language. Additionally, a circuit level model with logic and/or transistor gates may be produced at some stages of the design process. Furthermore, designs, at some stage, may reach a level of data representing the physical placement of various devices in the hardware model. In cases wherein some semiconductor fabrication techniques are used, the data representing the hardware model may be the data specifying the presence or absence of various features on different mask layers for masks used to produce the integrated circuit. In any representation of the design, the data may be stored in any form of a machine-readable medium. A memory or a magnetic or optical storage such as a disc may be the machine-readable medium to store information transmitted via optical or electrical wave modulated or otherwise generated to transmit such information. When an electrical carrier wave indicating or carrying the code or design is transmitted, to the extent that copying, buffering, or retransmission of the electrical signal is performed, a new copy may be made. Thus, a communication provider or a network provider may store on a tangible, machine-readable medium, at least temporarily, an article, such as information encoded into a carrier wave, embodying techniques of embodiments of the present disclosure.
In modern processors, a number of different execution units may be used to process and execute a variety of code and instructions. Some instructions may be quicker to complete while others may take a number of clock cycles to complete. The faster the throughput of instructions, the better the overall performance of the processor. Thus it would be advantageous to have as many instructions execute as fast as possible. However, there may be certain instructions that have greater complexity and require more in terms of execution time and processor resources, such as floating point instructions, load/store operations, data moves, etc.
As more computer systems are used in internet, text, and multimedia applications, additional processor support has been introduced over time. In one embodiment, an instruction set may be associated with one or more computer architectures, including data types, instructions, register architecture, addressing modes, memory architecture, interrupt and exception handling, and external input and output (I/O).
In one embodiment, the instruction set architecture (ISA) may be implemented by one or more micro-architectures, which may include processor logic and circuits used to implement one or more instruction sets. Accordingly, processors with different micro-architectures may share at least a portion of a common instruction set. For example, Intel® Pentium 4 processors, Intel® Core™ processors, and processors from Advanced Micro Devices, Inc. of Sunnyvale Calif. implement nearly identical versions of the x86 instruction set (with some extensions that have been added with newer versions), but have different internal designs. Similarly, processors designed by other processor development companies, such as ARM Holdings, Ltd., MIPS, or their licensees or adopters, may share at least a portion a common instruction set, but may include different processor designs. For example, the same register architecture of the ISA may be implemented in different ways in different micro-architectures using new or well-known techniques, including dedicated physical registers, one or more dynamically allocated physical registers using a register renaming mechanism (e.g., the use of a Register Alias Table (RAT), a Reorder Buffer (ROB) and a retirement register file. In one embodiment, registers may include one or more registers, register architectures, register files, or other register sets that may or may not be addressable by a software programmer.
An instruction may include one or more instruction formats. In one embodiment, an instruction format may indicate various fields (number of bits, location of bits, etc.) to specify, among other things, the operation to be performed and the operands on which that operation will be performed. In a further embodiment, some instruction formats may be further defined by instruction templates (or sub-formats). For example, the instruction templates of a given instruction format may be defined to have different subsets of the instruction format's fields and/or defined to have a given field interpreted differently. In one embodiment, an instruction may be expressed using an instruction format (and, if defined, in one of the instruction templates of that instruction format) and specifies or indicates the operation and the operands upon which the operation will operate.
Scientific, financial, auto-vectorized general purpose, RMS (recognition, mining, and synthesis), and visual and multimedia applications (e.g., 2D/3D graphics, image processing, video compression/decompression, voice recognition algorithms and audio manipulation) may require the same operation to be performed on a large number of data items. In one embodiment, Single Instruction Multiple Data (SIMD) refers to a type of instruction that causes a processor to perform an operation on multiple data elements. SIMD technology may be used in processors that may logically divide the bits in a register into a number of fixed-sized or variable-sized data elements, each of which represents a separate value. For example, in one embodiment, the bits in a 64-bit register may be organized as a source operand containing four separate 16-bit data elements, each of which represents a separate 16-bit value. This type of data may be referred to as ‘packed’ data type or ‘vector’ data type, and operands of this data type may be referred to as packed data operands or vector operands. In one embodiment, a packed data item or vector may be a sequence of packed data elements stored within a single register, and a packed data operand or a vector operand may be a source or destination operand of a SIMD instruction (or ‘packed data instruction’ or a ‘vector instruction’). In one embodiment, a SIMD instruction specifies a single vector operation to be performed on two source vector operands to generate a destination vector operand (also referred to as a result vector operand) of the same or different size, with the same or different number of data elements, and in the same or different data element order.
SIMD technology, such as that employed by the Intel® CoreTM processors having an instruction set including x86, MMX™, Streaming SIMD Extensions (SSE), SSE2, SSE3, SSE4.1, and SSE4.2 instructions, ARM processors, such as the ARM Cortex® family of processors having an instruction set including the Vector Floating Point (VFP) and/or NEON instructions, and MIPS processors, such as the Loongson family of processors developed by the Institute of Computing Technology (ICT) of the Chinese Academy of Sciences, has enabled a significant improvement in application performance (Core™ and MMX™ are registered trademarks or trademarks of Intel Corporation of Santa Clara, Calif.).
In one embodiment, destination and source registers/data may be generic terms to represent the source and destination of the corresponding data or operation. In some embodiments, they may be implemented by registers, memory, or other storage areas having other names or functions than those depicted. For example, in one embodiment, “DEST1” may be a temporary storage register or other storage area, whereas “SRC1” and “SRC2” may be a first and second source storage register or other storage area, and so forth. In other embodiments, two or more of the SRC and DEST storage areas may correspond to different data storage elements within the same storage area (e.g., a SIMD register). In one embodiment, one of the source registers may also act as a destination register by, for example, writing back the result of an operation performed on the first and second source data to one of the two source registers serving as a destination registers.
Embodiments are not limited to computer systems. Embodiments of the present disclosure may be used in other devices such as handheld devices and embedded applications. Some examples of handheld devices include cellular phones, Internet Protocol devices, digital cameras, personal digital assistants (PDAs), and handheld PCs. Embedded applications may include a micro controller, a digital signal processor (DSP), system on a chip, network computers (NetPC), set-top boxes, network hubs, wide area network (WAN) switches, or any other system that may perform one or more instructions in accordance with at least one embodiment.
Computer system 100 may include a processor 102 that may include one or more execution units 108 to perform an algorithm to perform at least one instruction in accordance with one embodiment of the present disclosure. One embodiment may be described in the context of a single processor desktop or server system, but other embodiments may be included in a multiprocessor system. System 100 may be an example of a ‘hub’ system architecture. System 100 may include a processor 102 for processing data signals. Processor 102 may include a complex instruction set computer (CISC) microprocessor, a reduced instruction set computing (RISC) microprocessor, a very long instruction word (VLIW) microprocessor, a processor implementing a combination of instruction sets, or any other processor device, such as a digital signal processor, for example. In one embodiment, processor 102 may be coupled to a processor bus 110 that may transmit data signals between processor 102 and other components in system 100. The elements of system 100 may perform conventional functions that are well known to those familiar with the art.
In one embodiment, processor 102 may include a Level 1 (L1) internal cache memory 104. Depending on the architecture, the processor 102 may have a single internal cache or multiple levels of internal cache. In another embodiment, the cache memory may reside external to processor 102. Other embodiments may also include a combination of both internal and external caches depending on the particular implementation and needs. Register file 106 may store different types of data in various registers including integer registers, floating point registers, status registers, and instruction pointer register.
Execution unit 108, including logic to perform integer and floating point operations, also resides in processor 102. Processor 102 may also include a microcode (ucode) ROM that stores microcode for certain macroinstructions. In one embodiment, execution unit 108 may include logic to handle a packed instruction set 109. By including the packed instruction set 109 in the instruction set of a general-purpose processor 102, along with associated circuitry to execute the instructions, the operations used by many multimedia applications may be performed using packed data in a general-purpose processor 102. Thus, many multimedia applications may be accelerated and executed more efficiently by using the full width of a processor's data bus for performing operations on packed data. This may eliminate the need to transfer smaller units of data across the processor's data bus to perform one or more operations one data element at a time.
Embodiments of an execution unit 108 may also be used in micro controllers, embedded processors, graphics devices, DSPs, and other types of logic circuits. System 100 may include a memory 120. Memory 120 may be implemented as a dynamic random access memory (DRAM) device, a static random access memory (SRAM) device, flash memory device, or other memory device. Memory 120 may store instructions and/or data represented by data signals that may be executed by processor 102.
A system logic chip 116 may be coupled to processor bus 110 and memory 120. System logic chip 116 may include a memory controller hub (MCH). Processor 102 may communicate with MCH 116 via a processor bus 110. MCH 116 may provide a high bandwidth memory path 118 to memory 120 for instruction and data storage and for storage of graphics commands, data and textures. MCH 116 may direct data signals between processor 102, memory 120, and other components in system 100 and to bridge the data signals between processor bus 110, memory 120, and system I/O 122. In some embodiments, the system logic chip 116 may provide a graphics port for coupling to a graphics controller 112. MCH 116 may be coupled to memory 120 through a memory interface 118. Graphics card 112 may be coupled to MCH 116 through an Accelerated Graphics Port (AGP) interconnect 114.
System 100 may use a proprietary hub interface bus 122 to couple MCH 116 to I/O controller hub (ICH) 130. In one embodiment, ICH 130 may provide direct connections to some I/O devices via a local I/O bus. The local I/O bus may include a high-speed I/O bus for connecting peripherals to memory 120, chipset, and processor 102. Examples may include the audio controller, firmware hub (flash BIOS) 128, wireless transceiver 126, data storage 124, legacy I/O controller containing user input and keyboard interfaces, a serial expansion port such as Universal Serial Bus (USB), and a network controller 134. Data storage device 124 may comprise a hard disk drive, a floppy disk drive, a CD-ROM device, a flash memory device, or other mass storage device.
For another embodiment of a system, an instruction in accordance with one embodiment may be used with a system on a chip. One embodiment of a system on a chip comprises of a processor and a memory. The memory for one such system may include a flash memory. The flash memory may be located on the same die as the processor and other system components. Additionally, other logic blocks such as a memory controller or graphics controller may also be located on a system on a chip.
Computer system 140 comprises a processing core 159 for performing at least one instruction in accordance with one embodiment. In one embodiment, processing core 159 represents a processing unit of any type of architecture, including but not limited to a CISC, a RISC or a VLIW type architecture. Processing core 159 may also be suitable for manufacture in one or more process technologies and by being represented on a machine-readable media in sufficient detail, may be suitable to facilitate said manufacture.
Processing core 159 comprises an execution unit 142, a set of register files 145, and a decoder 144. Processing core 159 may also include additional circuitry (not shown) which may be unnecessary to the understanding of embodiments of the present disclosure. Execution unit 142 may execute instructions received by processing core 159. In addition to performing typical processor instructions, execution unit 142 may perform instructions in packed instruction set 143 for performing operations on packed data formats. Packed instruction set 143 may include instructions for performing embodiments of the disclosure and other packed instructions. Execution unit 142 may be coupled to register file 145 by an internal bus. Register file 145 may represent a storage area on processing core 159 for storing information, including data. As previously mentioned, it is understood that the storage area may store the packed data might not be critical. Execution unit 142 may be coupled to decoder 144. Decoder 144 may decode instructions received by processing core 159 into control signals and/or microcode entry points. In response to these control signals and/or microcode entry points, execution unit 142 performs the appropriate operations. In one embodiment, the decoder may interpret the opcode of the instruction, which will indicate what operation should be performed on the corresponding data indicated within the instruction.
Processing core 159 may be coupled with bus 141 for communicating with various other system devices, which may include but are not limited to, for example, synchronous dynamic random access memory (SDRAM) control 146, static random access memory (SRAM) control 147, burst flash memory interface 148, personal computer memory card international association (PCMCIA)/compact flash (CF) card control 149, liquid crystal display (LCD) control 150, direct memory access (DMA) controller 151, and alternative bus master interface 152. In one embodiment, data processing system 140 may also comprise an I/O bridge 154 for communicating with various I/O devices via an I/O bus 153. Such I/O devices may include but are not limited to, for example, universal asynchronous receiver/transmitter (UART) 155, universal serial bus (USB) 156, Bluetooth wireless UART 157 and I/O expansion interface 158.
One embodiment of data processing system 140 provides for mobile, network and/or wireless communications and a processing core 159 that may perform SIMD operations including a text string comparison operation. Processing core 159 may be programmed with various audio, video, imaging and communications algorithms including discrete transformations such as a Walsh-Hadamard transform, a fast Fourier transform (FFT), a discrete cosine transform (DCT), and their respective inverse transforms; compression/decompression techniques such as color space transformation, video encode motion estimation or video decode motion compensation; and modulation/demodulation (MODEM) functions such as pulse coded modulation (PCM).
In one embodiment, SIMD coprocessor 161 comprises an execution unit 162 and a set of register files 164. One embodiment of main processor 165 comprises a decoder 165 to recognize instructions of instruction set 163 including instructions in accordance with one embodiment for execution by execution unit 162. In other embodiments, SIMD coprocessor 161 also comprises at least part of decoder 165 to decode instructions of instruction set 163. Processing core 170 may also include additional circuitry (not shown) which may be unnecessary to the understanding of embodiments of the present disclosure.
In operation, main processor 166 executes a stream of data processing instructions that control data processing operations of a general type including interactions with cache memory 167, and input/output system 168. Embedded within the stream of data processing instructions may be SIMD coprocessor instructions. Decoder 165 of main processor 166 recognizes these SIMD coprocessor instructions as being of a type that should be executed by an attached SIMD coprocessor 161. Accordingly, main processor 166 issues these SIMD coprocessor instructions (or control signals representing SIMD coprocessor instructions) on the coprocessor bus 166. From coprocessor bus 166, these instructions may be received by any attached SIMD coprocessors. In this case, SIMD coprocessor 161 may accept and execute any received SIMD coprocessor instructions intended for it.
Data may be received via wireless interface 169 for processing by the SIMD coprocessor instructions. For one example, voice communication may be received in the form of a digital signal, which may be processed by the SIMD coprocessor instructions to regenerate digital audio samples representative of the voice communications. For another example, compressed audio and/or video may be received in the form of a digital bit stream, which may be processed by the SIMD coprocessor instructions to regenerate digital audio samples and/or motion video frames. In one embodiment of processing core 170, main processor 166, and a SIMD coprocessor 161 may be integrated into a single processing core 170 comprising an execution unit 162, a set of register files 164, and a decoder 165 to recognize instructions of instruction set 163 including instructions in accordance with one embodiment.
Some instructions may be converted into a single micro-op, whereas others need several micro-ops to complete the full operation. In one embodiment, if more than four micro-ops are needed to complete an instruction, decoder 228 may access microcode ROM 232 to perform the instruction. In one embodiment, an instruction may be decoded into a small number of micro ops for processing at instruction decoder 228. In another embodiment, an instruction may be stored within microcode ROM 232 should a number of micro-ops be needed to accomplish the operation. Trace cache 230 refers to an entry point programmable logic array (PLA) to determine a correct micro-instruction pointer for reading the micro-code sequences to complete one or more instructions in accordance with one embodiment from micro-code ROM 232. After microcode ROM 232 finishes sequencing micro-ops for an instruction, front end 201 of the machine may resume fetching micro-ops from trace cache 230.
Out-of-order execution engine 203 may prepare instructions for execution. The out-of-order execution logic has a number of buffers to smooth out and re-order the flow of instructions to optimize performance as they go down the pipeline and get scheduled for execution. The allocator logic allocates the machine buffers and resources that each uop needs in order to execute. The register renaming logic renames logic registers onto entries in a register file. The allocator also allocates an entry for each uop in one of the two uop queues, one for memory operations and one for non-memory operations, in front of the instruction schedulers: memory scheduler, fast scheduler 202, slow/general floating point scheduler 204, and simple floating point scheduler 206. Uop schedulers 202, 204, 206, determine when a uop is ready to execute based on the readiness of their dependent input register operand sources and the availability of the execution resources the uops need to complete their operation. Fast scheduler 202 of one embodiment may schedule on each half of the main clock cycle while the other schedulers may only schedule once per main processor clock cycle. The schedulers arbitrate for the dispatch ports to schedule uops for execution.
Register files 208, 210 may be arranged between schedulers 202, 204, 206, and execution units 212, 214, 216, 218, 220, 222, 224 in execution block 211. Each of register files 208, 210 perform integer and floating point operations, respectively. Each register file 208, 210, may include a bypass network that may bypass or forward just completed results that have not yet been written into the register file to new dependent uops. Integer register file 208 and floating point register file 210 may communicate data with the other. In one embodiment, integer register file 208 may be split into two separate register files, one register file for low-order thirty-two bits of data and a second register file for high order thirty-two bits of data. Floating point register file 210 may include 128-bit wide entries because floating point instructions typically have operands from 64 to 128 bits in width.
Execution block 211 may contain execution units 212, 214, 216, 218, 220, 222, 224. Execution units 212, 214, 216, 218, 220, 222, 224 may execute the instructions. Execution block 211 may include register files 208, 210 that store the integer and floating point data operand values that the micro-instructions need to execute. In one embodiment, processor 200 may comprise a number of execution units: address generation unit (AGU) 212, AGU 214, fast ALU 216, fast ALU 218, slow ALU 220, floating point ALU 222, floating point move unit 224. In another embodiment, floating point execution blocks 222, 224, may execute floating point, MMX, SIMD, and SSE, or other operations. In yet another embodiment, floating point ALU 222 may include a 64-bit by 64-bit floating point divider to execute divide, square root, and remainder micro-ops. In various embodiments, instructions involving a floating point value may be handled with the floating point hardware. In one embodiment, ALU operations may be passed to high-speed ALU execution units 216, 218. High-speed ALUs 216, 218 may execute fast operations with an effective latency of half a clock cycle. In one embodiment, most complex integer operations go to slow ALU 220 as slow ALU 220 may include integer execution hardware for long latency type of operations, such as a multiplier, shifts, flag logic, and branch processing. Memory load/store operations may be executed by AGUs 212, 214. In one embodiment, integer ALUs 216, 218, 220 may perform integer operations on 64-bit data operands. In other embodiments, ALUs 216, 218, 220 may be implemented to support a variety of data bit sizes including sixteen, thirty-two, 128, 256, etc. Similarly, floating point units 222, 224 may be implemented to support a range of operands having bits of various widths. In one embodiment, floating point units 222, 224, may operate on 128-bit wide packed data operands in conjunction with SIMD and multimedia instructions.
In one embodiment, uops schedulers 202, 204, 206, dispatch dependent operations before the parent load has finished executing. As uops may be speculatively scheduled and executed in processor 200, processor 200 may also include logic to handle memory misses. If a data load misses in the data cache, there may be dependent operations in flight in the pipeline that have left the scheduler with temporarily incorrect data. A replay mechanism tracks and re-executes instructions that use incorrect data. Only the dependent operations might need to be replayed and the independent ones may be allowed to complete. The schedulers and replay mechanism of one embodiment of a processor may also be designed to catch instruction sequences for text string comparison operations.
The term “registers” may refer to the on-board processor storage locations that may be used as part of instructions to identify operands. In other words, registers may be those that may be usable from the outside of the processor (from a programmer's perspective). However, in some embodiments registers might not be limited to a particular type of circuit. Rather, a register may store data, provide data, and perform the functions described herein. The registers described herein may be implemented by circuitry within a processor using any number of different techniques, such as dedicated physical registers, dynamically allocated physical registers using register renaming, combinations of dedicated and dynamically allocated physical registers, etc. In one embodiment, integer registers store 32-bit integer data. A register file of one embodiment also contains eight multimedia SIMD registers for packed data. For the discussions below, the registers may be understood to be data registers designed to hold packed data, such as 64-bit wide MMX′ registers (also referred to as ‘mm’ registers in some instances) in microprocessors enabled with MMX technology from Intel Corporation of Santa Clara, Calif. These MMX registers, available in both integer and floating point forms, may operate with packed data elements that accompany SIMD and SSE instructions. Similarly, 128-bit wide XMM registers relating to SSE2, SSE3, SSE4, or beyond (referred to generically as “SSEx”) technology may hold such packed data operands. In one embodiment, in storing packed data and integer data, the registers do not need to differentiate between the two data types. In one embodiment, integer and floating point may be contained in the same register file or different register files. Furthermore, in one embodiment, floating point and integer data may be stored in different registers or the same registers.
In the examples of the following figures, a number of data operands may be described.
Generally, a data element may include an individual piece of data that is stored in a single register or memory location with other data elements of the same length. In packed data sequences relating to SSEx technology, the number of data elements stored in a XMM register may be 128 bits divided by the length in bits of an individual data element. Similarly, in packed data sequences relating to MMX and SSE technology, the number of data elements stored in an MMX register may be 64 bits divided by the length in bits of an individual data element. Although the data types illustrated in
In
In
Core 490 may be a reduced instruction set computing (RISC) core, a complex instruction set computing (CISC) core, a very long instruction word (VLIW) core, or a hybrid or alternative core type. In one embodiment, core 490 may be a special-purpose core, such as, for example, a network or communication core, compression engine, graphics core, or the like.
Front end unit 430 may include a branch prediction unit 432 coupled to an instruction cache unit 434. Instruction cache unit 434 may be coupled to an instruction translation lookaside buffer (TLB) 436. TLB 436 may be coupled to an instruction fetch unit 438, which is coupled to a decode unit 440. Decode unit 440 may decode instructions, and generate as an output one or more micro-operations, micro-code entry points, microinstructions, other instructions, or other control signals, which may be decoded from, or which otherwise reflect, or may be derived from, the original instructions. The decoder may be implemented using various different mechanisms. Examples of suitable mechanisms include, but are not limited to, look-up tables, hardware implementations, programmable logic arrays (PLAs), microcode read-only memories (ROMs), etc. In one embodiment, instruction cache unit 434 may be further coupled to a level 2 (L2) cache unit 476 in memory unit 470. Decode unit 440 may be coupled to a rename/allocator unit 452 in execution engine unit 450.
Execution engine unit 450 may include rename/allocator unit 452 coupled to a retirement unit 454 and a set of one or more scheduler units 456. Scheduler units 456 represent any number of different schedulers, including reservations stations, central instruction window, etc. Scheduler units 456 may be coupled to physical register file units 458. Each of physical register file units 458 represents one or more physical register files, different ones of which store one or more different data types, such as scalar integer, scalar floating point, packed integer, packed floating point, vector integer, vector floating point, etc., status (e.g., an instruction pointer that is the address of the next instruction to be executed), etc. Physical register file units 458 may be overlapped by retirement unit 154 to illustrate various ways in which register renaming and out-of-order execution may be implemented (e.g., using one or more reorder buffers and one or more retirement register files, using one or more future files, one or more history buffers, and one or more retirement register files; using register maps and a pool of registers; etc.). Generally, the architectural registers may be visible from the outside of the processor or from a programmer's perspective. The registers might not be limited to any known particular type of circuit. Various different types of registers may be suitable as long as they store and provide data as described herein. Examples of suitable registers include, but might not be limited to, dedicated physical registers, dynamically allocated physical registers using register renaming, combinations of dedicated and dynamically allocated physical registers, etc. Retirement unit 454 and physical register file units 458 may be coupled to execution clusters 460. Execution clusters 460 may include a set of one or more execution units 162 and a set of one or more memory access units 464. Execution units 462 may perform various operations (e.g., shifts, addition, subtraction, multiplication) and on various types of data (e.g., scalar floating point, packed integer, packed floating point, vector integer, vector floating point). While some embodiments may include a number of execution units dedicated to specific functions or sets of functions, other embodiments may include only one execution unit or multiple execution units that all perform all functions. Scheduler units 456, physical register file units 458, and execution clusters 460 are shown as being possibly plural because certain embodiments create separate pipelines for certain types of data/operations (e.g., a scalar integer pipeline, a scalar floating point/packed integer/packed floating point/vector integer/vector floating point pipeline, and/or a memory access pipeline that each have their own scheduler unit, physical register file unit, and/or execution cluster—and in the case of a separate memory access pipeline, certain embodiments may be implemented in which only the execution cluster of this pipeline has memory access units 464). It should also be understood that where separate pipelines are used, one or more of these pipelines may be out-of-order issue/execution and the rest in-order.
The set of memory access units 464 may be coupled to memory unit 470, which may include a data TLB unit 472 coupled to a data cache unit 474 coupled to a level 2 (L2) cache unit 476. In one exemplary embodiment, memory access units 464 may include a load unit, a store address unit, and a store data unit, each of which may be coupled to data TLB unit 472 in memory unit 470. L2 cache unit 476 may be coupled to one or more other levels of cache and eventually to a main memory.
By way of example, the exemplary register renaming, out-of-order issue/execution core architecture may implement pipeline 400 as follows: 1) instruction fetch 438 may perform fetch and length decoding stages 402 and 404; 2) decode unit 440 may perform decode stage 406; 3) rename/allocator unit 452 may perform allocation stage 408 and renaming stage 410; 4) scheduler units 456 may perform schedule stage 412; 5) physical register file units 458 and memory unit 470 may perform register read/memory read stage 414; execution cluster 460 may perform execute stage 416; 6) memory unit 470 and physical register file units 458 may perform write-back/memory-write stage 418; 7) various units may be involved in the performance of exception handling stage 422; and 8) retirement unit 454 and physical register file units 458 may perform commit stage 424.
Core 490 may support one or more instructions sets (e.g., the x86 instruction set (with some extensions that have been added with newer versions); the MIPS instruction set of MIPS Technologies of Sunnyvale, Calif.; the ARM instruction set (with optional additional extensions such as NEON) of ARM Holdings of Sunnyvale, Calif.).
It should be understood that the core may support multithreading (executing two or more parallel sets of operations or threads) in a variety of manners. Multithreading support may be performed by, for example, including time sliced multithreading, simultaneous multithreading (where a single physical core provides a logical core for each of the threads that physical core is simultaneously multithreading), or a combination thereof. Such a combination may include, for example, time sliced fetching and decoding and simultaneous multithreading thereafter such as in the Intel® Hyperthreading technology.
While register renaming may be described in the context of out-of-order execution, it should be understood that register renaming may be used in an in-order architecture. While the illustrated embodiment of the processor may also include a separate instruction and data cache units 434/474 and a shared L2 cache unit 476, other embodiments may have a single internal cache for both instructions and data, such as, for example, a Level 1 (L1) internal cache, or multiple levels of internal cache. In some embodiments, the system may include a combination of an internal cache and an external cache that may be external to the core and/or the processor. In other embodiments, all of the cache may be external to the core and/or the processor.
Processor 500 may include any suitable mechanism for interconnecting cores 502, system agent 510, and caches 506, and graphics module 560. In one embodiment, processor 500 may include a ring-based interconnect unit 508 to interconnect cores 502, system agent 510, and caches 506, and graphics module 560. In other embodiments, processor 500 may include any number of well-known techniques for interconnecting such units. Ring-based interconnect unit 508 may utilize memory control units 552 to facilitate interconnections.
Processor 500 may include a memory hierarchy comprising one or more levels of caches within the cores, one or more shared cache units such as caches 506, or external memory (not shown) coupled to the set of integrated memory controller units 552. Caches 506 may include any suitable cache. In one embodiment, caches 506 may include one or more mid-level caches, such as level 2 (L2), level 3 (L3), level 4 (L4), or other levels of cache, a last level cache (LLC), and/or combinations thereof.
In various embodiments, one or more of cores 502 may perform multi-threading. System agent 510 may include components for coordinating and operating cores 502. System agent unit 510 may include for example a power control unit (PCU). The PCU may be or include logic and components needed for regulating the power state of cores 502. System agent 510 may include a display engine 512 for driving one or more externally connected displays or graphics module 560. System agent 510 may include an interface 1214 for communications busses for graphics. In one embodiment, interface 1214 may be implemented by PCI Express (PCIe). In a further embodiment, interface 1214 may be implemented by PCI Express Graphics (PEG). System agent 510 may include a direct media interface (DMI) 516. DMI 516 may provide links between different bridges on a motherboard or other portion of a computer system. System agent 510 may include a PCIe bridge 1218 for providing PCIe links to other elements of a computing system. PCIe bridge 1218 may be implemented using a memory controller 1220 and coherence logic 1222.
Cores 502 may be implemented in any suitable manner. Cores 502 may be homogenous or heterogeneous in terms of architecture and/or instruction set. In one embodiment, some of cores 502 may be in-order while others may be out-of-order. In another embodiment, two or more of cores 502 may execute the same instruction set, while others may execute only a subset of that instruction set or a different instruction set.
Processor 500 may include a general-purpose processor, such as a Core™ i3, i5, i7, 2 Duo and Quad, Xeon™, Itanium™, XScale™ or StrongARM™ processor, which may be available from Intel Corporation, of Santa Clara, Calif. Processor 500 may be provided from another company, such as ARM Holdings, Ltd, MIPS, etc. Processor 500 may be a special-purpose processor, such as, for example, a network or communication processor, compression engine, graphics processor, co-processor, embedded processor, or the like. Processor 500 may be implemented on one or more chips. Processor 500 may be a part of and/or may be implemented on one or more substrates using any of a number of process technologies, such as, for example, BiCMOS, CMOS, or NMOS.
In one embodiment, a given one of caches 506 may be shared by multiple ones of cores 502. In another embodiment, a given one of caches 506 may be dedicated to one of cores 502. The assignment of caches 506 to cores 502 may be handled by a cache controller or other suitable mechanism. A given one of caches 506 may be shared by two or more cores 502 by implementing time-slices of a given cache 506.
Graphics module 560 may implement an integrated graphics processing subsystem. In one embodiment, graphics module 560 may include a graphics processor. Furthermore, graphics module 560 may include a media engine 565. Media engine 565 may provide media encoding and video decoding.
Front end 570 may be implemented in any suitable manner, such as fully or in part by front end 201 as described above. In one embodiment, front end 570 may communicate with other portions of processor 500 through cache hierarchy 503. In a further embodiment, front end 570 may fetch instructions from portions of processor 500 and prepare the instructions to be used later in the processor pipeline as they are passed to out-of-order execution engine 580.
Out-of-order execution engine 580 may be implemented in any suitable manner, such as fully or in part by out-of-order execution engine 203 as described above. Out-of-order execution engine 580 may prepare instructions received from front end 570 for execution. Out-of-order execution engine 580 may include an allocate module 1282. In one embodiment, allocate module 1282 may allocate resources of processor 500 or other resources, such as registers or buffers, to execute a given instruction. Allocate module 1282 may make allocations in schedulers, such as a memory scheduler, fast scheduler, or floating point scheduler. Such schedulers may be represented in
Cache hierarchy 503 may be implemented in any suitable manner. For example, cache hierarchy 503 may include one or more lower or mid-level caches, such as caches 572, 574. In one embodiment, cache hierarchy 503 may include an LLC 595 communicatively coupled to caches 572, 574. In another embodiment, LLC 595 may be implemented in a module 590 accessible to all processing entities of processor 500. In a further embodiment, module 590 may be implemented in an uncore module of processors from Intel, Inc. Module 590 may include portions or subsystems of processor 500 necessary for the execution of core 502 but might not be implemented within core 502. Besides LLC 595, Module 590 may include, for example, hardware interfaces, memory coherency coordinators, interprocessor interconnects, instruction pipelines, or memory controllers. Access to RAM 599 available to processor 500 may be made through module 590 and, more specifically, LLC 595. Furthermore, other instances of core 502 may similarly access module 590. Coordination of the instances of core 502 may be facilitated in part through module 590.
Each processor 610,615 may be some version of processor 500. However, it should be noted that integrated graphics logic and integrated memory control units might not exist in processors 610,615.
GMCH 620 may be a chipset, or a portion of a chipset. GMCH 620 may communicate with processors 610, 615 and control interaction between processors 610, 615 and memory 640. GMCH 620 may also act as an accelerated bus interface between the processors 610, 615 and other elements of system 600. In one embodiment, GMCH 620 communicates with processors 610, 615 via a multi-drop bus, such as a frontside bus (FSB) 695.
Furthermore, GMCH 620 may be coupled to a display 645 (such as a flat panel display). In one embodiment, GMCH 620 may include an integrated graphics accelerator. GMCH 620 may be further coupled to an input/output (I/O) controller hub (ICH) 650, which may be used to couple various peripheral devices to system 600. External graphics device 660 may include be a discrete graphics device coupled to ICH 650 along with another peripheral device 670.
In other embodiments, additional or different processors may also be present in system 600. For example, additional processors 610, 615 may include additional processors that may be the same as processor 610, additional processors that may be heterogeneous or asymmetric to processor 610, accelerators (such as, e.g., graphics accelerators or digital signal processing (DSP) units), field programmable gate arrays, or any other processor. There may be a variety of differences between the physical resources 610, 615 in terms of a spectrum of metrics of merit including architectural, micro-architectural, thermal, power consumption characteristics, and the like. These differences may effectively manifest themselves as asymmetry and heterogeneity amongst processors 610, 615. For at least one embodiment, various processors 610, 615 may reside in the same die package.
While
Processors 770 and 780 are shown including integrated memory controller units 772 and 782, respectively. Processor 770 may also include as part of its bus controller units point-to-point (P-P) interfaces 776 and 778; similarly, second processor 780 may include P-P interfaces 786 and 788. Processors 770, 780 may exchange information via a point-to-point (P-P) interface 750 using P-P interface circuits 778, 788. As shown in
Processors 770, 780 may each exchange information with a chipset 790 via individual P-P interfaces 752, 754 using point to point interface circuits 776, 794, 786, 798. In one embodiment, chipset 790 may also exchange information with a high-performance graphics circuit 738 via a high-performance graphics interface 739.
A shared cache (not shown) may be included in either processor or outside of both processors, yet connected with the processors via P-P interconnect, such that either or both processors' local cache information may be stored in the shared cache if a processor is placed into a low power mode.
Chipset 790 may be coupled to a first bus 716 via an interface 796. In one embodiment, first bus 716 may be a Peripheral Component Interconnect (PCI) bus, or a bus such as a PCI Express bus or another third generation I/O interconnect bus, although the scope of the present disclosure is not so limited.
As shown in
In some embodiments, instructions that benefit from highly parallel, throughput processors may be performed by the GPU, while instructions that benefit from the performance of processors that benefit from deeply pipelined architectures may be performed by the CPU. For example, graphics, scientific applications, financial applications and other parallel workloads may benefit from the performance of the GPU and be executed accordingly, whereas more sequential applications, such as operating system kernel or application code may be better suited for the CPU.
In
One or more aspects of at least one embodiment may be implemented by representative data stored on a machine-readable medium which represents various logic within the processor, which when read by a machine causes the machine to fabricate logic to perform the techniques described herein. Such representations, known as “IP cores” may be stored on a tangible, machine-readable medium (“tape”) and supplied to various customers or manufacturing facilities to load into the fabrication machines that actually make the logic or processor. For example, IP cores, such as the CortexTM family of processors developed by ARM Holdings, Ltd. and Loongson IP cores developed the Institute of Computing Technology (ICT) of the Chinese Academy of Sciences may be licensed or sold to various customers or licensees, such as Texas Instruments, Qualcomm, Apple, or Samsung and implemented in processors produced by these customers or licensees.
In some embodiments, one or more instructions may correspond to a first type or architecture (e.g., x86) and be translated or emulated on a processor of a different type or architecture (e.g., ARM). An instruction, according to one embodiment, may therefore be performed on any processor or processor type, including ARM, x86, MIPS, a GPU, or other processor type or architecture.
For example, instruction set architecture 1400 may include processing entities such as one or more cores 1406, 1407 and a graphics processing unit 1415. Cores 1406, 1407 may be communicatively coupled to the rest of instruction set architecture 1400 through any suitable mechanism, such as through a bus or cache. In one embodiment, cores 1406, 1407 may be communicatively coupled through an L2 cache control 1408, which may include a bus interface unit 1409 and an L2 cache 1410. Cores 1406, 1407 and graphics processing unit 1415 may be communicatively coupled to each other and to the remainder of instruction set architecture 1400 through interconnect 1410. In one embodiment, graphics processing unit 1415 may use a video code 1420 defining the manner in which particular video signals will be encoded and decoded for output.
Instruction set architecture 1400 may also include any number or kind of interfaces, controllers, or other mechanisms for interfacing or communicating with other portions of an electronic device or system. Such mechanisms may facilitate interaction with, for example, peripherals, communications devices, other processors, or memory. In the example of
Instruction architecture 1500 may include a memory system 1540 communicatively coupled to one or more execution entities 1565. Furthermore, instruction architecture 1500 may include a caching and bus interface unit such as unit 1510 communicatively coupled to execution entities 1565 and memory system 1540. In one embodiment, loading of instructions into execution entities 1565 may be performed by one or more stages of execution. Such stages may include, for example, instruction prefetch stage 1530, dual instruction decode stage 1550, register rename stage 1555, issue stage 1560, and writeback stage 1570.
In one embodiment, memory system 1540 may include an executed instruction pointer 1580. Executed instruction pointer 1580 may store a value identifying the oldest, undispatched instruction within a batch of instructions in the out-of-order issue stage 1560 within a thread represented by multiple strands. Executed instruction pointer 1580 may be calculated in issue stage 1560 and propagated to load units. The instruction may be stored within a batch of instructions. The batch of instructions may be within a thread represented by multiple strands. The oldest instruction may correspond to the lowest program order (PO) value. A PO may include a unique number of an instruction. A PO may be used in ordering instructions to ensure correct execution semantics of code. A PO may be reconstructed by mechanisms such as evaluating increments to PO encoded in the instruction rather than an absolute value. Such a reconstructed PO may be known as an RPO. Although a PO may be referenced herein, such a PO may be used interchangeably with an RPO. A strand may include a sequence of instructions that are data dependent upon each other. The strand may be arranged by a binary translator at compilation time. Hardware executing a strand may execute the instructions of a given strand in order according to PO of the various instructions. A thread may include multiple strands such that instructions of different strands may depend upon each other. A PO of a given strand may be the PO of the oldest instruction in the strand which has not yet been dispatched to execution from an issue stage. Accordingly, given a thread of multiple strands, each strand including instructions ordered by PO, executed instruction pointer 1580 may store the oldest—illustrated by the lowest number—PO amongst the strands of the thread in out-of-order issue stage 1560.
In another embodiment, memory system 1540 may include a retirement pointer 1582. Retirement pointer 1582 may store a value identifying the PO of the last retired instruction. Retirement pointer 1582 may be set by, for example, retirement unit 454. If no instructions have yet been retired, retirement pointer 1582 may include a null value.
Execution entities 1565 may include any suitable number and kind of mechanisms by which a processor may execute instructions. In the example of
Unit 1510 may be implemented in any suitable manner. In one embodiment, unit 1510 may perform cache control. In such an embodiment, unit 1510 may thus include a cache 1525. Cache 1525 may be implemented, in a further embodiment, as an L2 unified cache with any suitable size, such as zero, 128 k, 256 k, 512 k, 1M, or 2M bytes of memory. In another, further embodiment, cache 1525 may be implemented in error-correcting code memory. In another embodiment, unit 1510 may perform bus interfacing to other portions of a processor or electronic device. In such an embodiment, unit 1510 may thus include a bus interface unit 1520 for communicating over an interconnect, intraprocessor bus, interprocessor bus, or other communication bus, port, or line. Bus interface unit 1520 may provide interfacing in order to perform, for example, generation of the memory and input/output addresses for the transfer of data between execution entities 1565 and the portions of a system external to instruction architecture 1500.
To further facilitate its functions, bus interface unit 1520 may include an interrupt control and distribution unit 1511 for generating interrupts and other communications to other portions of a processor or electronic device. In one embodiment, bus interface unit 1520 may include a snoop control unit 1512 that handles cache access and coherency for multiple processing cores. In a further embodiment, to provide such functionality, snoop control unit 1512 may include a cache-to-cache transfer unit that handles information exchanges between different caches. In another, further embodiment, snoop control unit 1512 may include one or more snoop filters 1514 that monitors the coherency of other caches (not shown) so that a cache controller, such as unit 1510, does not have to perform such monitoring directly. Unit 1510 may include any suitable number of timers 1515 for synchronizing the actions of instruction architecture 1500. Also, unit 1510 may include an AC port 1516.
Memory system 1540 may include any suitable number and kind of mechanisms for storing information for the processing needs of instruction architecture 1500. In one embodiment, memory system 1540 may include a load store unit 1530 for storing information related to instructions that write to or read back from memory or registers. In another embodiment, memory system 1540 may include a translation lookaside buffer (TLB) 1545 that provides look-up of address values between physical and virtual addresses. In yet another embodiment, bus interface unit 1520 may include a memory management unit (MMU) 1544 for facilitating access to virtual memory. In still yet another embodiment, memory system 1540 may include a prefetcher 1543 for requesting instructions from memory before such instructions are actually needed to be executed, in order to reduce latency.
The operation of instruction architecture 1500 to execute an instruction may be performed through different stages. For example, using unit 1510 instruction prefetch stage 1530 may access an instruction through prefetcher 1543. Instructions retrieved may be stored in instruction cache 1532. Prefetch stage 1530 may enable an option 1531 for fast-loop mode, wherein a series of instructions forming a loop that is small enough to fit within a given cache are executed. In one embodiment, such an execution may be performed without needing to access additional instructions from, for example, instruction cache 1532. Determination of what instructions to prefetch may be made by, for example, branch prediction unit 1535, which may access indications of execution in global history 1536, indications of target addresses 1537, or contents of a return stack 1538 to determine which of branches 1557 of code will be executed next. Such branches may be possibly prefetched as a result. Branches 1557 may be produced through other stages of operation as described below. Instruction prefetch stage 1530 may provide instructions as well as any predictions about future instructions to dual instruction decode stage.
Dual instruction decode stage 1550 may translate a received instruction into microcode-based instructions that may be executed. Dual instruction decode stage 1550 may simultaneously decode two instructions per clock cycle. Furthermore, dual instruction decode stage 1550 may pass its results to register rename stage 1555. In addition, dual instruction decode stage 1550 may determine any resulting branches from its decoding and eventual execution of the microcode. Such results may be input into branches 1557.
Register rename stage 1555 may translate references to virtual registers or other resources into references to physical registers or resources. Register rename stage 1555 may include indications of such mapping in a register pool 1556. Register rename stage 1555 may alter the instructions as received and send the result to issue stage 1560.
Issue stage 1560 may issue or dispatch commands to execution entities 1565. Such issuance may be performed in an out-of-order fashion. In one embodiment, multiple instructions may be held at issue stage 1560 before being executed. Issue stage 1560 may include an instruction queue 1561 for holding such multiple commands. Instructions may be issued by issue stage 1560 to a particular processing entity 1565 based upon any acceptable criteria, such as availability or suitability of resources for execution of a given instruction. In one embodiment, issue stage 1560 may reorder the instructions within instruction queue 1561 such that the first instructions received might not be the first instructions executed. Based upon the ordering of instruction queue 1561, additional branching information may be provided to branches 1557. Issue stage 1560 may pass instructions to executing entities 1565 for execution.
Upon execution, writeback stage 1570 may write data into registers, queues, or other structures of instruction architecture 1500 to communicate the completion of a given command. Depending upon the order of instructions arranged in issue stage 1560, the operation of writeback stage 1570 may enable additional instructions to be executed. Performance of instruction architecture 1500 may be monitored or debugged by trace unit 1575.
Execution pipeline 1600 may include any suitable combination of steps or operations. In 1605, predictions of the branch that is to be executed next may be made. In one embodiment, such predictions may be based upon previous executions of instructions and the results thereof. In 1610, instructions corresponding to the predicted branch of execution may be loaded into an instruction cache. In 1615, one or more such instructions in the instruction cache may be fetched for execution. In 1620, the instructions that have been fetched may be decoded into microcode or more specific machine language. In one embodiment, multiple instructions may be simultaneously decoded. In 1625, references to registers or other resources within the decoded instructions may be reassigned. For example, references to virtual registers may be replaced with references to corresponding physical registers. In 1630, the instructions may be dispatched to queues for execution. In 1640, the instructions may be executed. Such execution may be performed in any suitable manner. In 1650, the instructions may be issued to a suitable execution entity. The manner in which the instruction is executed may depend upon the specific entity executing the instruction. For example, at 1655, an ALU may perform arithmetic functions. The ALU may utilize a single clock cycle for its operation, as well as two shifters. In one embodiment, two ALUs may be employed, and thus two instructions may be executed at 1655. At 1660, a determination of a resulting branch may be made. A program counter may be used to designate the destination to which the branch will be made. 1660 may be executed within a single clock cycle. At 1665, floating point arithmetic may be performed by one or more FPUs. The floating point operation may require multiple clock cycles to execute, such as two to ten cycles. At 1670, multiplication and division operations may be performed. Such operations may be performed in multiple clock cycles, such as four clock cycles. At 1675, loading and storing operations to registers or other portions of pipeline 1600 may be performed. The operations may include loading and storing addresses. Such operations may be performed in four clock cycles. At 1680, write-back operations may be performed as required by the resulting operations of 1655-1675.
Electronic device 1700 may include processor 1710 communicatively coupled to any suitable number or kind of components, peripherals, modules, or devices. Such coupling may be accomplished by any suitable kind of bus or interface, such as I2C bus, system management bus (SMBus), low pin count (LPC) bus, SPI, high definition audio (HDA) bus, Serial Advance Technology Attachment (SATA) bus, USB bus (versions 1, 2, 3), or Universal Asynchronous Receiver/Transmitter (UART) bus.
Such components may include, for example, a display 1724, a touch screen 1725, a touch pad 1730, a near field communications (NFC) unit 1745, a sensor hub 1740, a thermal sensor 1746, an express chipset (EC) 1735, a trusted platform module (TPM) 1738, BIOS/firmware/flash memory 1722, a digital signal processor 1760, a drive 1720 such as a solid state disk (SSD) or a hard disk drive (HDD), a wireless local area network (WLAN) unit 1750, a Bluetooth unit 1752, a wireless wide area network (WWAN) unit 1756, a global positioning system (GPS), a camera 1754 such as a USB 3.0 camera, or a low power double data rate (LPDDR) memory unit 1715 implemented in, for example, the LPDDR3 standard. These components may each be implemented in any suitable manner.
Furthermore, in various embodiments other components may be communicatively coupled to processor 1710 through the components discussed above. For example, an accelerometer 1741, ambient light sensor (ALS) 1742, compass 1743, and gyroscope 1744 may be communicatively coupled to sensor hub 1740. A thermal sensor 1739, fan 1737, keyboard 1746, and touch pad 1730 may be communicatively coupled to EC 1735. Speaker 1763, headphones 1764, and a microphone 1765 may be communicatively coupled to an audio unit 1764, which may in turn be communicatively coupled to DSP 1760. Audio unit 1764 may include, for example, an audio codec and a class D amplifier. A SIM card 1757 may be communicatively coupled to WWAN unit 1756. Components such as WLAN unit 1750 and Bluetooth unit 1752, as well as WWAN unit 1756 may be implemented in a next generation form factor (NGFF).
Embodiments of the present disclosure involve an instruction and logic for in-translation bit setting for binary translations in association with page table walks. The bit setting may be of designations of page tables that have been accessed (.A) or been made dirty (.D) (or written to).
System 1800 may include memory 1812 inside or communicatively coupled to one or more processors, such as processor 1802. Memory 1812 may be organized in physical memory addresses, but may be referenced in or by elements processor 1802 in terms of logical or virtual memory. In order to map between logical and physical memory, system 1800 may include page tables 1816. When an access to virtual memory is made, the corresponding physical address may be looked up in an appropriate page table 1816. Page tables 1816 may be implemented in any suitable manner or place in system 1800. For example, page tables 1816 may be implemented as a data structure in memory 1812. To speed look-up operations, processor 1802 may cache one or more entries from the page tables 1816. Processor 1802 may cache page tables in any suitable manner or location. For example, processor 1802 may cache page tables in a translation lookaside buffer (TLB) 1830. TLB 1830 may be implemented in content-addressable memory. Thus, TLB 1830 may include cached page tables (CPT) 1832. Although CPT 1832 is described as ‘page tables,’ they may implement any suitable subset of information of page tables, such as the mapping between logical and physical memory. The caching of page tables may be controlled by, for example, a memory management unit (MMU) 1828. When a virtual address needs to be translated into a physical address to fulfill, for example, the execution of an instruction from instruction stream 1804, TLB 1830 may be searched for a corresponding CPT 1832 for the translation to be performed. If there is a hit in the TLB 1830 for the corresponding CPT 1832, then the physical address may be returned and execution continues. However, if there is a miss in the TLB 1830 for the corresponding CPT 1832, then MMU 1828 may cause PMH 1834 perform a page table walk to find the appropriate page table 1816 to perform the mapping by, for example, accessing other levels of cache or the actual version of the page table 1816. The page table walk may be performed by, for example, a page miss handler (PMH) 1834. Furthermore, the new mapping may be cached to TLB 1830 as a result of a miss.
Page tables may also include bits to indicate whether the page has been accessed via the page table mapping. Such bits may be referred to as ‘.A’ bits. Page tables may also include bits to indicate whether the page contents have been modified via the page table mapping. Such bits may be referred to as ‘.D’ bits. During a page table walk, PMH 1834 may set .A bits that it encounters that are clear. Furthermore, during a page table walk, PMH 1834 may set .D bits that it encounters if the instruction that caused the page table walk was a store operation or instruction. In addition, if a hit in TLB 1830 yielded an entry with a cleared .D bit, then a page table walk may be triggered in order to set .D bits as necessary. This may be subject to the same constraint mentioned above, that .D is set only if the hit in the TLB was a store operation or instruction.
Binary translation may include modifying code during run-time of instructions. Binary translation may be performed to increase instruction-level parallelism, wherein code regions may be executed out-of-order. Binary translation may execute a ‘guest’ instruction set by translating sequences of ‘guest’ or non-native instructions to sequences of ‘host’ or native hardware instructions. The result may include a ‘translation.’ The native host may then execute the translation to simulate the original guest code. In various embodiments, the binary translation may involve reordering guest loads and stores to better increase instruction-level parallelism. However, reordering loads and stores may also reorder implicit stores that update .A and .D bits of page tables. Binary translation may include code modifications. A device may write an instruction that it subsequently executes, which may be referred to as “self-modifying code”. Furthermore, a device may write an instruction that another device subsequently executes, which may be referred to as “cross-modifying code”. In addition, an external agent may write an instruction that an internal agent subsequently executes, which may include modifications caused by “DMA modifying code”, although mechanisms other than DMA may be used to change the code. Binary translation may be performed by binary translator 1810. Binary translator may be implemented within processor 1802 or within system 1800 but outside of processor 1802. Binary translator 1810 may be implemented in any suitable manner. In one embodiment, binary translator 1810 may be implemented by a hardware device, including a finite state machine and logic implemented in processor 1802. In another embodiment, binary translator 1810 may be implemented by instructions in software. In various embodiments, binary translator 1810 may be implemented by a combination of hardware and software. Binary translator 1810 may write its results to any suitable location, such a memory.
Use of binary translator 1810 may lose performance on some page table accesses. First, binary translator 1810 may reorder memory operations as discussed above. However, memory accesses, such as implicit stores that update .A and .D bits (indicating that the page table was accessed or is dirty), might not be reorderable. This may be because .A and .D stores may require ordering according to a memory model, and the reordering may violate the model. One approach to reconciling the binary translation with the set .A and .D bits is to perform the region of instructions completely in-order. However, this approach may be slow. If the conflict is ignored, reordering some memory operations may violate memory ordering and causes errors.
In one embodiment, system 1800 may evaluate whether memory reordering is visible and, depending upon whether it is invisible, perform bit setting during binary translation. In such an embodiment, system 1800 may determine that problems with reordering set .A and .D bits may exist if the reordered operations are visible. The memory operations might not be visible if they are in data-independent sections of code. If the set .A and .D bits are in a data-dependent section of code, the memory ordering problems may still exist. Accordingly, in one embodiment system 1800 may determine if reordering of set .A and .D bits in a translation is correct or allowable, and, if so, allow the operations accessing these to be executed from within the translation. Otherwise, an approach such as a forced in-order execution may be used.
Ordering in binary translation may include building translations on hardware atomic regions that may be called ‘transactions.’ In one embodiment, system 1800 may determine whether a write to a page with a set .A or .D bit touches a non-cacheable memory type. If so, reordering of the memory operations may be problematic and a forced in-order execution may be used instead. In another embodiment, system 1800 may determine whether a write to a page with a set .A or .D bit overlaps with a location that is also touched by an explicit load or store in the same transaction. If so, reordering of the memory operations may be problematic and a forced in-order execution may be used instead. Many set .A and .D bits arise from user-space code which does not have the privilege to read or write page tables. Moreover, operating system code may isolate page table accesses, as race conditions might otherwise emerge. Nevertheless, if the write is to a page with a set .A or .D bit is within the same transaction as an explicit load or store, then the reordering may be problematic. In yet another embodiment, once a transaction completes, ordering might not be problematic as the issues of set .A and .D bits might not spill over to the other transaction. Under most situations, it may be rare that conflicts may make a .A or .D visible. Thus, in some systems the more common case may be penalized, as .A and .D may be treated as they are likely to be visible, which may slow execution. As conflicts may be rare, it may be correct more often than not to use in-translation .A or .D bits, which may be faster. Thus, a mechanism that detects the cases that are actually uncommon may allow better use of in-translation .A and .D bits in most situations.
In order to monitor for problematic memory operations during binary translation associated with set .A or .D bits, system 1800 may include any suitable mechanism, including those discussed above. In one embodiment, system 1800 may include a watcher unit 1834, though the functionality of watcher unit 1834 as described herein may be implemented in any suitable portion of system 1800. Watcher unit 1834 may include a monitoring unit, filter, or other logic to perform the functionality described herein. In another embodiment, watcher unit 1834 may monitor memory transactions and, if a load or store therein matches an address tracked by watcher unit 1834, the transaction may be aborted and the transaction reexecuted, for example, in-order. The tracked addresses may include those that have had their .A or .D bits set. In yet another embodiment, on a miss of TLB 1830 that sets .A or .D bits, new addresses used in the page table walk may be inserted into watcher unit 1800 for further watching. In addition, the transaction may be aborted after a page table walk and reexecuted.
In one embodiment, a load or store that overlaps with a watched location identified by watcher unit 1834 may cause the transaction execution to be terminated and restarted with, for example, an in-order execution. Watcher unit 1834 may be cleared for each new transaction. In another embodiment, if a transaction sets too may .A or .D bits, watcher unit 1834 might overflow, causing the transaction execution to be terminated and restarted with, for example, an in-order execution. In yet another embodiment, if the end of the transaction is reached with no aborts, the transaction may be allowed to complete.
Processor 1802 may be implemented in any suitable manner to execute multiple instructions in parallel and out-of-order. In one embodiment, processor 1802 may execute instructions such that instructions are fetched, issued, and executed out of program order. All instructions except memory and interruptible instructions might be committed or retired out of program order. However, in one embodiment memory and interruptible instructions might be committed or retired in-order, relatively or as a whole. Such in-order commitment and retirement may be a result of mispredictions or possible data-dependence mistakes or errors. In-order execution may include execution according to a sequential PO values. Out-of-order execution may include execution that does not necessarily follow sequential PO values. System 1800 may illustrate elements of processor 1802, which may also include any component, processor core, logical processor, processor, or other processing entity or elements such as those illustrated in
Binary translator 1810 may be implemented in any suitable manner. In one embodiment, binary translator 1810 may be implemented by a hardware device, including a finite state machine and logic implemented in processor 1802. In another embodiment, binary translator 1810 may be implemented by instructions in software. In various embodiments, binary translator 1810 may be implemented by a combination of hardware and software. Binary translator 1810 may write its results to any suitable location, such a memory. Such memory may include, for example, specialized memory or to a portion of generally accessible memory.
In one embodiment, code to be processed by system 1800 may include host code and guest code. Host code may include code that is to be executed by processors such as processor 1802. Guest code may include code that is being translated by, for example, binary translator 1810. Accordingly, memory including host code may be referred to as host memory and memory including guest code may be referred to as guest memory.
Binary translator 1810 may read a sequence of guest code and generate a sequence of host code as a result of translation. When executed, the host code should have the same effect as if the guest code were executed directly. Accordingly, system 1800 may preserve equivalent functionality of translated code and the original code. Guest code, the input for translation, may be implemented in any suitable format. Guest code may often include instructions for a processor format, such as instructions for x86 processors. Furthermore, guest code may commonly also include instructions for hypothetical, generalized, or virtual processors. Such instructions may include, for example, Java bytecodes that are in processor-independent form. Host code, resulting from translation, may be implemented in any suitable format. Host code may often include instructions in a processor format, and might also include instructions in a format for virtual processors. Host code and guest code formats as used within system 1800 may be different, but in some embodiments may be the same. For example, binary translator 1810 may read x86-formatted instructions and produce x86-formatted instructions. The resultant instructions may both implement the original functionality of the input instructions as well as save performance-tracing information when executed. Guest code, before translation, may be subject to code modifications. When guest code is modified, the effect of the modification should be equivalent as if the guest code was being executed by a suitable hardware processor. Binary translator 1810 may thus run modified guest code as if it were run by a hardware processor.
Binary translator 1810 may read instructions in guest code and generate host instructions. As discussed above, these generated host instructions may be referred to as translations and an atomic region of translated code may be referred to as a transaction. Execution of the translations by, for example, processor 1802 or an interpreter may include the same effect as if the original guest instructions were executed.
Processor 1802 may include a front end 1806 to fetch instructions from memory or an instruction stream 1804. The contents of instruction stream 1804 may be translated by binary translator 1810 or may have been produced by binary translator 1810. The instructions may be decoded by a decoder 1808. Each of execution units 1820 may be execute instructions as they are allocated, scheduled, and dispatched by scheduler/allocator 1818. In addition, cores or processor 1802 may include a retirement unit 1822 along with senior store buffer (SSB) 1826 and a retirement order buffer (ROB) 1824 for handling retirement and commitment of instructions. One or more portions of processor 1802 may be organized into one or more core or uncore sections.
Various operations to be executed by processor 1802 may be marked to execute at retirement. Such a marking may be slower than other executions but may ensure ordering properties. Furthermore, some operations may stall and drain SSB 1826. After execution and retirement of store operations, drains of senior store buffers may be requested. Such senior stores may include store operations that have been executed, retired, but not yet committed to data caches or other aspects of processor 1802.
The operation of system 1800 may be described in terms of loads and stores. However, system 1800 may similarly handle other instructions that include several memory operands that load or store to memory. Furthermore, system 1800 may handle operations that might touch multiple TLB entries per operand.
In operation, a series of instructions may be translated by binary translator 1810 for execution by execution units 1820. The series of instructions may include those in an atomic region of instructions. The resulting transaction may be arranged for out-of-order execution by one or more execution units.
When an instruction in the transaction includes a memory access, such as a load, store, or instruction utilizing one of these, the execution units 1820 may request the address associated with the load source or destination or store destination. The address request may be made of a memory subsystem, which may include a cache hierarchy, not shown. The request may be handled by MMU 1828. MMU 1828 may first determine whether mapping for a logical address as requested by the instruction to a physical address as resident within memory 1812 exists within the local TLB 1832 and cached versions of page tables (CPT 1832). If so, MMU 1812 may translate the address and make the request of portions of the memory subsystem. If not, a TLB miss may have occurred and MMU 1828 may request that the miss be handled by PMH 1834. PMH may perform a page table walk through various levels of cache and memory 1812 to obtain the contents of the associated page tables 1816 for the request. Each page table address that is touched or modified by the page table walk may be marked by setting a .A or .D bit, as appropriate. The page table mapping may be returned to MMU 1828. The new page table may be provided to TLB 1830. The transaction may be restarted.
In one embodiment, PMH 1834 may populate watcher unit 1836 with an indication of the page tables that were modified or accessed and whose .A or .D bits were set during the page table walk. In another embodiment, during a subsequent memory instruction execution, MMU 1828 may check watcher unit 1836 to determine whether a given address was associated with having its page table's .A or a .D bit set during the page table walk of PMH 1834. If so, watcher unit 1836 may return an indication that the requested address is present, and thus the associated page table's .A or .D bits are not clear. In one embodiment, MMU 1828 or watcher unit 1836 may terminate execution of the transaction based upon this determination. The transaction may be reexecuted using in- order execution, rather than out-of-order execution. If the given address did not have its page table's .A or .D bit set during the page table walk of PMH 1834, then such bits may be clear and the address might not be in watcher unit 1836. In another embodiment, MMU 1828 or watcher unit 1836 may allow further execution of the transaction based upon this determination.
In one embodiment, when PMH 1834 tries to set a .A or .D bit during a speculative page table walk (for a transaction that has been translated), the associated instruction may be marked to execute at retirement. Furthermore, if the type of memory holding the .A or .D bit is uncacheable, the transaction may be aborted and in-order execution used instead.
System 1800 may utilize multiple levels of page tables, in which case several page tables may be read during a page table walk to construct the final entry for TLB 1830. A store that changes page tables may change the operation of the page table walk. Thus, the .A and .D bits for different walks and the associated mapping may vary relatively depending upon when the store occurs. Accordingly, in one embodiment all locations read in a page table walk may be added to watcher unit 1836, even if no .A or .D bits are set for a given location. This may prevent any reordered store from updating the page tables and changing the walk.
A single transaction may yield several page table walks in which .A or .D bits are sets. By setting the bits, the same result may occur regardless of the order in which the walks occurred (and thus bits were set). Furthermore, the execution within the transaction and the atomic nature of the region which spawned the transaction may ensure that no other cores of processor 1802 might observe the operations therein as reordered. In addition, watcher unit 1836 may ensure that no stores within the transaction change locations that affect which page table locations are actually used.
As discussed above, when new entries are inserted to watcher unit 1836 after a page table walk, the transaction is aborted and re-started. The transaction may be restarted to assure that watcher unit 1836 compares watched locations against all addresses touched by the translation, including addresses for loads and stores which appeared in the transaction before the operation that caused setting of .A and .D bits. System 1800 may thus compare sets .A and .D bits against “earlier” loads or stores. These earlier loads and stores may have been reordered by binary translator 1810 but are actually “later” in the original code.
In one embodiment, aborting or terminating the transaction may also discard .A and .D updates. Thus, when the operation that set the bits is reencountered, watcher unit 1836 may verify that each .A and .D bit being set is already present in watcher unit 1836. If they are already present, then setting may be allowed to proceed. No new watcher unit 1836 entries might be added. When a “new” address is encountered (such as another .A or .D bit setting miss, or page tables have changed since watcher unit 1836 was set). The address may be added to watcher unit 1836 and the transaction restarted.
In one embodiment, termination and restart operations might be limited, rather than being allowed to loop forever. Termination and restart may be required when entries are added to watcher unit 1836, but such an operation also consumes space in watcher unit 1836. Thus, either the transaction may complete or it will exhaust space in watcher unit 1836, aborting the transaction to use a different approach. Accordingly, forward progress in execution is assured wherein a transaction has several memory operations that set .A and .D bits, as well as wherein transactions wherein the page tables are changed between transaction retries.
Entries in TLB 1830 may be speculative. A speculative entry therein is valid if the transaction completes, but may be invalid if the transaction aborts (including aborts unrelated to the watcher). Thus, if TLB 1830 supports speculative entries (discard on transaction abort), in one embodiment the entry may be loaded into TLB 1830 as marked speculative. If TLB 1830 does not support speculative entries, the entry should be formed and consumed by the memory operation, but might not be entered into TLB 1830. When several operations in the same transaction use the same mapping, the mapping might be reconstructed each time. Later uses of the same transaction do not set new bits, and thus do not cause transaction abort and restart. Re-walking off the page table walk may be accelerated by particular designs of PMH 1834. A transaction commit may commit speculative .A and .D bit updates.
When a transaction commits, SSB 1826 might be drained to ensure ordering. For example, suppose the guest order is
LD X
ST Y
LD Z
and the LD Z implicitly sets an .A bit. Binary translator 1810 may reorder these to
LD X
LD Z
ST Y
If SSB 1826 is not drained, then the setting of the .A bit may reach global order (GO) before Y. Draining SSB 1826 may ensure all stores are GO before the transaction commit and so appear atomically to other portions of code. Re-ordering may thus be invisible.
These steps may be taken to conform to a specific set of .A and .D bit ordering rules. Other processors and systems may include different ordering rules that may allow optimizations or impose further restrictions that may be accounted-for. For example, ordering rules that tolerate more aggressive TLB 1830 entry prefetching may also reduce the number of entries required in the watcher.
Furthermore, these steps may assume that host operations in the transaction provide no information about the original guest order. It may be advantageous for other reasons to provide guest ordering information to components such as MMU 1828, PMH 1834, and watcher unit 1836. If such data is available during setting of .A and .D bits, the data may be used to skip watching of some instructions. In one embodiment, watching may be skipped when no load or store is reordered across .A or .D bit setting, even when other loads and stores in the transaction are reordered with respect to each other. In addition, the steps are described as examples within the scope of a single transaction.
Binary translator 1810 may make memory operation speculations across transactions. For example, a load may be “hoisted” one or several iterations earlier in a loop and thus in an earlier transaction. Guest memory models might prohibit setting .A and .D bits speculatively, which in turn prohibits execution of such “hoisted” loads if they set .A or .D bits. System 1800 may allow in-translation setting of .A and .D bits. Furthermore, system 1800 may include a mechanism to indicate when memory operations are speculated across transactions and thus still require an abort. In one embodiment, binary translator 1810 may mark specific memory operations as “speculated.” MMU 1828 (or another suitable part of system 1800) may abort speculated operations if they attempt to set .A or .D bits. In another embodiment, binary translator 1810 may mark transaction that at least one memory operation which has been speculated across transactions. MMU 1828 (or another suitable mechanism) may abort such a memory operation if the memory operation attempts to set .A or .D bits. Such a termination may be made whether or not the specific operation was speculated across transactions.
As discussed above, the various steps of evaluating memory instructions in view of set .A or .D bits may be implemented by any suitable portion of system 1800. For example, these may be set by PMU 1434, binary translator 1810, MMU 1828, or watcher unit 1838. The functionality of these may be combined as necessary. Furthermore, these may be implemented in hardware or a combination of hardware and built-in software.
Watcher unit 1836 may be implemented in any suitable manner, such as with content-addressable memory. Watcher unit 1836 may be notionally associative. Furthermore, watcher unit 1836 may be implemented by any suitable data structure such as a hash table or Bloom filter, provided that the structure implements the basic operations needed by the watcher. Watcher unit 1836 may require that it never report “already seen” or “present” for a new address.
Watcher unit 1836 may include an index by address or address tag. Furthermore, it may include, for each entry, a bit denoting whether the address is “present” or not, meaning that the address was populated by PMH 1834 as associated with the page table walk. Initially, all values of watcher unit 1836 may be set to invalid. As walk addresses are entered by PMH 1834 or another element, the addresses may be marked as valid.
Upon a subsequent memory operation, such as a store or load, watcher unit 1836 may be accessed to see if the address was encountered and marked during the page table walk. If the address matches an entry in watcher unit 1836, it may return “present” to indicate that the address was found. The transaction may thus be aborted and restarted in an in-order manner of execution. If the address does not match any valid entries in watcher unit 1836, it may return “not present” to indicate that the address was not found. The instruction may be allowed to execute.
At 2005, an atomic region of instructions to be executed may be received. The region of instructions may be translated by a binary translator. Moreover, the instructions may be reordered. Execution of the translation may be entered. In one embodiment, a watcher unit may be cleared.
At 2010, it may be determined whether there are additional instructions or work remaining to be performed in the transaction resulting from the translated atomic region. If so, method 2000 may proceed to 2015. Otherwise, method 2000 may proceed to 2065.
At 2015, a load or store instruction, or an operation including or implying such an instruction or its equivalent, may be selected for execution. In one embodiment, it may be determined whether the destination address for the instruction is included in the watcher unit, as previously identified as associated with a page table walk. If so, method 2000 may proceed to 2060. Otherwise, method 2000 may proceed to 2020.
At 2020, it may be determined whether mapping for the address (or mapping for another instruction's address, separately received) is available in page tables in a TLB. If there is a TLB miss, method 2000 may proceed to 2025. Otherwise, method 2000 may proceed to 2030.
At 2025, the instruction may be executed. Execution may be advanced to a next instruction. Method 2000 may proceed to 2010.
At 2030, a page table walk may be performed to obtain correct page tables. In one embodiment, it may be determined whether the page table walk was made completely within cacheable memory, or whether non-cacheable memory was involved. If the page table walk was made completely within cacheable memory, method 2000 may proceed to 2035. Otherwise, method 2000 may proceed to 2060.
At 2035, in one embodiment it may be determined whether any .A or .D bits were set during the page table walk. If not, method 2000 may proceed to 2040. Otherwise, method 2000 may proceed to 2045.
At 2045, in one embodiment it may be determined whether any new addresses need to be added to the watcher unit. The new addresses may include addresses those of the set .A or .D bits. Furthermore, the new addresses may include addresses encountered while on the page table walk. If any addresses are not within the watcher unit, method 2000 may proceed to 2050. Otherwise, method 2000 may proceed to 2040.
At 2040, the TLB may be loaded with the newly found page tables. Execution of the instruction may be restarted. Method 2000 may proceed to 2010.
At 2050, in one embodiment it may be determined whether the watcher unit is full or overflowed. If so, method 2000 may proceed to 2060. Otherwise, method 2000 may proceed to 2055.
At 2055, in one embodiment it may be determined that the in-translation bit setting will work correctly for the present transaction. In another embodiment, the new addresses, not otherwise within the watcher unit, may be added to the watcher unit and set as valid. The TLB may be loaded with the newly found page tables. The execution of the transaction may be aborted and the transaction execution restarted. Method 2000 may proceed to 2010.
At 2060, in one embodiment it may be determined that the in-translation bit setting will not work correctly for the present transaction. The TLB may be loaded with the newly found page tables, if needed. The execution of the transaction may be aborted. The transaction may be executed, for example, in-order.
At 2065 as no additional work needs to be performed for the transaction, it may be determined whether any .A or .D bits were set during execution of the transaction. If so, the associated instructions might have been set to execute-at-retirement, and so at 2070 the SSB may be drained. At 2075, the transaction may be committed. Method 2000 may terminate or optionally repeat.
Although the methods described above illustrate an operation of particular elements, the methods may be performed by any suitable combination or type of elements. For example, the methods above may be implemented by the elements illustrated in
Embodiments of the mechanisms disclosed herein may be implemented in hardware, software, firmware, or a combination of such implementation approaches. Embodiments of the disclosure may be implemented as computer programs or program code executing on programmable systems comprising at least one processor, a storage system (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device.
Program code may be applied to input instructions to perform the functions described herein and generate output information. The output information may be applied to one or more output devices, in known fashion. For purposes of this application, a processing system may include any system that has a processor, such as, for example; a digital signal processor (DSP), a microcontroller, an application specific integrated circuit (ASIC), or a microprocessor.
The program code may be implemented in a high level procedural or object oriented programming language to communicate with a processing system. The program code may also be implemented in assembly or machine language, if desired. In fact, the mechanisms described herein are not limited in scope to any particular programming language. In any case, the language may be a compiled or interpreted language.
One or more aspects of at least one embodiment may be implemented by representative instructions stored on a machine-readable medium which represents various logic within the processor, which when read by a machine causes the machine to fabricate logic to perform the techniques described herein. Such representations, known as “IP cores” may be stored on a tangible, machine-readable medium and supplied to various customers or manufacturing facilities to load into the fabrication machines that actually make the logic or processor.
Such machine-readable storage media may include, without limitation, non- transitory, tangible arrangements of articles manufactured or formed by a machine or device, including storage media such as hard disks, any other type of disk including floppy disks, optical disks, compact disk read-only memories (CD-ROMs), compact disk rewritables (CD-RWs), and magneto-optical disks, semiconductor devices such as read- only memories (ROMs), random access memories (RAMs) such as dynamic random access memories (DRAMs), static random access memories (SRAMs), erasable programmable read-only memories (EPROMs), flash memories, electrically erasable programmable read- only memories (EEPROMs), magnetic or optical cards, or any other type of media suitable for storing electronic instructions.
Accordingly, embodiments of the disclosure may also include non-transitory, tangible machine-readable media containing instructions or containing design data, such as Hardware Description Language (HDL), which defines structures, circuits, apparatuses, processors and/or system features described herein. Such embodiments may also be referred to as program products.
In some cases, an instruction converter may be used to convert an instruction from a source instruction set to a target instruction set. For example, the instruction converter may translate (e.g., using static binary translation, dynamic binary translation including dynamic compilation), morph, emulate, or otherwise convert an instruction to one or more other instructions to be processed by the core. The instruction converter may be implemented in software, hardware, firmware, or a combination thereof. The instruction converter may be on processor, off processor, or part-on and part-off processor.
Thus, techniques for performing one or more instructions according to at least one embodiment are disclosed. While certain exemplary embodiments have been described and shown in the accompanying drawings, it is to be understood that such embodiments are merely illustrative of and not restrictive on other embodiments, and that such embodiments not be limited to the specific constructions and arrangements shown and described, since various other modifications may occur to those ordinarily skilled in the art upon studying this disclosure. In an area of technology such as this, where growth is fast and further advancements are not easily foreseen, the disclosed embodiments may be readily modifiable in arrangement and detail as facilitated by enabling technological advancements without departing from the principles of the present disclosure or the scope of the accompanying claims.
