PREDICTING MEMORY INSTRUCTION PUNTS IN A COMPUTER PROCESSOR USING A PUNT AVOIDANCE TABLE (PAT)

Abstract

Predicting memory instruction punts in a computer processor using a punt avoidance table (PAT) are disclosed. In one aspect, an instruction processing circuit accesses a PAT containing entries each comprising an address of a memory instruction. Upon detecting a memory instruction in an instruction stream, the instruction processing circuit determines whether the PAT contains an entry having an address of the memory instruction. If so, the instruction processing circuit prevents the detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction, to preempt a memory instruction punt. In some aspects, the instruction processing circuit may determine, upon execution of a pending memory instruction, whether a hazard associated with the detected memory instruction has occurred. If so, an entry for the detected memory instruction is generated in the PAT.

Description

BACKGROUND

I. Field of the Disclosure

The technology of the disclosure relates generally to processing memory instructions in an out-of-order (OOO) computer processor, and, in particular, to avoiding re-fetching and re-executing instructions due to hazards.

II. Background

Out-of-order (OOO) processors are computer processors that are capable of executing computer program instructions in an order determined by an availability of each instruction's input operands, regardless of the order of appearance of the instructions in a computer program. By executing instructions out-of-order, an OOO processor may be able to fully utilize processor clock cycles that would otherwise be wasted while the OOO processor waits for data access operations to complete. For example, instead of having to “stall” (i.e., intentionally introduce a processing delay) while input data is retrieved for an older program instruction, the OOO processor may proceed with executing a more recently fetched instruction that is able to execute immediately. In this manner, processor clock cycles may be more productively utilized by the OOO processor, resulting in an increase in the number of instructions that the OOO processor is capable of processing per processor clock cycle.

However, out-of-order execution of memory instructions may result in the occurrence of “punts.” Punts are circumstances in which one or more memory instructions must be re-fetched and re-executed due to a detected hazard. For example, a punt may result from an occurrence of a read-after-write (RAW) hazard, a read-after-read (RAR) hazard, and/or a resource constraint hazard such as a lack of available load queue entries or store queue entries, as non-limiting examples. Re-fetching and re-execution of memory instructions may reduce processor performance and result in greater power consumption.

SUMMARY OF THE DISCLOSURE

Aspects disclosed in the detailed description include predicting memory instruction punts in a computer processor using a punt avoidance table (PAT). In this regard, in one aspect, an instruction processing circuit in a computer processor accesses a PAT for predicting and preempting memory instruction punts. As used herein, a “punt” refers to a process of re-fetching and re-executing a memory instruction and one or more older memory instructions in a computer processor, in response to a hazard condition arising from out-of-order execution of the memory instruction. The PAT contains one or more entries, each comprising an address of a memory instruction that was previously executed out-of-order and that resulted in a memory instruction punt. During execution of a computer program, an instruction processing circuit detects a memory instruction in an instruction stream, and determines whether the PAT contains an entry having an address corresponding to the memory instruction. If the PAT contains an entry having an address corresponding to the memory instruction, the instruction processing circuit may preempt a punt by preventing the detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction. As non-limiting examples, the instruction processing circuit in some aspects may perform an in-order dispatch of the at least one pending memory instruction older than the detected memory instruction, or may prevent an early return of data by the detected memory instruction until the at least one pending memory instruction older than the detected memory instruction has completed. In this manner, the instruction processing circuit may reduce the occurrence of memory instruction punts, thus providing improved processor performance.

Further, in some exemplary aspects in which the hazard encountered by the instruction processing circuit is a read-after-write (RAW) hazard, the instruction processing circuit may prevent the detected memory instruction from taking effect before any pending memory store instructions older than the detected memory instruction. As another exemplary aspect, when the hazard encountered by the instruction processing circuit is a read-after-read (RAR) hazard, the instruction processing circuit may prevent the detected memory instruction from taking effect before any pending memory load instructions older than the detected memory instruction. For aspects in which the hazard is a resource constraint hazard, the instruction processing circuit may prevent the detected memory instruction from taking effect before any pending memory instructions older than the detected memory instruction.

In another aspect, an instruction processing circuit in an OOO computer processor is provided. The instruction processing circuit is communicatively coupled to a front-end circuit of an execution pipeline, and comprises a PAT providing a plurality of entries. The instruction processing circuit is configured to prevent a detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction to preempt a memory instruction punt, responsive to determining that an address of the detected memory instruction is present in an entry of the plurality of entries of the PAT.

In another aspect, an instruction processing circuit is provided in an OOO computer processor. The instruction processing circuit comprises a means for providing a plurality of entries in a PAT. The instruction processing circuit also comprises a means for preventing a detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction to preempt a memory instruction punt, responsive to determining that an address of the detected memory instruction is present in an entry of the plurality of entries of the PAT.

In another aspect, a method for predicting memory instruction punts is provided. The method comprises detecting, in an instruction stream, a memory instruction. The method further comprises determining whether an address of the detected memory instruction is present in an entry of a PAT. The method also comprises, responsive to determining that the address of the detected memory instruction is present in the entry, preventing the detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction, to preempt a memory instruction punt.

In another aspect, a non-transitory computer-readable medium is provided, having stored thereon computer-executable instructions, which when executed by a processor, cause the processor to detect, in an instruction stream, a memory instruction. The computer-executable instructions stored thereon further cause the processor to determine whether an address of the detected memory instruction is present in an entry of a PAT. The computer-executable instructions stored thereon also cause the processor to, responsive to determining that the address of the detected memory instruction is present in the entry, prevent the detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction, to preempt a memory instruction punt.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 is a block diagram of an exemplary out-of-order (OOO) computer processor including an instruction processing circuit configured to predict memory instruction punts using a punt avoidance table (PAT);

FIG. 2 is a block diagram illustrating entries of an exemplary PAT of the instruction processing circuit of FIG. 1;

FIGS. 3A-3C illustrate exemplary communications flows of the instruction processing circuit in FIG. 1 for establishing an entry in the PAT of FIG. 1, and subsequently preempting a memory instruction punt in response to detecting a memory instruction;

FIGS. 4A-4C are flowcharts illustrating exemplary operations of the instruction processing circuit in FIG. 1 of predicting memory instruction punts using the PAT of the instruction processing circuit; and

FIG. 5 is a block diagram of an exemplary processor-based system that can include the instruction processing circuit of FIG. 1 configured to predict memory instruction punts using a PAT.

DETAILED DESCRIPTION

With reference now to the drawing figures, several exemplary aspects of the present disclosure are described. The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects.

Aspects disclosed in the detailed description include predicting memory instruction punts in a computer processor using a punt avoidance table (PAT). In this regard, FIG. 1 is a block diagram of an exemplary out-of-order (OOO) computer processor 100 providing out-of-order processing of instructions to increase instruction processing parallelism. As discussed in more detail below, the OOO computer processor 100 includes an instruction processing circuit 102 that accesses a PAT 104 for predicting memory instruction punts. The term “memory instruction” as used herein refers generally to memory load instructions and/or memory store instructions, as non-limiting examples. The OOO computer processor 100 may encompass any one of known digital logic elements, semiconductor circuits, processing cores, and/or memory structures, among other elements, or combinations thereof. Aspects described herein are not restricted to any particular arrangement of elements, and the disclosed techniques may be easily extended to various structures and layouts on semiconductor dies or packages.

The OOO computer processor 100 includes a memory interface circuit 106, an instruction cache 108, and a load/store unit 110 comprising a data cache 112 and a load/store queue 114. In some aspects, the data cache 112 may comprise an on-chip Level 1 (L1) data cache, as a non-limiting example. The OOO computer processor 100 further comprises an execution pipeline 116 that includes the instruction processing circuit 102. The instruction processing circuit 102 provides a front-end circuit 118, an execution unit 120, and a completion unit 122. The OOO computer processor 100 additionally includes registers 124, which comprise one or more general purpose registers (GPRs) 126, a program counter 128, and a link register 130. In some aspects, such as those employing the ARM® ARM7™ architecture, the link register 130 is one of the GPRs 126, as shown in FIG. 1. Alternately, some aspects, such as those utilizing the IBM® PowerPC® architecture, may provide that the link register 130 is separate from the GPRs 126 (not shown).

In exemplary operation, the front-end circuit 118 of the execution pipeline 116 fetches instructions (not shown) from the instruction cache 108, which in some aspects may be an on-chip Level 1 (L1) cache, as a non-limiting example. The fetched instructions are decoded by the front-end circuit 118 and issued to the execution unit 120. The execution unit 120 executes the issued instructions, and the completion unit 122 retires the executed instructions. In some aspects, the completion unit 122 may comprise a write-back mechanism (not shown) that stores the execution results in one or more of the registers 124. It is to be understood that the execution unit 120 and/or the completion unit 122 may each comprise one or more sequential pipeline stages. In the example of FIG. 1, the front-end circuit 118 comprises one or more fetch/decode pipeline stages 132, which enable multiple instructions to be fetched and decoded concurrently. An instruction queue 134 for holding the fetched instructions pending dispatch to the execution unit 120 is communicatively coupled to one or more of the fetch/decode pipeline stages 132.

While processing instructions in the execution pipeline 116, the instruction processing circuit 102 may execute memory instructions, such as memory load instructions and/or memory store instructions, in an order that is different from the program order in which the instructions are fetched. As a result, under some circumstances, the out-of-order execution of memory instructions may result in the occurrence of memory instruction “punts,” in which a memory instruction and one or more older memory instructions must be re-fetched and re-executed due to a detected hazard. For example, a younger memory load instruction executed prior to an older memory store instruction to the same memory address may result in a RAW hazard, thereby requiring the memory load instruction and the memory store instruction to be re-fetched and re-executed. Similarly, a younger memory load instruction executed prior to an older memory load instruction to the same memory address may cause a RAR hazard to occur, necessitating the re-fetching and re-executing of both memory load instructions. In some aspects, younger memory load instructions may consume all of an available resource (e.g., load queue entries (not shown) or store queue entries (not shown), as non-limiting examples), preventing older memory instructions from executing, and thereby requiring all of the pending memory instructions to be re-fetched and re-executed. In each of these circumstances, the re-fetching and re-execution of memory instructions may negatively affect processor performance and may result in greater power consumption.

In this regard, the instruction processing circuit 102 of FIG. 1 is includes the PAT 104 for predicting memory instruction punts. The instruction processing circuit 102 is configured to detect a memory instruction (not shown) in an instruction stream (not shown) being processed within the execution pipeline 116. As the memory instruction is fetched by the front-end circuit 118 of the instruction processing circuit 102, the instruction processing circuit 102 consults the PAT 104. The PAT 104 contains one or more entries (not shown). Each entry of the PAT 104 may include an address of a previously-detected memory instruction, the dispatch and execution of which resulted in a hazard and a subsequent memory instruction punt.

The instruction processing circuit 102 determines whether an address of the memory instruction being fetched is present in an entry of the PAT 104. If the address of the memory instruction is found in an entry of the PAT 104 (i.e., a “hit”), it may be concluded that a previous out-of-order execution of the memory instruction resulted in a punt, and may be likely to do so again. To preemptively preclude the possibility of a punt, the instruction processing circuit 102 prevents the detected memory instruction from taking effect (i.e., from being dispatched out-of-order and/or from providing an early return of data, as non-limiting examples) before the at least one pending memory instruction older than the detected memory instruction. As non-limiting examples, the instruction processing circuit 102 in some aspects may perform an in-order dispatch of the at least one pending memory instruction older than the detected memory instruction, or may prevent an early return of data by the detected memory instruction until the at least one pending memory instruction older than the detected memory instruction has completed. According to some aspects, the instruction processing circuit 102 may prevent the early return of data by the detected memory instruction by adding one or more attributes (not shown) to the detected memory instruction. These attributes may indicate that an early return of data (e.g., from the data cache 112) for the detected memory instruction is to be blocked, and that the detected memory instruction should instead wait for all older memory operation hazards to be resolved.

As noted above, different operations for preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction may be applied to different types of memory instructions depending on a type of hazard that is associated with the entry of the PAT 104. As a non-limiting example, if a previous out-of-order execution of the memory instruction resulted in a RAW hazard, the instruction processing circuit 102 may prevent the detected memory instruction from taking effect before any pending memory store instructions older than the detected memory instruction. If a RAR hazard resulted from the previous out-of-order execution of the memory instruction, the instruction processing circuit 102 may prevent the detected memory instruction from taking effect before any pending memory load instructions older than the detected memory instruction. For aspects in which the hazard is a resource constraint hazard, the instruction processing circuit 102 may prevent the detected memory instruction from taking effect before any pending memory instructions older than the detected memory instruction.

According to some aspects disclosed herein, if the instruction processing circuit 102 detects a memory instruction but does not find the address of the memory instruction in an entry of the PAT 104, a “miss” occurs. In this case, the instruction processing circuit 102 may continue processing of the memory instruction. If a hazard associated with the detected memory instruction subsequently occurs upon execution of a pending memory instruction older than the memory instruction, an entry containing the address of the memory instruction may be generated in the PAT 104. The memory instruction and the pending memory instruction may then be re-fetched and re-executed.

To illustrate an exemplary PAT 200 that may correspond to the PAT 104 of FIG. 1 in some aspects, FIG. 2 is provided. Elements of FIG. 1 are referenced for the sake of clarity in describing FIG. 2. As seen in FIG. 2, the PAT 200 includes multiple entries 202(0)-202(Y), each of which may store data associated with a detected memory instruction (not shown). Each of the entries 202(0)-202(Y) includes an address field 204 for storing an address, such as an address 206, for the associated memory instruction. An entry such as the entry 202(0) may be generated by the instruction processing circuit 102 in response to an occurrence of a hazard resulting from an out-of-order execution of a memory instruction located at the address 206.

According to some aspects, each entry 202(0)-202(Y) of the PAT 200 may also include an optional hazard indicator field 208 for storing a hazard indicator such as a hazard indicator 210. The hazard indicator 210 in some aspects may comprise one or more bits that provide an indication of the type of hazard (e.g., a RAW hazard, a RAR hazard, or a resource constraint hazard, as non-limiting examples) corresponding to the associated memory instruction. The instruction processing circuit 102 may employ the hazard indicator 210 in determining the appropriate action to take to preempt a memory instruction punt. In some aspects of the PAT 200 that do not include the hazard indicator field 208, the PAT 200 may be dedicated to tracking a single type of hazard. For instance, the PAT 200 may be dedicated to tracking only RAW hazards, as a non-limiting example. Some aspects may provide that multiple PATs 200 are provided, each tracking a different hazard type.

Some aspects may also provide that each of the entries 202(0)-202(Y) of the PAT 200 further includes a bias counter field 212 storing a bias counter value 214. The entries 202(0)-202(Y) of the PAT 200 may also include a bias threshold field 216 storing a bias threshold value 218. The bias counter value 214 and the bias threshold value 218 may be used by the instruction processing circuit 102 to judge a relative likelihood of a memory instruction punt occurring as a result of out-of-order execution of an associated memory instruction. The instruction processing circuit 102 may then determine whether to preempt the memory instruction punt or to continue conventional processing of the memory instruction based on the bias counter value 214 and the bias threshold value 218. For example, the bias counter value 214 may be incremented upon each occurrence of a hazard associated with the memory instruction corresponding to the entry 202(0). If the memory instruction is again detected in the instruction stream, the instruction processing circuit 102 may prevent the memory instruction from taking effect before pending memory instructions older than the memory instruction only if the bias counter value 214 exceeds the bias threshold value 218. Some aspects may provide that, instead of being stored in the bias threshold field 216, the bias threshold value 218 may be stored in a location separate from the PAT 200, such as in one of the registers 124 of FIG. 1, or may be hardcoded by the instruction processing circuit 102.

It is to be understood that some aspects may provide that the entries 202(0)-202(Y) of the PAT 200 may include other fields in addition to the fields 204, 208, 212, and 216 illustrated in FIG. 2. It is to be further understood that the PAT 200 in some aspects may be implemented as a cache configured according to associativity and replacement policies known in the art. In the example of FIG. 2, the PAT 200 is illustrated as a single data structure. However, in some aspects, the PAT 200 may also comprise more than one data structure or cache.

To better illustrate exemplary communications flows between the instruction processing circuit 102 and the load/store unit 110 of FIG. 1, FIGS. 3A-3C are provided. FIG. 3A illustrates exemplary communications flows for an out-of-order execution of a memory instruction, while FIG. 3B shows exemplary communications flows for establishing an entry in the PAT 104. FIG. 3C illustrates exemplary communications flows during prediction of a subsequent memory instruction punt.

As shown in FIGS. 3A-3C, the instruction processing circuit 102 processes an instruction stream 300 comprising three instructions: a memory store instruction (ST) 302(0) and two memory load instructions (LD) 302(1) and 302(2). The memory store instruction 302(0) and memory load instructions 302(1), 302(2) are also collectively referred to herein as “memory instructions 302(0)-302(2).” In this example, the memory store instruction 302(0) directs the OOO computer processor 100 to store a value in a memory location M (not shown), while the memory load instructions 302(1), 302(2) each directs the OOO computer processor 100 to read a value from the memory location M. In the example of FIGS. 3A-3C, the memory store instruction 302(0) is the oldest in terms of program order, while the memory load instruction 302(1) is the second-oldest and the memory load instruction 302(2) is the youngest. The memory load instruction 302(2) is associated with an address 304, which in this example is the hexadecimal value 0x414. It is to be understood that, in some aspects, the address 304 may be retrieved from, e.g., the program counter 128 of FIG. 1.

The PAT 104 illustrated in FIGS. 3A-3C includes multiple entries 306(0)-306(X). To facilitate prediction of memory instruction punts, each entry 306(0)-306(X) of the PAT 104 includes an address field 308, which corresponds to the address field 204 of FIG. 2. As discussed above, the address field 308 for each entry 306(0)-306(X) may be used to store the address 304 of the memory load instruction 302(2) that is detected by the instruction processing circuit 102. Although not shown in the example of FIG. 3A, in some aspects the entries 306(0)-306(X) of the PAT 104 may also include fields corresponding to the hazard indicator field 208, the bias counter field 212, and/or the bias threshold field 216 of FIG. 2.

Referring now to FIG. 3A, in this example the instruction processing circuit 102 elects to execute the memory load instruction 302(2) out-of-order, before the older memory store instruction 302(0) and the older memory load instruction 302(1) have executed. As indicated by arrow 310, the instruction processing circuit 102 first checks the PAT 104 to determine whether the address 304 of the memory load instruction 302(2) (i.e., the hexadecimal value 0x414) may be found in any of the entries 306(0)-306(X). The instruction processing circuit 102 does not find the address 304 in the entries 306(0)-306(X), and thus, in response to the “miss,” continues conventional processing of the memory load instruction 302(2). The memory load instruction 302(2) thus reads the data cache 112 and returns data stored at memory location M, as indicated by arrows 312 and 314.

In FIG. 3B, the instruction processing circuit 102 next elects to execute the memory store instruction 302(0), as indicated by arrow 316. As noted above, the memory store instruction 302(0) is older than the memory load instruction 302(2), and stores a value in the same memory location M read by the memory load instruction 302(2). Accordingly, the attempt by the instruction processing circuit 102 to execute the memory store instruction 302(0) results in detection of a hazard 318 (in this case, a RAW hazard). In response to detecting the hazard 318, the instruction processing circuit 102 generates the entry 306(0) in the PAT 104, and stores the address 304 of the memory load instruction 302(2) in the address field 308 of the entry 306(0), as indicated by arrow 320. The instruction processing circuit 102 then causes the memory store instruction 302(0) and the memory load instruction 302(2) to be re-fetched and re-executed (not shown), resulting in a memory instruction punt.

Turning to FIG. 3C, upon re-fetching the memory store instruction 302(0) and the memory load instruction 302(2), the instruction processing circuit 102 again elects to execute the memory load instruction 302(2) out-of-order, before the older memory store instruction 302(0) and memory load instruction 302(1) have executed. As indicated by arrow 322, the instruction processing circuit 102 checks the PAT 104 to determine whether the address 304 of the memory load instruction 302(2) is found in any of the entries 306(0)-306(X), and this time locates the entry 306(0). In response, the instruction processing circuit 102 prevents the memory load instruction 302(2) from taking effect before one or more of the pending memory instructions 302(0)-302(1) that are older than the memory load instruction 302(2). In this example, for purposes of clarity, the PAT 104 does not include an optional hazard indicator field, and thus it is assumed that the PAT 104 is associated with tracking RAW hazards only. The instruction processing circuit 102 thus prevents the memory load instruction 302(2) from taking effect before the pending memory store instruction 302(0). As seen in FIG. 3C, the instruction processing circuit 102 prevents the memory load instruction 302(2) from taking effect before the pending memory store instruction 302(0) by performing an in-order dispatch of the memory store instruction 302(0) prior to the memory load instruction 302(2), as indicated by arrow 324. Some aspects may provide that the instruction processing circuit 102 may prevent the memory load instruction 302(2) from taking effect before the pending memory store instruction 302(0) by preventing an early return of data by the memory load instruction 302(2).

It is to be understood that, in some aspects in which the hazard 318 is a RAR hazard, the instruction processing circuit 102 may prevent the memory load instruction 302(2) from taking effect before the pending memory load instruction 302(1). According to aspects in which the hazard 318 is a resource constraint hazard, the instruction processing circuit 102 may prevent the memory load instruction 302(2) from taking effect before any of the pending memory instructions 302(0)-302(1) older than the memory load instruction 302(2). Some aspects may provide that the type of hazard 318 may be determined based on a hazard indicator such as the hazard indicator 210 of FIG. 2. In some aspects, the instruction processing circuit 102 may determine whether to prevent the memory load instruction 302(2) from taking effect before the pending memory instructions 302(0)-302(1) based on a bias counter value, such as comparing the bias counter value 214 and the bias threshold 216 of FIG. 2.

To illustrate exemplary operations for predicting memory instruction punts using the PAT 104 of FIG. 1, FIGS. 4A-4C are provided. For the sake of clarity, elements of FIGS. 1, 2, and 3A-3C are referenced in describing FIGS. 4A-4C. Operations in FIG. 4A begin with the instruction processing circuit 102 of FIG. 1 detecting, in an instruction stream 300, a memory instruction such as the memory load instruction 302(2) (block 400). The instruction processing circuit 102 next determines whether an address 304 of the detected memory instruction 302(2) is present in an entry 306(0) of a PAT 104 (block 402). If not, the memory instruction 302(2) is not associated with a previous memory instruction punt, and thus the instruction processing circuit 102 continues processing the instruction stream 300 (block 404). Processing then resumes at block 418 of FIG. 4C.

If, at decision block 402, the address 304 of the detected memory instruction 302(2) is determined to be present, the instruction processing circuit 102 in some aspects may further determine whether the bias counter value 214 of a bias counter field 212 of the entry 306(0) of the PAT 104 exceeds a bias threshold value 218 (block 406). If not, the instruction processing circuit 102 may conclude that the likelihood of a memory instruction punt is relatively low. In that case, the instruction processing circuit 102 continues conventional processing of the instruction stream 300 (block 404). If the instruction processing circuit 102 does not utilize the optional bias counter value 214, or if the instruction processing circuit 102 determines at optional decision block 406 that the bias counter value 214 exceeds the bias threshold value 218, processing resumes at block 408 of FIG. 4B.

Referring now to FIG. 4B, the instruction processing circuit 102 prevents the detected memory instruction 302(2) from taking effect before at least one pending memory instruction 302(0)-302(1) older than the detected memory instruction 302(2), to preempt a memory instruction punt (block 408). In some aspects, operations of block 408 for preventing the detected memory instruction 302(2) from taking effect before the at least one pending memory instruction 302(0)-302(1) may comprise performing an in-order dispatch of the at least one pending memory instruction 302(0)-302(1) older than the detected memory instruction 302(2) (block 409). Some aspects may provide that operations of block 408 for preventing the detected memory instruction 302(2) from taking effect before the at least one pending memory instruction 302(0)-302(1) may comprise preventing an early return of data by the detected memory instruction 302(2) until the at least one pending memory instruction 302(0)-302(1) older than the detected memory instruction 302(2) has completed (block 410).

In some aspects, operations of block 408 for preventing the detected memory instruction 302(2) from taking effect before the at least one pending memory instruction 302(0)-302(1) may be accomplished by the instruction processing circuit 102 first determining a type of hazard associated with the entry 306(0) of the PAT 104 (block 411). Some aspects may provide that the type of hazard may be ascertained using a hazard indicator such as the hazard indicator 210 of FIG. 2. According to some aspects, multiple PATs 104 may be provided, each associated with a specific hazard type.

If the entry 306(0) of the PAT 104 is determined at decision block 411 to be associated with a RAW hazard, the instruction processing circuit 102 may prevent the detected memory instruction 302(2) from taking effect before any pending memory store instructions 302(0) older than the detected memory instruction 302(2) (block 412). If it is determined at decision block 411 that the entry 306(0) of the PAT 104 is associated with a RAR hazard, the instruction processing circuit 102 may prevent the detected memory instruction 302(2) from taking effect before all pending memory load instructions 302(1) older than the detected memory instruction 302(2) (block 414). If the entry 306(0) of the PAT 104 is associated with a resource constraint hazard, the instruction processing circuit 102 may prevent the detected memory instruction 302(2) from taking effect before all pending memory instructions 302(0)-302(1) older than the detected memory instruction 302(2) (block 416). Processing then resumes at block 418 of FIG. 4C.

In FIG. 4C, the instruction processing circuit 102 in some aspects may further determine whether a hazard 318 associated with the detected memory instruction 302(2) occurred upon execution of a pending memory instruction 302(0) of the at least one pending memory instruction 302(0)-302(1) older than the detected memory instruction 302(2) (block 418). If not, the instruction processing circuit 102 continues processing the instruction stream 300 (block 420). However, if it is determined at decision block 418 that a hazard 318 occurred, the instruction processing circuit 102, according to some aspects in which the optional bias counter value 214 is employed, may determine whether the address 304 of the detected memory instruction 302(2) is present in an entry 306(0) of the PAT 104 (block 422). If so, the instruction processing circuit 102 may increment the bias counter value 214 (block 424). The instruction processing 102 then re-executes the detected memory instruction 302(2) and the at least one pending memory instruction 302(0) (block 426).

If the instruction processing circuit 102 determines at decision block 422 that the address 304 is not present, or if the instruction processing circuit 102 does not use the optional bias counter value 214, the instruction processing circuit 102 may generate the entry 306(0) in the PAT 104, the entry 306(0) comprising the address 304 of the detected memory instruction 302(2) (block 428). The instruction processing circuit 102 next re-executes the detected memory instruction 302(2) and the at least one pending memory instruction 302(0) (block 426). The instruction processing circuit 102 then continues processing the instruction stream 300 (block 420).

Predicting memory instruction punts using a PAT according to aspects disclosed herein may be provided in or integrated into any processor-based device. Examples, without limitation, include a set top box, an entertainment unit, a navigation device, a communications device, a fixed location data unit, a mobile location data unit, a mobile phone, a cellular phone, a computer, a portable computer, a desktop computer, a personal digital assistant (PDA), a monitor, a computer monitor, a television, a tuner, a radio, a satellite radio, a music player, a digital music player, a portable music player, a digital video player, a video player, a digital video disc (DVD) player, and a portable digital video player.

In this regard, FIG. 5 illustrates an example of a processor-based system 500 that can employ the instruction processing circuit 102 illustrated in FIG. 1. In this example, the processor-based system 500 includes one or more central processing units (CPUs) 502, each including one or more processors 504. The one or more processors 504 may include the instruction processing circuit (IPC) 102 of FIG. 1, and may perform the operations illustrated in FIGS. 4A-4C. The CPU(s) 502 may be a master device. The CPU(s) 502 may have cache memory 506 coupled to the processor(s) 504 for rapid access to temporarily stored data. The CPU(s) 502 is coupled to a system bus 508 and can intercouple master and slave devices included in the processor-based system 500. As is well known, the CPU(s) 502 communicates with these other devices by exchanging address, control, and data information over the system bus 508. For example, the CPU(s) 502 can communicate bus transaction requests to a memory controller 510 as an example of a slave device.

Other master and slave devices can be connected to the system bus 508. As illustrated in FIG. 5, these devices can include a memory system 512, one or more input devices 514, one or more output devices 516, one or more network interface devices 518, and one or more display controllers 520, as examples. The input device(s) 514 can include any type of input device, including but not limited to input keys, switches, voice processors, etc. The output device(s) 516 can include any type of output device, including but not limited to audio, video, other visual indicators, etc. The network interface device(s) 518 can be any devices configured to allow exchange of data to and from a network 522. The network 522 can be any type of network, including but not limited to a wired or wireless network, a private or public network, a local area network (LAN), a wide local area network (WLAN), and the Internet. The network interface device(s) 518 can be configured to support any type of communications protocol desired. The memory system 512 can include one or more memory units 524(0-N).

The CPU(s) 502 may also be configured to access the display controller(s) 520 over the system bus 508 to control information sent to one or more displays 526. The display controller(s) 520 sends information to the display(s) 526 to be displayed via one or more video processors 528, which process the information to be displayed into a format suitable for the display(s) 526. The display(s) 526 can include any type of display, including but not limited to a cathode ray tube (CRT), a liquid crystal display (LCD), a plasma display, etc.

Those of skill in the art will further appreciate that the various illustrative logical blocks, modules, circuits, and algorithms described in connection with the aspects disclosed herein may be implemented as electronic hardware, instructions stored in memory or in another computer-readable medium and executed by a processor or other processing device, or combinations of both. The master and slave devices described herein may be employed in any circuit, hardware component, integrated circuit (IC), or IC chip, as examples. Memory disclosed herein may be any type and size of memory and may be configured to store any type of information desired. To clearly illustrate this interchangeability, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. How such functionality is implemented depends upon the particular application, design choices, and/or design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

The various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented or performed with a processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

The aspects disclosed herein may be embodied in hardware and in instructions that are stored in hardware, and may reside, for example, in Random Access Memory (RAM), flash memory, Read Only Memory (ROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), registers, a hard disk, a removable disk, a CD-ROM, or any other form of computer readable medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a remote station. In the alternative, the processor and the storage medium may reside as discrete components in a remote station, base station, or server.

It is also noted that the operational steps described in any of the exemplary aspects herein are described to provide examples and discussion. The operations described may be performed in numerous different sequences other than the illustrated sequences. Furthermore, operations described in a single operational step may actually be performed in a number of different steps. Additionally, one or more operational steps discussed in the exemplary aspects may be combined. It is to be understood that the operational steps illustrated in the flow chart diagrams may be subject to numerous different modifications as will be readily apparent to one of skill in the art. Those of skill in the art will also understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples and designs described herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An instruction processing circuit in an out-of-order (OOO) computer processor; the instruction processing circuit communicatively coupled to a front-end circuit of an execution pipeline, and comprising a punt avoidance table (PAT) providing a plurality of entries;the instruction processing circuit configured to prevent a detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction to preempt a memory instruction punt, responsive to determining that an address of the detected memory instruction is present in an entry of the plurality of entries of the PAT.

2. The instruction processing circuit of claim 1, wherein the instruction processing circuit is configured to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by being configured to perform an in-order dispatch of the at least one pending memory instruction older than the detected memory instruction.

3. The instruction processing circuit of claim 1, wherein the instruction processing circuit is configured to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by being configured to prevent an early return of data by the detected memory instruction until the at least one pending memory instruction older than the detected memory instruction has completed.

4. The instruction processing circuit of claim 1, further configured to determine a hazard type associated with the detected memory instruction based on a hazard indicator of the entry of the PAT, the hazard type selected from the group consisting of a read-after-write (RAW) hazard, a read-after-read (RAR) hazard, and a resource constraint hazard.

5. The instruction processing circuit of claim 1, further configured to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by being configured to: determine whether the entry of the PAT is associated with a RAW hazard; andresponsive to determining that the entry of the PAT is associated with the RAW hazard, prevent the detected memory instruction from taking effect before any pending memory store instructions older than the detected memory instruction.

6. The instruction processing circuit of claim 1, further configured to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by being configured to: determine whether the entry of the PAT is associated with a RAR hazard; andresponsive to determining that the entry of the PAT is associated with the RAR hazard, prevent the detected memory instruction from taking effect before any pending memory load instructions older than the detected memory instruction.

7. The instruction processing circuit of claim 1, further configured to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by being configured to: determine whether the entry of the PAT is associated with a resource constraint hazard; andresponsive to determining that the entry of the PAT is associated with the resource constraint hazard, prevent the detected memory instruction from taking effect before any pending memory instructions older than the detected memory instruction.

8. The instruction processing circuit of claim 1, further configured to: determine, upon execution of a pending memory instruction of the at least one pending memory instruction older than the detected memory instruction, whether a hazard associated with the detected memory instruction has occurred; andresponsive to determining that the hazard associated with the detected memory instruction has occurred: generate the entry in the PAT, the entry comprising the address of the detected memory instruction; andre-execute the detected memory instruction and the at least one pending memory instruction.

9. The instruction processing circuit of claim 8, further configured to: prior to generating the entry in the PAT: determine whether the address of the detected memory instruction is present in an entry of the PAT; andresponsive to determining that the address of the detected memory instruction is present in the entry, increment a bias counter value of a bias counter field of the entry; andprior to preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction, determine whether the bias counter value of the bias counter field of the entry of the PAT exceeds a bias threshold value;wherein the instruction processing circuit is configured to: generate the entry in the PAT responsive to determining that the address of the detected memory instruction is not present in the entry of the PAT; andprevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction responsive to determining that the bias counter value exceeds the bias threshold value.

10. The instruction processing circuit of claim 1 integrated into an integrated circuit (IC).

11. The instruction processing circuit of claim 1 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; and a portable digital video player.

12. An instruction processing circuit in an out-of-order (OOO) computer processor, comprising: a means for providing a plurality of entries in a punt avoidance table (PAT); anda means for preventing a detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction to preempt a memory instruction punt, responsive to determining that an address of the detected memory instruction is present in an entry of the plurality of entries of the PAT.

13. A method for predicting memory instruction punts, comprising: detecting, in an instruction stream, a memory instruction;determining whether an address of the detected memory instruction is present in an entry of a punt avoidance table (PAT); andresponsive to determining that the address of the detected memory instruction is present in the entry, preventing the detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction.

14. The method of claim 13, wherein preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction comprises performing an in-order dispatch of the at least one pending memory instruction older than the detected memory instruction.

15. The method of claim 13, wherein preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction comprises preventing an early return of data by the detected memory instruction until the at least one pending memory instruction older than the detected memory instruction has completed.

16. The method of claim 13, wherein preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction is based on a hazard type associated with the detected memory instruction, the hazard type selected from the group consisting of a read-after-write (RAW) hazard, a read-after-read (RAR) hazard, and a resource constraint hazard.

17. The method of claim 13, wherein preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction comprises: determining whether the entry of the PAT is associated with a RAW hazard; andresponsive to determining that the entry of the PAT is associated with the RAW hazard, preventing the detected memory instruction from taking effect before any pending memory store instructions older than the detected memory instruction.

18. The method of claim 13, wherein preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction comprises: determining whether the entry of the PAT is associated with a RAR hazard; andresponsive to determining that the entry of the PAT is associated with the RAR hazard, preventing the detected memory instruction from taking effect before any pending memory load instructions older than the detected memory instruction.

19. The method of claim 13, wherein preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction comprises: determining whether the entry of the PAT is associated with a resource constraint hazard; andresponsive to determining that the entry of the PAT is associated with the resource constraint hazard, preventing the detected memory instruction from taking effect before any pending memory instructions older than the detected memory instruction.

20. The method of claim 13, further comprising: determining, upon dispatch of a pending memory instruction of the at least one pending memory instruction older than the detected memory instruction, whether a hazard associated with the detected memory instruction has occurred; andresponsive to determining that the hazard associated with the detected memory instruction has occurred: generating the entry in the PAT, the entry comprising the address of the detected memory instruction; andre-executing the detected memory instruction and the at least one pending memory instruction.

21. The method of claim 20, further comprising: prior to generating the entry in the PAT: determining whether the address of the detected memory instruction is present in an entry of the PAT; andresponsive to determining that the address of the detected memory instruction is present in the entry, incrementing a bias counter value of a bias counter field of the entry; andprior to preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction, determining whether the bias counter value of the bias counter field of the entry of the PAT exceeds a bias threshold value;wherein: generating the entry in the PAT is responsive to determining that the address of the detected memory instruction is not present in the entry of the PAT; andpreventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction is responsive to determining that the bias counter value exceeds the bias threshold value.

22. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed by a processor, cause the processor to: detect, in an instruction stream, a memory instruction;determine whether an address of the detected memory instruction is present in an entry of a punt avoidance table (PAT); andresponsive to determining that the address of the detected memory instruction is present in the entry, prevent the detected memory instruction from taking effect before at least one pending memory instruction older than the detected memory instruction, to preempt a memory instruction punt.

23. The non-transitory computer-readable medium of claim 22 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by performing an in-order dispatch of the at least one pending memory instruction older than the detected memory instruction.

24. The non-transitory computer-readable medium of claim 22 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by preventing an early return of data by the detected memory instruction until the at least one pending memory instruction older than the detected memory instruction has completed.

25. The non-transitory computer-readable medium of claim 22 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by: determining whether the entry of the PAT is associated with a read-after-write hazard (RAW); andresponsive to determining that the entry of the PAT is associated with the RAW hazard, preventing the detected memory instruction from taking effect before any pending memory store instructions older than the detected memory instruction.

26. The non-transitory computer-readable medium of claim 22 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by: determining whether the entry of the PAT is associated with a read-after-read hazard (RAR); andresponsive to determining that the entry of the PAT is associated with the RAR hazard, preventing the detected memory instruction from taking effect before any pending memory load instructions older than the detected memory instruction.

27. The non-transitory computer-readable medium of claim 22 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to prevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction by: determining whether the entry of the PAT is associated with a resource constraint hazard; andresponsive to determining that the entry of the PAT is associated with the resource constraint hazard, preventing the detected memory instruction from taking effect before any pending memory instructions older than the detected memory instruction.

28. The non-transitory computer-readable medium of claim 22 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to: determine, upon execution of a pending memory instruction of the at least one pending memory instruction older than the detected memory instruction, whether a hazard associated with the detected memory instruction has occurred; andresponsive to determining that the hazard associated with the detected memory instruction has occurred: generate the entry in the PAT, the entry comprising the address of the detected memory instruction; andre-execute the detected memory instruction and the at least one pending memory instruction.

29. The non-transitory computer-readable medium of claim 28 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to: prior to generating the entry in the PAT: determine whether the address of the detected memory instruction is present in an entry of the PAT; andresponsive to determining that the address of the detected memory instruction is present in the entry, increment a bias counter value of a bias counter field of the entry;prior to preventing the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction, determine whether the bias counter value of the bias counter field of the entry of the PAT exceeds a bias threshold value;generate the entry in the PAT responsive to determining that the address of the detected memory instruction is not present in the entry of the PAT; andprevent the detected memory instruction from taking effect before the at least one pending memory instruction older than the detected memory instruction responsive to determining that the bias counter value exceeds the bias threshold value.