PROCESSOR CONFIGURED TO PREDECODE RELATIVE CONTROL TRANSFER INSTRUCTIONS

Abstract: The processor is configured to predecode instruction bytes prior to their storage within an instruction cache. During the predecoding, relative branch instructions are detected. The displacement included within the relative branch instruction is added to the address corresponding to the relative branch instruction, thereby generating the target address. The processor replaces the displacement field of the relative branch instruction with an encoding of the target address, and stores the modified relative branch instruction in the instruction cache. The branch prediction mechanism may select the target address from the displacement field of the relative branch instruction instead of performing an addition to generate the target address. In one embodiment, relative branch instructions having eight bit and 32-bit displacement fields are included in the instruction set executed by the processor. Additionally, the processor employs predecode information (stored in the instruction cache with the corresponding instruction bytes) including a start bit and control transfer bit corresponding to each instruction byte. The combination of the start bit indicating that the byte is the start of an instruction and the corresponding control transfer bit identifies the instruction as either a branch instruction or a non-branch instruction. For relative branch instructions including an eight bit displacement, the control transfer bit corresponding to the displacement field is used in conjunction with the displacement field to store the encoded target address. Thirty-two bit displacement fields store the entirety of the target address, and hence the encoded target address comprises the target address.

Description: PROCESSOR CONFIGURED TO PREDECODE RELATIVE CONTROL TRANSFER INSTRUCTIONS BACKGROUND OF THE INVENTION 1. Field of the Invention This invention is related to the field of processors and, more particularly, to predecoding techniques within processors. 2. Description of the Related Art Superscalar processors attempt to achieve high performance by dispatching and executing multiple instructions per clock cycle, and by operating at the shortest possible clock cycle time consistent with the design. To the extent that a given processor is successful at dispatching and/or executing multiple instructions per clock cycle, high performance may be realized. In order to increase the average number of instructions dispatched per clock cycle, processor designers have been designing superscalar processors which employ wider issue rates. A "wide issue" superscalar processor is capable of dispatching (or issuing) a larger maximum number of instructions per clock cycle than a "narrow issue" superscalar processor is capable of dispatching. During clock cycles in which a number of dispatchable instructions is greater than the narrow issue processor can handle, the wide issue processor may dispatch more instructions, thereby achieving a greater average number of instructions dispatched per clock cycle. Many processors are designed to execute the x86 instruction set due to its widespread acceptance in the computer industry. For example, the K5 and K6 processors from Advanced Micro Devices, Inc., of Sunnyvale, California implement the x86 instruction set. The x86 instruction set is a variable length instruction set in which various instructions occupy differing numbers of bytes in memory. The type of instruction, as well as the addressing modes selected for a particular instruction encoding, may affect the number of bytes occupied by that particular instruction encoding. Variable length instruction sets, such as the x86 instruction set, m imize the amount of memory needed to store a particular program by only occupying the number of bytes needed for each instruction. In contrast, many RISC architectures employ fixed length instruction sets in which each instruction occupies a fixed, predetermined number of bytes. Unfortunately, variable length instruction sets complicate the design of wide issue processors. For a wide issue processor to be effective, the processor must be able to identify large numbers of instructions concurrently and rapidly within a code sequence in order to provide sufficient instructions to the instruction dispatch hardware. Because the location of each variable length instruction within a code sequence is dependent upon the preceding instructions, rapid identification of instructions is difficult. If a sufficient number of instructions cannot be identified, the wide issue structure may not result in significant performance gains. Therefore, a processor which provides rapid and concurrent identification of instructions for dispatch is needed. Another feature which is important to the performance achievable by wide issue superscalar processors is the accuracy and effectiveness of its branch prediction mechanism. As used herein, the branch prediction mechanism refers to the hardware which detects control transfer instructions within the instructions being identified for dispatch and which predicts the next fetch address resultmg from the execution of the identified control transfer mstructions. Generally, a "control transfer" instruction is an mstruction which, when executed, specifies the address from which the next mstruction to be executed is fetched Jump instructions are an example of control transfer mstructions. A jump mstruction specifies a target address different than the address of the byte immediately followmg the jump mstruction (the "sequential address") Unconditional jump mstructions always cause the next mstruction to be fetched to be the mstruction at the target address, while conditional jump mstructions cause the next mstruction be fetched to be either the mstruction at the target address or the instruction at the sequential address responsive to an execution result of a previous mstruction (for example, by specifymg a condition flag set via instruction execution). Other types of instructions besides jump instructions may also be control transfer mstructions. For example, subroutme call and return mstructions may cause stack manipulations m addition to specifymg the next fetch address. Many of these additional types of control transfer instructions mclude a jump operation (either conditional or unconditional) as well as additional instruction operations. Control transfer mstructions may specify the target address in a variety of ways. "Relative" control transfer mstructions mclude a value (either directly or indirectly) which is to be added to an address correspondmg to the relative control transfer mstruction m order to generate the target address The address to which the value is added depends upon the mstruction set definition. For x86 control transfer instructions, the address of the byte immediately followmg the control transfer mstruction is the address to which the value is added. Other mstruction sets may specifymg adding the value to the address of the control transfer mstruction itself. For relative control transfer mstructions which directly specify the value to be added, an mstruction field is mcluded for stormg the value and the value is referred to as a "displacement". On the other hand, "absolute" control transfer mstructions specify the target address itself (agam, either directly or indirectly) Absolute control transfer instructions therefore do not require an address correspondmg to the control transfer mstruction to determine the target address Control transfer mstructions which specify the target address indirectly (e.g. via one or more register or memory operands) are referred to as "indirect" control transfer instructions. Because of the variety of available control transfer mstructions, the branch prediction mechanism may be quite complex. However, because control transfer instructions occur frequently m many program sequences, wide issue processors have a need for a highly effective (e.g. both accurate and rapid) branch prediction mechanism. If the branch prediction mechanism is not highly accurate, the wide issue processor may issue a large number of mstructions per clock cycle but may ultimately cancel many of the issued instructions due to branch mispredictions On the other hand, the number of clock cycles used by the branch prediction mechanism to generate a target address needs to be minimized to allow for the instructions that the target address to be fetched. The term "branch mstruction" is used herem to be synonymous with "control transfer mstruction" SUMMARY OF THE INVENTION The problems outlmed above are m large part solved by a processor in accordance with the present invention. The processor is configured to predecode mstruction bytes prior to then storage within an mstruction cache During the predecoding, relative branch mstructions are detected The displacement mcluded within the relative branch mstruction is added to the address correspondmg to the relative branch instruction, thereby generating the target address The processor replaces the displacement field of the relative branch mstruction with an encodmg of the target address, and stores the modified relative branch instruction in the instruction cache Advantageously, the branch prediction mechanism employed by the processor may more rapidly generate the target address correspondmg to relative branch mstructions The branch prediction mechanism may simply select the target address from the displacement field of the relative branch mstruction mstead of performing an addition to generate the target address The rapidly generated target address may be provided to the instruction cache for fetchmg mstructions more quickly than might otherwise be achieved The amount of time elapsing between fetchmg a branch mstruction and generating the correspondmg target address may advantageously be reduced Accordmgly, the branch prediction mechanism may operate more efficiently, and hence processor performance may be increased through more rapid fetchmg of mstructions stored at the target address Superscalar processors may thereby support wider issue rates by fetchmg a larger number of mstructions in a given period of time In one embodiment, relative branch mstructions havmg eight bit and 32-bit displacement fields are mcluded in the instruction set executed by the processor Additionally, the processor employs predecode information (stored m the mstruction cache with the correspondmg mstruction bytes) including a start bit and a control transfer bit correspondmg to each mstruction byte The combmation of the start bit indicating that the byte is the start of an mstruction and the correspondmg control transfer bit identifies the instruction as either a branch instruction or a non-branch instruction For relative branch instructions mcludmg an eight bit displacement, the control transfer bit correspondmg to the displacement field is used m conjunction with the displacement field to store the encoded target address The encoded target address mcludes a cache lme offset portion and a relative cache lme portion identifying the target cache lme as a function of the cache lme stormg the relative branch mstruction Thirty-two bit displacement fields store the entirety of the target address, and hence the encoded target address compπses the target address Other embodiments than the one described above are contemplated Broadly speakmg, the present invention contemplates a processor comprising a predecode unit and an mstruction cache The predecode unit is configured to predecode a plurality of mstruction bytes received by the processor Upon predecodmg a relative control transfer mstruction compπsing a displacement, the predecode unit adds an address to the displacement to generate a target address correspondmg to the relative control transfer mstruction Additionally, the predecode unit is configured to replace the displacement within the relative control transfer mstruction with at least a portion of the target address Coupled to the predecode unit, the mstruction cache is configured to store the plurality of mstruction bytes mcludmg the relative control transfer mstruction with the displacement replaced by the portion of the target address The present mvention further contemplates a method for generatmg a target address for a relative control transfer instruction A plurality of mstruction bytes including the relative transfer mstruction are predecoded to detect the presence of the relative control transfer mstruction An address is added to a displacement mcluded m the relative control transfer mstruction, thereby generatmg the target address The displacement is replaced within the relative control transfer mstruction with an encoding indicative of the target address The plurality of mstruction bytes mcludmg the relative control transfer mstruction is stored in an instruction cache, with the displacement replaced by the encoding. Moreover, the present mvention contemplates a predecode unit compnsmg a decoder and a target generator The decoder is configured to decode a plurality of instruction bytes and to identify a relative control transfer mstruction therem. The target generator is configured to add a displacement selected from the relative control transfer instruction to an address, thereby generating a target address correspondmg to the relative control transfer mstruction, and is further configured to generate an encodmg of the target address with which the predecode unit replaces the displacement within the relative control transfer mstruction The present mvention still further contemplates a computer system compnsmg a processor, a memory, and an input/output (I/O) device. The processor is configured to predecode a plurality of mstruction bytes received by the processor Upon predecodmg a relative control transfer mstruction compnsmg a displacement, the processor is configured to add an address to the displacement to generate a target address correspondmg to the relative control transfer mstruction. Additionally, the processor is configured to replace the displacement withm the relative control transfer mstruction with at least a portion of the target address Coupled to the processor, the memory is configured to store the plurality of instruction bytes and to provide the mstruction bytes to the processor. The I/O device is configured to transfer data between the computer system and another computer system coupled to the I/O device BRIEF DESCRIPTION OF THE DRAWINGS Other objects and advantages of the invention will become apparent upon readmg the followmg detailed description and upon reference to the accompanymg drawings m which Fig. 1 is a block diagram of one embodiment of a superscalar processor. Fig. 2 is a block diagram of one embodiment of a fetch/scan unit shown m Fig 1. Fig 3 is a block diagram of one embodiment of a decode and lookahead/collapse unit shown in Fig. 1 Fig 4 is a block diagram of one embodiment of a predecode unit shown m Fig. 1. Fig. 4A is a block diagram of one embodiment of a target generator shown m Fig. 4. Fig. 5 is a diagram illustrating a control transfer mstruction havmg an 8-bit offset and the correspondmg predecode information accordmg to one embodiment of the processor shown m Fig. 1. Fig. 6 is a diagram illustrating a control transfer mstruction havmg a 32-bit offset and the correspondmg predecode information accordmg to one embodiment of the processor shown m Fig. 1. Fig. 7 is a diagram illustrating several non-control transfer mstructions and the correspondmg predecode information accordmg to one embodiment of the processor shown m Fig. 1 Fig. 8 is a block diagram of one embodiment of a branch scanner shown m Fig. 2 Fig 9 is a block diagram of one embodiment of a prefetch control unit shown m Fig. 2. Fig 10 is a truth table for one embodiment of the decoder shown m Fig. 9. Fig 10A is a flowchart illustrating operation of one embodiment of the decoder shown in Fig. 9. Fig 11 is a flowchart illustrating operation of one embodiment of the Ll prefetch control unit shown m Fig. 9. Fig. 12 is a table illustrating instruction fetch and dispatch results for one embodiment of the processor shown in Fig. 1 in which up to two branch instructions are predicted per clock cycle. Fig. 13 is a block diagram of one embodiment of an instruction queue illustrated in Fig. 1. Fig. 14 is a block diagram of one embodiment of a future file, register file, and reorder buffer shown in Fig. 1. Fig. 15 is a block diagram of one embodiment of a computer system including the processor shown in Fig. 1. While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the drawings and detailed description thereto are not intended to limit the invention to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention as defined by the appended claims. DETAILED DESCRIPTION OF THE INVENTION Turning now to Fig. 1 , a block diagram of one embodiment of a superscalar processor 10 is shown. Other embodiments are possible and contemplated. In the embodiment shown in Fig. 1, processor 10 includes a predecode unit 12, an Ll I-cache 14, an L0 I-cache 16, a fetch/scan unit 18, an instruction queue 20, an alignment unit 22, a lookahead collapse unit 24, a future file 26, a reorder buffer/register file 28, a first instruction window 30A, a second instruction window 30B, a plurality of functional units 32A, 32B, 32C, and 32D, a plurality of address generation units 34A, 34B, 34C, and 34D, a load store unit 36, an Ll D-cache 38, an FPU/multimedia unit 40, and an external interface unit 42. Elements referred to herein by a particular reference number followed by various letters will be collectively referred to using the reference number alone. For example, functional units 32A, 32B, 32C, and 32D will be collectively referred to as functional units 32. In the embodiment of Fig. 1, external interface unit 42 is coupled to predecode unit 12, Ll D-cache 38, an L2 interface 44, and a bus interface 46. Predecode unit 12 is further coupled to Ll I-cache 14. Ll I-cache 14 is coupled to L0 I-cache 16 and to fetch/scan unit 18. Fetch/scan unit 18 is also coupled to L0 I-cache 16 and to instruction queue 20. Instruction queue 20 is coupled to alignment unit 22, which is further coupled to lookahead/collapse unit 24. Lookahead/collapse unit 24 is further coupled to future file 26, reorder buffer/register file 28, load store unit 36, first instruction window 30A, second instruction window 30B, and FPU/multimedia unit 40. FPU/multimedia unit 40 is coupled to load store unit 36 and to reorder buffer/register file 28. Load/store unit 36 is coupled to Ll D-cache 38. First instruction window 30A is coupled to functional units 32A-32B and to address generation units 34A-34B. Similarly, second instruction window 30B is coupled to functional units 32C- 32D and address generation units 34C-34D. Each of Ll D-cache 38, functional units 32, and address generation units 34 are coupled to a plurality of result buses 48 which are further coupled to load/store unit 36, first instruction window 30A, second instruction window 30B, reorder buffer/register file 28, and future file 26. Predecode unit 12 receives instruction bytes fetched by external interface unit 42 and predecodes the instruction bytes prior to their storage within Ll I-cache 14. Predecode information generated by predecode unit 12 is stored m Ll I-cache 14 as well Generally, predecode information is provided to aid m the identification of mstruction features which may be useful durmg the fetch and issue of mstructions but which may be difficult to generate rapidly during the fetch and issue operation The term "predecode", as used herem, refers to decodmg mstructions to generate predecode information which is later stored along with the mstruction bytes bemg decoded in an mstruction cache (e g Ll I-cache 14 and or LO I-cache 16) In one embodiment, processor 10 employs two bits of predecode information per mstruction byte One of the bits, referred to as the "start bit", mdicates whether or not the mstruction byte is the initial byte of an mstruction When a group of mstruction bytes is fetched, the correspondmg set of start bits identifies the boundaries between mstructions within the group of mstruction bytes Accordingly, multiple mstructions may be concurrently selected from the group of mstruction bytes by scanning the corresponding start bits While start bits are used to locate mstruction boundaries by identifying the initial byte of each mstruction, end bits could alternatively be used to locate mstruction boundaries by identifying the final byte of each instruction The second predecode bit used m this embodiment, referred to as the "control transfer" bit, identifies which mstructions are branch mstructions The control transfer bit correspondmg to the initial byte of an mstruction mdicates whether or not the mstruction is a branch mstruction The control transfer bit correspondmg to subsequent bytes of the mstruction is a don't care except for relative branch mstructions havmg a small displacement field Accordmg to one particular embodiment, the small displacement field is an 8 bit field Generally, a "small displacement field" refers to a displacement field havmg fewer bits than the target address generated by branch mstructions For relative branch mstructions havmg small displacement fields, the control transfer bit correspondmg to the displacement byte is used as described below In addition to generatmg predecode information correspondmg to the mstruction bytes, predecode umt 12 is configured to recode the displacement field of relative branch mstructions to actually store the target address m the present embodiment In other words, predecode unit 12 adds the displacement of the relative branch mstruction to the address correspondmg to the relative branch mstruction as defined by the mstruction set employed by processor 10 The resultmg target address is encoded mto the displacement field as a replacement for the displacement, and the updated displacement field is stored mto Ll I-cache 14 mstead of the oπgmal displacement field Target address generation is simplified by precomputmg relative target addresses, and hence the branch prediction mechanism may operate more efficiently In one embodiment of processor 10 which employs the x86 mstruction set, predecode unit 12 is configured to recode eight bit and 32 bit displacement fields The 32 bit displacement fields may store the entirety of the target address On the other hand, the eight bit displacement field is encoded More particularly, the eight bit displacement field and correspondmg control transfer predecode bit is divided mto a cache lme offset portion and a relative cache lme portion The cache lme offset portion is the cache line offset portion of the target address The relative cache lme portion defines the cache lme identified by the target address (the "target cache lme") m terms of a number of cache lmes above or below the cache lme stormg the relative branch mstruction A first cache lme is above a second cache lme if each byte withm the first cache lme is stored at an address which is numencally greater than the addresses at which the bytes withm the second cache lme are stored Conversely, a first cache lme is below the second cache lme if each byte withm the first cache lme is stored at an address which is numerically less than the addresses which the bytes within a second cache lme are stored A signed eight bit displacement specifies an address which is +/- 128 bytes of the address corresponding to the branch instruction Accordingly, the number of above and below cache lines which can be reached by a relative branch mstruction having an eight bit displacement is limited The relative cache line portion encodes this limited set of above and below cache lmes Tables 1 and 2 below illustrates an exemplary encoding of the predecode information conesponding to a byte in accordance with one embodiment of processor 10 Table 1: Predecode Encoding Table 2: Target Address Encoding Note Remaining displacement byte bits are the offset within the target cache line Control Transfer Bit is effectively a direction, and the most significant bits of the displacement byte are the number of cache lmes Predecode unit 12 conveys the received mstruction bytes and conesponding predecode information to Ll I-cache 14 for storage Ll I-cache 14 is a high speed cache memory for stormg mstruction bytes and predecode information Ll I-cache 14 may employ any suitable configuration, including direct mapped and set associative configurations In one particular embodiment, Ll I-cache 14 is a 128 KB, two way set associative cache employing 64 byte cache lines Ll I-cache 14 mcludes additional storage for the predecode information conesponding to the mstruction bytes stored therem The additional storage is organized similar to the mstruction bytes storage As used herein, the term "cache line" refers to the unit of allocation of storage in a particular cache Generally, the bytes withm a cache lme are manipulated (I e allocated and deallocated) by the cache as a unit In one embodiment, Ll I-cache 14 is linearly addressed and physically tagged A cache is linearly addressed if at least one of the address bits used to mdex the cache is a linear address bit which is subsequently translated to a physical address bit The tags of a linearly address/physically tagged cache mclude each translated bit m addition to the bits not used to mdex As specified by the x86 architecture, mstructions are defined to generate logical addresses which are translated through a segmentation translation mechanism to a lmear address 7 SUBSTITUTE SHEET (RULE 26} and further translated through a page translation mechanism to a physical address It is becoming mcreasmgly common to employ flat addressing mode, in which the logical address and conespondmg lmear address are equal Processor 10 may be configured to assume flat addressmg mode Accordmgly, fetch addresses, target addresses, etc as generated by executmg instructions are lmear addresses In order to determine if a hit is detected in Ll I- cache 14, the lmear address presented thereto by fetch/scan unit 18 is translated usmg a translation lookaside buffer (TLB) to a conespondmg physical address which is compared to the physical tags from the mdexed cache lmes to determine a mt/miss When flat addressmg mode is not used, processor 10 may still execute code but additional clock cycles may be used to generate lmear addresses from logical addresses LO I-cache 16 is also a high speed cache memory for stormg instruction bytes Because Ll I-cache 14 is large, the access time of Ll I-cache 14 may be large In one particular embodiment, Ll I-cache 14 uses a two clock cycle access time In order to allow for smgle cycle fetch access, LO I-cache 16 is employed LO I-cache 16 is comparably smaller than Ll I-cache 14, and hence may support a more rapid access time In one particular embodiment, LO I-cache 16 is a 512 byte fully associative cache Similar to Ll I-cache 14, LO I-cache 16 is configured to store cache lines of mstruction bytes and conespondmg predecode mformation (e g 512 bytes stores eight 64 byte cache lmes and conesponding predecode data is stored additional storage) In one embodiment, LO I-cache 16 may be linearly addressed and linearly tagged Fetch/scan unit 18 is configured to generate fetch addresses for LO I-cache 16 and prefetch addresses for Ll I-cache 14 Instructions fetched from LO I-cache 16 are scanned by fetch/scan unit 18 to identify mstructions for dispatch as well as to locate branch mstructions and to form branch predictions conesponding to the located branch mstructions Instruction scan mformation and conespondmg mstruction bytes are stored mto mstruction queue 20 by fetch/scan unit 18 Additionally, the identified branch mstructions and branch predictions are used to generate subsequent fetch addresses for L0 I-cache 16 Fetch/scan unit 18 employs a prefetch algoπthm to attempt to prefetch cache lines from Ll I-cache 14 to L0 I-cache 16 prior to the prefetched cache lmes bemg fetched by fetch/scan unit 18 for dispatch mto processor 10 Any suitable prefetch algorithm may be used In one embodiment, fetch/scan unit 18 is configured to prefetch the next sequential cache lme to a cache lme fetched from L0 I-cache 16 during a particular clock cycle unless (l) a branch misprediction is signalled, (n) an L0 I-cache miss is detected, or (in) a target address is generated which is assumed to miss L0 I-cache 16 In one particular embodiment, relative branch mstructions employmg 32-bit displacements and branch mstructions employmg ιndnect target address generation are assumed to miss L0 I-cache 16 For case (I), fetch/scan unit 18 prefetches the cache lme sequential to the conected fetch address For cases (n) and (in), fetch/scan unit 18 prefetches the conespondmg miss or target address Fetch/scan unit 18 employs an aggressive branch prediction mechanism m attempt to fetch larger "runs" of mstructions duπng a clock cycle As used herem, a "run" of mstructions is a set of one or more mstructions predicted to be executed m the sequence specified withm the set For example, fetch/scan unit 18 may fetch runs of 24 mstruction bytes from L0 I-cache 16 Each run is divided mto several sections which fetch/scan unit 18 scans m parallel to identify branch mstructions and to generate mstruction scan mformation for mstruction queue 20 Accordmg to one embodiment, fetch/scan unit 18 attempts to predict up to two branch mstructions per clock cycle m order support large mstruction runs Instruction queue 20 is configured to store mstruction bytes provided by fetch/scan unit 18 for subsequent dispatch Instruction queue 20 may operate as a first-in, first-out (FIFO) buffer In one embodiment, mstruction queue 20 is configured to store multiple entries, each entry compnsmg a run of mstructions, scan data identifying up to five mstructions withm each section of the run, and addresses conespondmg to each section of the run Additionally, mstruction queue 20 may be configured to select up to six mstructions within up to four consecutive run sections for presentation to alignment unit 22 Instruction queue 20 may, for example, employ 2- 3 entries An exemplary embodiment of mstruction queue 20 is illustrated below m Fig 13 Alignment unit 22 is configured to route mstructions identified by mstruction queue 20 to a set of issue positions withm lookahead/collapse unit 24 In other words, alignment unit 22 selects the bytes which form each mstruction from the run sections provided by instruction queue 20 responsive to the scan mformation provided by instruction queue 20 The mstructions are provided mto the issue positions m program order (l e the mstruction which is first m program order is provided to the first issue position, the second mstruction m program order is provided to the second issue position, etc ) Lookahead/collapse unit 24 decodes the mstructions provided by alignment unit 22 FPU/multimedia mstructions detected by lookahead collapse unit 24 are routed to FPU/multimedia unit 40 Other instructions are routed to first mstruction window 30A, second mstruction window 30B, and/or load/store unit 36 In one embodiment, a particular mstruction is routed to one of first instruction window 30A or second mstruction wmdow 30B based upon the issue position to which the mstruction was aligned by alignment unit 22 Accordmg to one particular embodiment, mstructions from alternate issue positions are routed to alternate mstruction wmdows 30A and 30B For example, mstructions from issue positions zero, two, and four may be routed to the first mstruction wmdow 30A and mstructions from issue positions one, three, and five may be routed to the second mstruction wmdow 30B Instructions which mclude a memory operation are also routed to load store unit 36 for access to Ll D-cache 38 Additionally, lookahead collapse unit 24 attempts to generate lookahead addresses or execution results for certain types of mstructions Lookahead address/result generation may be particularly beneficial for embodiments employmg the x86 mstruction set Because of the nature the x86 instruction set, many of the mstructions m a typical code sequence are versions of simple moves One reason for this feature is that x86 mstructions mclude two operands, both of which are source operands and one of which is a destmation operand Therefore, one of the source operands of each mstruction is overwritten with an execution result Furthermore, the x86 mstruction set specifies very few registers for stormg register operands Accordmgly, many mstructions are moves of operands to and from a stack mamtamed withm memory Still further, many mstruction dependencies are dependencies upon the ESP/EBP registers and yet many of the updates to these registers are mcrements and decrements of the previously stored values To accelerate the execution of these mstructions, lookahead/collapse unit 24 generates lookahead copies of the ESP and EBP registers for each of mstructions decoded duπng a clock cycle Additionally, lookahead collapse unit 24 accesses future file 26 for register operands selected by each mstruction For each register operand, future file 26 may be stormg either an execution result or a tag identifying a reorder buffer result queue entry conespondmg to the most recent instruction havmg that register as a destmation operand In one embodiment, lookahead/collapse unit 24 attempts to perform an address calculation for each mstruction which (1) mcludes a memory operand, and (n) register operands used to form the address of the memory operand are available from future file 26 or lookahead copies of ESP/EBP Additionally, lookahead collapse unit 24 attempts to perform a result calculation for each mstruction which (I) does not mclude a memory operand, (n) specifies an add subtract operation (mcludmg mcrement and decrement), and (in) register operands are available from future file 26 or lookahead copies of ESP/EBP In this manner, many simple operations may be completed prior to mstructions being sent to mstruction wmdows 30A-30B Lookahead/collapse unit 24 detects dependencies between a group of mstructions bemg dispatched and collapses any execution results generated therem mto instructions dependent upon those mstruction results Additionally, lookahead/collapse unit 24 updates future file 26 with the lookahead execution results Instruction operations which are completed by lookahead/collapse unit 24 (I e address generations and or mstruction results are generated and load/store unit 36 or future file 26 and the result queue are updated) are not dispatched to mstruction wmdows 30A-30B Lookahead/collapse unit 24 allocates a result queue entry in reorder buffer/register file 28 for each mstruction dispatched In one particular embodiment, reorder buffer/register file 28 mcludes a result queue organized m a line-oriented fashion in which storage locations for execution results are allocated and deallocated m lines havmg enough storage for execution results conespondmg to a maximum number of concunently dispatchable mstructions If less than the maximum number instructions are dispatched, then certam storage locations withm the lme are empty Subsequently dispatched mstructions use the next available lme, leaving the certam storage locations empty In one embodiment, the result queue mcludes 40 lmes, each of which may store up to six execution results conespondmg to concunently dispatched mstructions Execution results are retired from the result queue m order mto the register file mcluded withm reorder buffer/register file 28 Additionally, the reorder buffer handles branch mispredictions, transmitting the conected fetch address generated by the execution of the branch mstruction to fetch/scan unit 18 Similarly, mstructions which generate other exceptions are handled withm the reorder buffer Results conespondmg to mstructions subsequent to the exception- generating mstruction are discarded by the reorder buffer The register file comprises a storage location for each architected register For example, the x86 mstruction set defines 8 architected registers The register file for such an embodiment mcludes eight storage locations The register file may further include storage locations used as temporary registers by a microcode unit m embodiments employmg microcode units Further details of one exemplary embodiment of future file 26 and reorder buffer/register file 28 are illustrated m Fig 14 below Future file 26 maintains the speculative state of each architected register as mstructions are dispatched by lookahead collapse unit 24 As an mstruction havmg a register destination operand is decoded by lookahead collapse unit 24, the tag identifying the storage location withm the result queue portion of reorder buffer/register file 28 assigned to the mstruction is stored mto the future file 26 storage location conespondmg to that register When the conespondmg execution result is provided, the execution result is stored into the conesponding storage location (assuming that a subsequent mstruction which updates the register has not been dispatched) It is noted that, m one embodiment, a group of up to six mstructions is selected from mstruction queue 20 and moves through the pipeline within lookahead/collapse unit 24 as a unit. If one or more instructions within the group generates a stall condition, the entire group stalls. An exception to this rule is if lookahead/collapse unit 24 generates a split line condition due to the numbei of ESP updates within the group). Such a group of instructions is refened to as a "line" of instructions herein. Instruction windows 30 receive instructions from lookahead/collapse unit 24. Instruction windows 30 store the instructions until the operands conesponding to the instructions are received, and then select the instructions for execution. Once the address operands of an instruction including a memory operation have been received, the instruction is transmitted to one of the address generation units 34. Address generation units 34 generate an address from the address operands and forward the address to load store unit 36. On the other hand, once the execution operands of an instruction have been received, the instruction is transmitted to one of the functional units 32 for execution. In one embodiment, each integer window 30A-30B includes 25 storage locations for instructions. Each integer window 30A-30B is configured to select up to two address generations and two functional unit operations for execution each clock cycle in the address generation units 34 and functional units 32 connected thereto. In one embodiment, instructions fetched from LO I-cache 16 remain in the order fetched until stored into one of instruction windows 30, at which point the instructions may be executed out of order. In embodiments of processor 10 employing the x86 instruction set, an instruction may include implicit memory operations for load/store unit 36 as well as explicit functional operations for functional units 32. Instructions having no memory operand do not include any memory operations, and are handled by functional units 32. Instructions having a source memory operand and a register destination operand include an implicit load memory operation handled by load/store unit 36 and an explicit functional operation handled by functional units 32. Instructions having a memory source/destination operand include implicit load and store memory operations handled by load/store unit 36 and an explicit functional operation handled by functional units 32. Finally, instructions which do not have an explicit functional operation are handled by load/store unit 36. Each memory operation results in an address generation handled either by lookahead/collapse unit 24 or address generation units 34. Memory operations and instructions (i.e. functional operations) may be refened to herein separately, but may be sourced from a single instruction. Address generation units 34 are configured to perform address generation operations, thereby generating addresses for memory operations in load/store unit 36. The generated addresses are forwarded to load/store unit 36 via result buses 48. Functional units 32 are configured to perform integer arithmetic/logical operations and execute branch instructions. Execution results are forwarded to future file 26, reorder buffer/register file 28, and instruction windows 30A-30B via result buses 48. Address generation units 34 and functional units 32 convey the result queue tag assigned to the instruction being executed upon result buses 48 to identify the instruction being executed. In this manner, future file 26, reorder buffer/register file 28, instruction windows 30A-30B, and load/store unit 36 may identify execution results with the conesponding instruction. FPU/multimedia unit 40 is configured to execute floating point and multimedia instructions. Load/store unit 36 is configured to interface with Ll D-cache 38 to perform memory operations. A memory operation is a transfer of data between processor 10 and an external memory. The memory operation may be an explicit mstruction, or may be implicit portion of an mstruction which also mcludes operations to be executed by functional units 32. Load memory operations specify a transfer of data from external memory to processor 10, and store memory operations specify a transfer of data from processor 10 to external memory. If a hit is detected for a memory operation withm Ll D-cache 38, the memory operation is completed therem without access to external memory. Load store unit 36 may receive addresses for memory operations from lookahead collapse unit 24 (via lookahead address calculation) or from address generation units 34. In one embodiment, load/store unit 36 is configured perform up to three memory operations per clock cycle to Ll D- cache 38. For this embodiment, load/store unit 36 may be configured to buffer up to 30 load/store memory operations which have not yet accessed D-cache 38. The embodiment may further be configured to include a 96 entry miss buffer for buffering load memory operations which miss D-cache 38 and a 32 entry store data buffer Load/store unit 36 is configured to perform memory dependency checkmg between load and store memory operations. Ll D-cache 38 is a high speed cache memory for storing data Any suitable configuration may be used for Ll D-cache 38, mcludmg set associative and direct mapped configurations In one particular embodiment, Ll D-cache 38 is a 128 KB two way set associative cache employmg 64 byte lines. Ll D-cache 38 may be organized as, for example, 32 banks of cache memory per way. Additionally, Ll D-cache 38 may be a linearly addressed/physically tagged cache employmg a TLB similar to Ll I-cache 14. External mterface unit 42 is configured to transfer cache lines of instruction bytes and data bytes mto processor 10 m response to cache misses. Instruction cache lmes are routed to predecode unit 12, and data cache lmes are routed to Ll D-cache 38 Additionally, external mterface unit 42 is configured to transfer cache lmes discarded by Ll D-cache 38 to memory if the discarded cache lmes have been modified to processor 10. As shown m Fig. 1, external mterface unit 42 is configured to mterface to an external L2 cache via L2 interface 44 as well as to mterface to a computer system via bus mterface 46 In one embodiment, bus mterface unit 46 compπses an EV/6 bus mterface. Turning now to Fig. 2, a block diagram of one embodiment of fetch/scan unit 18 is shown Other embodiments are possible and contemplated As shown m Fig. 2, fetch scan unit 18 mcludes a prefetch control unit 50, a plurality of select next blocks 52A-52C, an mstruction select multiplexor (mux) 54, an mstruction scanner 56, a branch scanner 58, a branch history table 60, a branch select mux 62, a return stack 64, an mdirect address cache 66, and a forward collapse unit 68. Prefetch control unit 50 is coupled to Ll I-cache 14, L0 I-cache 16, mdirect address cache 66, return stack 64, branch history table 60, branch scanner 58, and mstruction select mux 54. Select next block 52A is coupled to Ll I-cache 14, while select next blocks 52B-52C are coupled to L0 I-cache 16. Each select next block 52 is coupled to mstruction select mux 54, which is further coupled to branch scanner 58 and mstruction scanner 56. Instruction scarmer 56 is coupled to mstruction queue 20. Branch scanner 58 is coupled to branch history table 60, return stack 64, and branch select mux 62. Branch select mux 62 is coupled to mdirect address cache 66. Branch history table 60 and branch scanner 58 are coupled to forward collapse unit 68, which is coupled to mstruction queue 20. Prefetch control unit 50 receives branch prediction mformation (mcludmg target addresses and taken/not taken predictions) from branch scanner 58, branch history table 60, return stack 64, and indnect address cache 66 Responsive to the branch prediction mformation, prefetch control unit 50 generates fetch addresses for LO I-cache 16 and a prefetch address for Ll I-cache 14. In one embodiment, prefetch control unit 50 generates two fetch addresses for LO I-cache 16. The first fetch address is selected as the target address conespondmg to the first branch instruction identified by branch scanner 58 (if any). The second fetch address is the sequential address to the fetch address selected m the previous clock cycle (i.e. the fetch address conespondmg to the run selected by instruction select mux 54). LO I-cache 14 provides the cache lines (and predecode mformation) conespondmg to the two fetch addresses, as well as the cache lmes (and predecode mformation) which are sequential to each of those cache lmes, to select next blocks 52B-52C. More particularly, select next block 52B receives the sequential cache lme conespondmg to the sequential address and the next incremental cache lme to the sequential cache line Select next block 52C receives the target cache lme conespondmg to the target address as well as the cache lme sequential to the target cache lme Additionally, select next blocks 52B-52C receive the offset portion of the conespondmg fetch address. Select next blocks 52B-52C each select a run of mstruction bytes (and conespondmg predecode mformation) from the received cache lmes, beginning with the run section mcludmg the offset portion of the conespondmg fetch address. Smce the offset portion of each fetch address can begm anywhere withm the cache lme, the selected run may mcluded portions of the fetched cache lme and the sequential cache lme to the fetched cache lme. Hence, both the fetched cache lme and the sequential cache lme are received by select next blocks 52B-52C. Similarly, select next block 52A receives a prefetched cache lme (and conespondmg predecode mformation) from Ll I-cache 14 and selects an mstruction run therefrom. Smce one cache lme is prefetched from Ll I-cache 14, the run selected therefrom may comprise less than a full run if the offset portion of the prefetch address is near the end of the cache lme. It is noted that the fetch cache lmes from LO I-cache 16 may be provided m the same clock cycle as the conespondmg addresses are generated by prefetch control unit 50, but the prefetch cache line may be a clock cycle delayed due to the larger size and slower access time of Ll I-cache 14. In addition to providmg the prefetched cache lme to select next block 52A, Ll I-cache 14 provides the prefetched cache lme to L0 I-cache 16. If the prefetched cache lme is already stored withm L0 I-cache 16, L0 I-cache 16 may discard the prefetched cache lme. However, if the prefetched cache lme is not already stored in L0 I-cache 14, the prefetched cache lme is stored mto L0 I-cache 16. In this manner, cache lmes which may be accessed presently are brought mto L0 I-cache 16 for rapid access therefrom. Accordmg to one exemplary embodiment, L0 I-cache 16 compπses a fully associative cache structure of eight entries. A fully associative structure may be employed due to the relatively small number of cache lmes mcluded in L0 I-cache 16. Other embodiments may employ other organizations (e.g. set associative or direct-mapped) Prefetch control unit 50 selects the mstruction run provided by one of select next blocks 52 m response to branch prediction mformation by controlling mstruction select mux 54 As will be explained m more detail below, prefetch control unit 50 receives target addresses from branch scanner 58, return stack 64, and mdirect address cache 66 early in the clock cycle as well as at least a portion of the opcode byte of the first branch mstruction identified by branch scanner 58 Prefetch control unit 50 decodes the portion of the opcode byte to select the target address to be fetched from L0 I-cache 16 from the various target address sources and provides the selected target address to LO I-cache 16 In parallel, the sequential address to the fetch address selected m the previous clock cycle (either the target address or the sequential address from the previous clock cycle, dependmg upon the branch prediction from the previous clock cycle) is calculated and provided to LO I-cache 16 Branch prediction mformation (I e taken or not taken) is provided by branch history table 60 late m the clock cycle If the branch mstruction conespondmg to the target address fetched from LO I-cache 16 is predicted taken, then prefetch control unit 50 selects the mstruction run provided by select next block 52C On the other hand, if the branch mstruction is predicted not taken, then the mstruction run selected by select next block 52B is selected The mstruction run provided by select next block 52A is selected if a predicted fetch address missed LO I-cache 16 m a previous clock cycle and was fetched from Ll I-cache 14 Additionally, the mstruction run from Ll I- cache 14 is selected if the mstruction run was prefetched responsive to a branch mstruction have a 32 bit displacement or mdirect target address generation or an LO I-cache miss was fetched The selected mstruction run is provided to mstruction scanner 56 and branch scanner 58 Instruction scanner 56 scans the predecode mformation conespondmg to the selected mstruction run to identify instructions withm the mstruction run More particularly m one embodiment, mstruction scanner 56 scans the start bits conespondmg to each run section m parallel and identifies up to five mstructions within each run section Pomters to the identified mstructions (offsets withm the run section) are generated The pomters, instruction bytes, and addresses (one per run section) are conveyed by instruction scanner 56 to mstruction queue 20 If a particular run section mcludes more than five mstructions, the mformation conespondmg to run sections subsequent to the particular run section is invalidated and the particular run section and subsequent run sections are rescanned duπng the next clock cycle Branch scanner 58 scans the mstruction run m parallel with mstruction scanner 56 Branch scanner 58 scans the start bits and control transfer bits of the mstruction run to identify the first two branch mstructions withm the mstruction run As descπbed above, a branch mstruction is identified by the control transfer bit conespondmg to the start byte of an mstruction (as identified by the start bit) bemg set Upon locatmg the first two branch mstructions, branch scanner 58 assumes that the mstructions are relative branch mstructions and selects the conespondmg encoded target addresses from the mstruction bytes followmg the start byte of the branch mstruction For embodiments employmg the x86 mstruction set, a nme bit target address (the displacement byte as well as the conespondmg control transfer bit) is selected, and a 32 bit target address is selected as well Furthermore, at least a portion of the opcode byte identified by the start and control transfer bits is selected The target addresses and opcode bytes are routed to prefetch control unit 50 for use m selectmg a target address for fetchmg from L0 I-cache 16 The fetch addresses of each branch mstruction (determined from the fetch address of the run section mcludmg each branch mstruction and the position of the branch instruction withm the section) are routed to branch history table 60 for selecting a taken/not-taken prediction conespondmg to each branch mstruction Furthermore, the fetch addresses conespondmg to each branch mstruction are routed to branch select mux 62, which is further routed to mdirect address cache 66 The target address of each branch mstruction is routed to forward collapse unit 68 Accordmg to one embodiment, branch scanner 58 is configured to scan each run section m parallel for the first two branch mstructions and then to combme the scan results to select the first two branch mstructions withm the run Branch scarmer 58 may further be configured to determine if a subroutme call mstruction is scanned duπng a clock cycle Branch scanner 58 may forward the fetch address of the next mstruction followmg the detected subroutme call mstruction to return stack 64 for storage therem In one embodiment, if there are more than two branch mstructions withm a run, the run is scanned agam duπng a subsequent clock cycle to identify the subsequent branch mstruction The fetch addresses of the identified branch mstructions are provided to branch history table 60 to determine a taken/not taken prediction for each mstruction Branch history table 60 comprises a plurality of taken/not-taken predictors conespondmg to the previously detected behavior of branch mstructions One of the predictors is selected by mamtammg a history of the most recent predictions and exclusive ORing those most recent predictions with a portion of the fetch addresses conespondmg to the branch mstructions The least recent (oldest) prediction is exclusive ORed with the most significant bit withm the portion of the fetch address, and so forth through the most recent prediction bemg exclusive ORed with the least significant bit withm the portion of the fetch address Smce two predictors are selected per clock cycle, the predictor conespondmg to the second branch mstruction is dependent upon the prediction of the first branch instruction (for exclusive ORmg with the least significant bit of the conespondmg fetch address) Branch history table 60 provides the second predictor by selecting both of the predictors which might be selected (l e the predictor that would be selected if the first branch mstruction is predicted not-taken and the predictor that would be selected if the first branch mstruction is predicted taken) and then selectmg one of the two predictors based on the actual prediction selected for the first branch mstruction Branch history table 60 receives mformation regardmg the execution of branch mstructions from functional units 32A-32D The history of recent predictions conespondmg to the executed branch mstruction as well as the fetch address of the executed branch mstruction are provided for selecting a predictor to update, as well as the taken not taken result of the executed branch mstruction Branch history table 60 selects the conespondmg predictor and updates the predictor based on the taken/not taken result In one embodiment, the branch history table stores a bimodal counter The brmodal counter is a saturating counter which saturates at a minimum and maximum value (l e subsequent decrements of the minimum value and mcrements of the maximum value cause no change m the counter) Each time a branch mstruction is taken, the conespondmg counter is mcremented and each time a branch mstruction is not taken, the conespondmg counter is decremented The most significant bit of the counter mdicates the taken not taken prediction (e g taken if set, not taken if clear) In one embodiment, branch history table 60 stores 64K predictors and mamtams a history of the 16 most recent predictions Each clock cycle, the predictions selected duπng the clock cycle are shifted mto the history and the oldest predictions are shifted out of the history Return stack 64 is used to store the return addresses conespondmg to detected subroutme call mstructions Return stack 64 receives the fetch address of a subroutine call mstruction from branch scanner 58 The address of the byte followmg the call mstruction (calculated from the fetch address provided to return stack 64) is placed at the top of return stack 64 Return stack 64 provides the address stored at the top of the return stack to prefetch control unit 50 for selection as a target address if a return mstruction is detected by branch scanner 58 and prefetch control unit 50 In this manner, each return mstruction receives as a target address the address conespondmg to the most recently detected call mstruction Generally m the x86 mstruction set, a call mstruction is a control transfer mstruction which specifies that the sequential address to the call mstruction be placed on the stack defined by the x86 architecture A return mstruction is an instruction which selects the target address from the top of the stack Generally, call and return mstructions are used to enter and exit subroutmes withm a code sequence (respectively) By placing addresses conesponding to call mstructions m return stack 64 and using the address at the top of return stack 64 as the target address of return mstructions, the target address of the return mstruction may be conectly predicted. In one embodiment, return stack 64 may comprise 16 entπes Indnect address cache 66 stores target addresses conesponding to previous executions of mdirect branch mstructions. The fetch address conesponding to an mdirect branch mstruction and the target address conespondmg to execution of the mdirect branch instruction are provided by functional units 32A-32D to indirect address cache 66. Indirect address cache 66 stores the target addresses mdexed by the conesponding fetch addresses. Indirect address cache 66 receives the fetch address selected by branch select mux 62 (responsive to detection of an mdirect branch mstruction) and, if the fetch address is a hit m mdirect address cache 66, provides the conespondmg target address to prefetch control unit 50 In one embodiment, mdnect address cache 66 may comprise 32 entries Accordmg to one contemplated embodiment, if mdirect address cache 66 detects a miss for a fetch address, mdirect address cache 66 may be configured to select a target address to provide from one of the entries In this manner, a "guess" at a branch target is provided in case an mdirect branch mstruction is decoded. Fetchmg from the guess may be performed rather than awaiting the address via execution of the mdirect branch mstruction. Alternatively, another contemplated embodiment awaits the address provided via execution of the mdnect branch mstruction. Accordmg to one embodiment, prefetch control unit 50 selects the target address for fetchmg from LO I- cache 16 from: (l) the first encoded target address conespondmg to the first branch mstruction identified by branch scanner 58; (n) the return stack address provided by return stack 64; and (in) a sequential address. Prefetch control unit 50 selects the first encoded target address if a decode of the opcode conespondmg to the first mstruction mdicates that the mstruction may be a relative branch mstruction. If the decode mdicates that the mstruction may be a return mstruction, then the return stack address is selected. Otherwise, the sequential address is selected. Indirect target addresses and 32 bit relative target addresses are prefetched from Ll I-cache 14. Smce these types of target addresses are often used when the target address is not near the branch mstruction withm memory, these types of target addresses are less likely to hit m L0 I-cache 16 Additionally, if the second branch mstruction is predicted taken and the first branch mstruction is predicted not taken or the first branch mstruction is a forward branch which does not eliminate the second branch mstruction m the mstruction run, the second target address conespondmg to the second branch prediction may be used as the target fetch address duπng the succeedmg clock cycle accordmg to one embodiment It is noted that, if an encoded target address is selected, the actual target address may be presented to L0 I-cache 16 Prefetch control unit 50 may be configured to precalculate each of the possible above/below target addresses and select the conect address based on the encoded target address Alternatively, prefetch control unit 50 may record which L0 I-cache storage locations are stormg the above and below cache lmes, and select the storage locations directly without a tag compare Forward collapse unit 68 receives the target addresses and positions withm the instruction run of each selected branch instruction as well as the taken/not taken predictions Forward collapse unit 68 determines which mstructions withm the run should be cancelled based upon the received predictions If the first branch mstruction is predicted taken and is backward (1 e the displacement is negative), all mstructions subsequent to the first branch mstruction are cancelled If the first branch mstruction is predicted taken and is forward but the displacement is small (e g withm the mstruction run), the mstructions which are between the first branch mstruction and the target address are cancelled The second branch mstruction, if still withm the run accordmg to the first branch instruction's prediction, is treated similarly Cancel indications for the instructions withm the run are set to mstruction queue 20 Prefetch control unit 50 may be further configured to select a cache lme withm LO I-cache 16 for replacement by a cache lme provided from Ll I-cache 14 In one embodiment, prefetch control unit 50 may use a least recently used (LRU) replacement algorithm Turning now to Fig 3, a block diagram of one embodiment of lookahead/collapse unit 24 is shown Other embodiments are possible and contemplated As shown m Fig 3, lookahead collapse unit 24 mcludes a plurality of decode units 70A-70F, an ESP/EBP lookahead unit 72, a lookahead address/result calculation unit 74, a dispatch control unit 76, and an operand collapse unit 78 Decode units 70A-70F are coupled to receive mstructions from alignment unit 22 Decode units 70A-70F are coupled to provide decoded mstructions to FPU/multimedia unit 40, ESP/EBP lookahead unit 72, futuie file 26, and lookahead address/result calculation unit 74 ESP/EBP lookahead unit 72 is coupled to lookahead address/result calculation unit 74, as is future file 26 Lookahead address/result calculation unit 74 is further coupled load/store unit 36 and dispatch control unit 76 Dispatch unit 76 is further coupled to operand collapse unit 78, future file 26, load/store unit 36, and reorder buffer 28 Operand collapse unit 78 is coupled to mstruction wmdows 30 Each decode unit 70A-70F forms an issue position to which alignment unit 22 aligns an instruction While not mdicated specifically throughout Fig 3 for simplicity the drawing, a particular mstruction remams withm its issue position as the mstruction moves through lookahead/collapse unit 24 and is routed to one of mstruction wmdows 30A-30B if not completed withm lookahead/collapse unit 24 Decode units 70A-70F route FPU/multimedia mstructions to FPU/multimedia unit 40 However, if the FPU/multimedia mstructions mclude memory operands, memory operations are also dispatched to load store unit 36 m response to the mstruction through lookahead address/result calculation unit 74 Additionally, if the address for the memory operations cannot be generated by lookahead address/result calculation unit 74, an address generation operation is dispatch to one of address generation units 34A-34D via mstruction wmdows 30A-30B Still further, entries withm reorder buffer 28 are allocated to the FPU/multimedia mstructions for mamtenance of program order Generally, entries withm reorder buffer 28 are allocated from decode units 70A-70F for each mstruction received therem Each of decode units 70A-70F are further configured to determine (l) whether or not the mstruction uses the ESP or EBP registers as a source operand, and (n) whether not the mstruction modifies the ESP/EBP registers (I e has the ESP or EBP registers as a destination operand) Indications of these determinations are provided by decode units 70A-70F to ESP/EBP lookahead unit 72 ESP/EBP lookahead unit 72 generates lookahead mformation for each mstruction which uses the ESP or EBP registers as a source operand The lookahead mformation may mclude a constant to be added to the cunent lookahead value of the conesponding register and an indication of a dependency upon an mstruction in a prior issue position In one embodiment, ESP/EBP lookahead unit 72 is configured to provide lookahead mformation as long as the set of concunently decoded mstructions provided by decode units 70A-70F do not mclude more than (I) two push operations (which decrement the ESP register by a constant value), (u) two pop operations (which mcrement ESP register by a constant value), (in) one move to ESP register, (iv) one arithmetic/logical mstruction havmg the ESP as a destination, or (v) three mstructions which update ESP If one of these restrictions is exceeded, ESP/EBP lookahead unit 72 is configured to stall mstructions beyond those which do not exceed restrictions until the succeedmg clock cycle (a "split lme" case) For those mstructions preceded, m the same clock cycle but m earlier issue positions, by mstructions which increment or decrement the ESP register, ESP/EBP lookahead unit 72 generates a constant indicating the combmed total modification to the ESP register of the precedmg mstructions For those mstructions preceded by a move or arithmetic operation upon the ESP or EBP registers, ESP/EBP lookahead unit 72 generates a value identifying the issue position containmg the move or arithmetic instruction The lookahead values may be used by lookahead address/result calculation unit 74 to generate either a lookahead address conespondmg to the mstruction withm the issue position (thereby inhibiting an address generation operation which would otherwise be performed by one of address generation units 34A-34D) or a lookahead result conespondmg to the mstruction (thereby providmg lookahead state to future file 26 earlier m the pipelme) Performance may be mcreased by removmg address generation operations and/or providmg lookahead state prior to functional units 32A-32D and address generation units 34A-34D Many x86 code sequences mclude a large number of relatively simple operations such as moves of values from a source to destmation without aπthmetic/logical operation or simple aπthmetic operations such as add subtract by small constant or increment/decrement of a register operand Accordmgly, functional units 32A-32D may typically execute the more complex aπthmetic/logical operations and branch mstructions and address generation units 34A-34D may typically perform the more complex address generations Instruction throughput may thereby be mcreased Decode units 70A-70F are still further configured to identify immediate data fields from the mstructions decoded therem The immediate data is routed to lookahead address/result calculation unit 74 by decode units 70A-70F Additionally, decode unit 70A-70F are configured to identify register operands used by the mstructions and to route register operand requests to future file 26 Future file 26 returns conespondmg speculative register values or result queue tags for each register operand Decode units 70 further provide dependency checkmg between the lme of mstructions to ensure that an mstruction which uses a result of an mstruction withm a different issue position receives a tag conesponding to that issue position Lookahead address/result calculation unit 74 receives the lookahead values from ESP/EBP lookahead units 72, the immediate data from decode units 70A-70F, and the speculative register values or result queue tags from future file 26 Lookahead address/result calculation unit 74 attempts to generate either a lookahead address conespondmg to a memory operand of the mstruction, or a lookahead result if the mstruction does not mclude a memory operand For example, simple move operations can be completed (with respect to functional units 32 and address generation units 34) if an address generation can be performed by lookahead address/result calculation unit 74. In one embodiment, lookahead address/result calculation unit 74 is configured to compute addresses usmg displacement only, register plus displacement, ESP/EBP plus displacement, and scale-mdex-base addressmg mode except for mdex or base registers bemg ESP/EBP Load/store unit 36 performs the memory operation and returns the memory operation results via result buses 48. Even if no address is generated for a memory operation by lookahead address/result calculation unit 74, lookahead address/result calculation unit 74 mdicates the memory operation and conespondmg result queue tag to load/store unit 36 to allocate storage withm load/store unit 36 for the memory operation Simple arithmetic operations which mcrement or decrement a source operand, add/subtract a small immediate value to a source operand, or add subtract two register source operands may also be completed via lookahead address/result calculation unit 74 if the source operands are available from future file 26 (i.e. a speculative register value is received mstead of a result queue tag) Instructions completed by lookahead address/result calculation units 74 are mdicated as completed and are allocated entries in reorder buffer 28 but are not dispatched to mstruction wmdows 30. Lookahead address/result calculation unit 74 may compπse, for example, an adder for each issue position along with conespondmg control logic for selectmg among the lookahead values, immediate data, and speculative register values It is noted that simple arithmetic operations may still be forwarded to mstruction wmdows 30 for generation of condition flags, accordmg to the present embodiment. However, generatmg the functional result m lookahead address/result calculation unit 74 provides the lookahead state early, allowing subsequent address generations/instructions to be performed early as well. Lookahead address/result calculation unit 74 may be configured to keep separate lookahead copies of the ESP/EBP registers m addition to the future file copies. However, if updates to the ESP/EBP are detected which cannot be calculated by lookahead address/result calculation unit 74, subsequent mstructions may be stalled until a new lookahead copy of the ESP/EBP can be provided from future file 26 (after execution of the mstruction which updates ESP/EBP m the undeterminable manner). « Dispatch control unit 76 determines whether or not a group of mstructions are dispatched to provide pipelme flow control. Dispatch control unit 76 receives mstruction counts from mstruction wmdows 30 and load/store counts from load/store unit 36 and, assuming the maximum possible number of mstructions are m flight m pipelme stages between dispatch control units 76 and mstruction wmdows 30 and load/store unit 36, determines whether or not space will be available for stormg the mstructions to be dispatched withm mstruction wmdows 30 and or load store unit 36 when the mstructions anive therein If dispatch control unit 76 determines that insufficient space will be available m load store unit 36 and either mstruction wmdow 30, dispatch is stalled until the mstruction counts received by dispatch control unit 76 decrease to a sufficiently low value. Upon releasmg mstructions for dispatch through dispatch control unit 76, future file 26 and reorder buffer 28 are updated with speculatively generated lookahead results In one embodiment, the number of non- ESP/EBP updates supported may be limited to, for example, two m order to limit the number of ports on future file 26 Furthermore, operand collapse unit 78 collapses speculatively generated lookahead results mto subsequent, concunently decoded mstructions which depend upon those results as mdicated by the previously determined lntrahne dependencies. In this manner, the dependent mstructions receive the speculatively generated lookahead results since these results will not subsequently be forwarded from functional units 32A-32D. Those instructions not completed by lookahead address/result calculation unit 74 are then transmitted to one of instruction windows 30A-30B based upon the issue position to which those instructions were aligned by alignment unit 22. It is noted that certain embodiments of processor 10 may employ a microcode unit (not shown) for executing complex instructions by dispatching a plurality of simpler instructions refened to as a microcode routine. Decode units 70A-70F may be configured to detect which instructions are microcode instructions and to route the microcode instructions to the microcode unit. For example, the absence of a directly decoded instruction output from a decode unit 70 which received a valid instruction may be an indication to the microcode unit to begin execution for the conesponding valid instruction. Is further noted that various storage devices are shown in Figs. 2 and 3 (e.g. devices 79A, 79B, and similar devices in Fig. 2 and devices 79C, 79D and similar devices in Fig. 3). The storage devices represent latches, registers, flip-flops and the like which may be used to separate pipeline stages. However, the particular pipeline stages shown in Figs. 2 and 3 are but one embodiment of suitable pipeline stages for one embodiment of processor 10. Other pipeline stages may be employed in other embodiments. It is noted that, while the x86 instruction set and architecture has been used as an example above and may be used as an example below, any instruction set and architecture may be used. Additionally, displacements may be any desirable size (in addition to the 8 bit and 32 bit sizes used as examples herein). Furthermore, while cache line fetching may be described herein, it is noted that cache lines may be sectors, and sectors may be fetched, if desirable based upon cache line size and the number of bytes desired to be fetched. Turning now to Fig. 4, a block diagram of one embodiment of predecode unit 12 is shown. Other embodiments are possible and contemplated. As shown in Fig. 4, predecode unit 12 includes an input instruction bytes register 80, a fetch address register 82, a byte predecoder 84, a control unit 86, a target generator 88, a start and control transfer bits register 90, an output instruction bytes register 92, and a byte select mux 94. Input instruction bytes register 80 is coupled to byte predecoder 84, control unit 86, target generator 88, byte select mux 94, and external interface unit 42. Fetch address register 82 is coupled to Ll I-cache 14 and target generator 88. Byte predecoder 84 is coupled to start and control transfer bits register 90 and control unit 86. Control unit 86 is coupled to Ll I-cache 14, byte select mux 94, and target generator 88. Target generator 88 is coupled to byte select mux 94, which is further coupled to output instruction bytes register 92. Output instruction bytes register 92 and start and control transfer bits register 90 are further coupled to Ll I-cache 14. Upon detection of an Ll I-cache miss, predecode unit 12 receives the linear fetch address conesponding to the miss into fetch address register 82. In parallel, external interface unit 42 receives the conesponding physical fetch address and initiates an external fetch for the cache line identified by the fetch address. External interface unit 42 provides the received instruction bytes to input instruction bytes register 80. Byte predecoder 84 predecodes the received instruction bytes to generate conesponding start and control transfer predecode bits. The generated predecode information is stored into start and control transfer bits register 90. Because instructions can have boundaries at any byte within the cache line due to the variable length nature of the x86 instruction set, byte predecoder 84 begins predecoding at the offset within the cache line specified by the fetch address stored withm fetch address register 82. The byte specified by the offset is assumed to be the first byte of an mstruction (1 e. the conespondmg start bit is set) Byte predecoder 84 predecodes each byte beginning with the first byte to determine the beginning of each mstruction and to detect branch mstructions Branch mstructions result m the control transfer bit conesponding to the start byte of the branch mstruction bemg set by byte predecoder 84. Additionally, byte predecoder 84 informs control unit 86 if the branch instruction is a relative branch mstruction and mdicates the position of the mstruction subsequent to the branch mstruction withm the cache lme In one embodiment, byte predecoder 84 is configured to predecode four bytes per clock cycle m parallel. Responsive to the signal from byte predecoder 84 mdicatmg that a relative branch mstruction has been detected, control unit 86 causes target generator 88 to generate the target address conespondmg to the relative branch instruction The displacement byte or bytes are selected from the mstruction bytes stored m register 80. Additionally, the fetch address stored m fetch address register 82 (with the offset portion replaced by the position of the mstruction subsequent to the branch mstruction) is provided to target generator 88. Target generator 88 adds the received address and displacement byte or bytes, thereby generating the target address The generated target address is then encoded for storage as a replacement for the displacement field of the relative branch mstruction. Additionally, control unit 86 select the output of target generator 88 to be stored mto output mstruction bytes register 92 instead of the conespondmg displacement bytes of the relative branch mstruction from input mstruction bytes register 80 Other mstruction bytes are selected from mput mstruction bytes register 80 for storage in output mstruction bytes register 92 as those bytes are predecoded by byte predecoder 84. Once byte predecoder 84 has completed predecode of the cache lme and each relative branch mstruction has had its displacement replaced by an encodmg of the target address, control unit 86 asserts a predecode complete signal to Ll I-cache 14, which then stores the output mstruction bytes and conespondmg start and control transfer bits As described above, for relative branch mstructions havmg small displacement fields (e.g. a smgle displacement byte) the control transfer bit conespondmg to the displacement byte is used m addition to the displacement byte to store the encodmg of the target address. Target generator 88 signals byte predecoder 84 with the appropriate control transfer bit, which byte predecoder 84 stores m the conespondmg position withm start and control transfer bits register 90. It is noted that, if a relative branch mstruction spans the boundary between two cache lmes (i.e. a first cache lme stores a first portion of the mstruction and the succeedmg cache lme stored the remammg portion), predecode unit 12 may be configured to fetch the succeedmg cache lme m order to complete the predecodmg for the relative branch mstruction It is further noted that predecode unit 12 may be configured to handle multiple outstandmg cache lmes simultaneously Turning next to Fig 4A, a block diagram of one embodiment of target generator 88 is shown. Other embodiments are possible and contemplated As shown m Fig. 4A, target generator 88 includes a displacement mux 100, a sign extend block 102, an adder 104, and a displacement encoder 106. Displacement mux 100 is coupled to mput mstruction bytes register 80 and sign extend block 102, and receives control signals from control unit 86 Sign extend block 102 is coupled to an mput of adder 104 and receives control signals from control unit 86. The second mput of adder 104 is coupled to receive the fetch address from fetch address register 82 (except for the offset bits) concatenated with a position within the cache line from control unit 86. Adder 104 is further coupled to displacement encoder 106 which receives control signals from control unit 86. Displacement encoder 106 is further coupled to byte select mux 94 and byte predecoder 84. Displacement mux 100 is used to select a displacement byte or bytes from the relative branch instruction. In the present embodiment, displacements may be one or four bytes. Accordingly, displacement mux 100 selects four bytes from input instruction bytes register 80. If a one byte displacement is included in the relative branch instruction, the displacement is selected into the least significant of the four bytes. The remaining three bytes may be zeros or may be prior bytes within input instruction bytes register 80. Sign extend block 102, under control from control unit 86, sign extends the one byte displacement to a four byte value. On the other hand, a four byte displacement is selected by displacement mux 100 and is not modified by sign extend block 102. It is noted mat larger addresses may be employed by processor 10. Generally, the displacement may be sign extended to the number of bits within the address. Displacement encoder 106 receives the target address calculated by adder 104 and encodes the target address into a format storable into the displacement bytes. In the present embodiment, a four byte displacement stores the entirety of the target address. Hence, displacement encoder 106 passes the target address unmodified to byte select mux 94 for storage in output instruction bytes register 92. Additionally, the control transfer bits conesponding to the displacement bytes are not used. For one byte displacements, the target address is encoded. More particularly, a portion of the displacement byte is used to store the offset of the target address within the target cache line (e.g. in the present embodiment, 6 bits to store a 64 byte offset). The remaining portion of the displacement byte and the conesponding control transfer bit is encoded with a value indicating the target cache line as a number of cache lines above or below the cache line identified by the fetch address stored in fetch address register 82. Accordingly, displacement encoder 106 is coupled to receive the fetch address from fetch address register 82. Displacement encoder 106 compares the fetch address to the target address to determine not only the number of cache lines therebetween, but the direction. Upon generating the encoding, displacement encoder 106 transmits the modified displacement byte to byte select mux 94 for storage in output instruction bytes register 92 and also transmits the value for the control transfer bit conesponding to the displacement byte to byte predecoder 84. As an alternative to employing adder 104 to calculate target addresses for small displacement fields, displacement encoder 106 may directly generate the encoded target address (above below value and cache line offset) by examining the value of the displacement field and the position of the branch instruction within the cache line. Turning now to Fig. 5, a diagram illustrating an exemplary relative branch instruction 110 having an eight bit displacement according to the x86 instruction set is shown. Relative branch instruction 110 includes two bytes, an opcode byte 112 which is also the first byte of the instruction and a displacement byte 114. Opcode byte 112 specifies that instruction 110 is a relative branch instruction and that the instruction has an eight bit displacement. Displacement byte 114 has been updated with an encoding of the target address. The encoding includes a cache line offset portion labeled "CL offset" (which comprises six bits in the cunent embodiment but may comprise any number bits suitable for the conesponding instruction cache line size) and a relative cache line portion labeled "LI2" m the control transfer bit conespondmg to displacement byte 114 and "LI1 LIO" withm displacement byte 114 Fig 5 also illustrates the start and control transfer bits conespondmg to mstruction 110 The start bit for each byte is labeled "S" m Fig 5 with a box mdicatmg the value of the bit, and the control transfer bit is labeled "C" with a box mdicatmg the value of the bit Accordmgly, the start bit conespondmg to opcode byte 112 is set to mdicate that opcode byte 112 is the beginning of an mstruction and the control transfer bit conespondmg to opcode byte 112 is also set to indicate that the mstruction beginning at opcode byte 112 is a control transfer mstruction The start bit conespondmg to displacement byte 114, on the other hand, is clear because displacement byte 114 is not the beginning of an instruction The control transfer bit conespondmg to displacement byte 114 is used to store a portion of the relative cache lme portion of the encoded target address Turning next to Fig 6, an exemplary relative branch instruction 120 havmg a 32-bit displacement accordmg to the x86 mstruction set is shown Instruction 120 mcludes an opcode field 122 compnsmg two bytes and a displacement field 124 compnsmg four bytes Similar to Fig 5, Fig 6 illustrates the start and control transfer bits for each byte withm mstruction 120 Accordmgly, two start bits and two control transfer bits are illustrated for opcode field 122, and one start bit and control transfer bit are illustrated for each byte withm displacement field 124 The first start bit conespondmg to opcode field 122 (I e the start bit conespondmg to the first byte of opcode field 122) is set, mdicatmg that the first byte of opcode field 122 is the beginning of an mstruction The first control transfer bit conespondmg to opcode field 122 is also set mdicatmg that mstruction 120 is a control transfer mstruction The second start bit conespondmg to opcode field 122 is clear, as the second byte withm opcode field 122 is not the start of mstruction The control transfer bit conespondmg to the second opcode byte is a don't care (mdicated by an "x") Smce displacement field 124 is large enough to contam the entirety of the target address conespondmg to mstruction 120, the control transfer bits conespondmg to the displacement bytes are also don't cares Each start bit conespondmg to displacement byte is clear, mdicatmg that that these bytes are not the start of an mstruction Turning now to Fig 7, a diagram of an exemplary set of mstructions 130 from the x86 mstruction set are shown, further illustrating use of the start and control transfer bits accordmg to one embodiment of processor 10 Similar to Figs 5 and 6, each byte withm the set of mstructions 130 is illustrated along with a conespondmg start bit and control transfer bit The first mstruction withm set of mstructions 130 is an add instruction which specifies addition of a one byte immediate field to the contents of the AL register and storing the result m the AL register The add mstruction is a two byte mstruction m which the first byte is the opcode byte and the second byte is the one byte immediate field Accordmgly, the opcode byte is marked with a set start bit mdicatmg the beginning of the mstruction The conespondmg control transfer bit is clear mdicatmg that the add mstruction is not a branch mstruction The start bit conespondmg to the immediate byte is clear because the immediate byte is not the start of an mstruction, and the control transfer bit is a don't care Subsequent to the add mstruction is a smgle byte mstruction (an increment of the EAX register) The start bit conespondmg to the mstruction set because the byte is the beginning of instruction The control transfer bit is clear since the mcrement is not a branch mstruction Finally, a second add mstruction specifymg the addition of a one byte immediate field to the contents of the AL register is shown subsequent to the mcrement instruction The start bit conespondmg to the opcode of the add mstruction is set, and the control transfer bit is clear The mcrement mstruction followed by the add mstruction illustrates that consecutive bytes can have start bits which are set m the case where a smgle byte is both the start boundary and end boundary of the mstruction Turning now to Fig 8, a block diagram of one embodiment of branch scanner 58 is shown for use with the x86 mstruction set Other embodiments are possible and contemplated In the embodiment of Fig 8, branch scanner 58 mcludes a scan block 140, section target muxes 142A-142D, and run target muxes 144A-144D Scan block 140 is coupled to receive the start and control transfer bits conespondmg to a run section from select next blocks 52 through mstruction select mux 54 Branch scanner 58 further mcludes additional scan blocks similar to scan block 140 for scanning the start and control transfer bits conespondmg to the remaining run sections of the selected run Scan block 140 is coupled to section target muxes 142A-142D to provide selection controls thereto Additionally, scan block 140 (and similar scan blocks for the other run sections) provide selection controls for run target muxes 144A-144D Each of section target muxes 142A-142B is coupled to receive the mstruction bytes conespondmg to the run section scanned by scan block 140 as well as the conespondmg control transfer bits Each of section target muxes 142C-142D are coupled receive the mstruction bytes conespondmg to the run section as well, but may not receive the conespondmg control transfer bits Each of section target muxes 142A- 142D is coupled to respective one of run target muxes 144A-144D as shown m Fig 8 The outputs of run target muxes 144A and 144B are coupled to prefetch control unit 50 and to branch history table 60 The outputs of run target muxes 144C and 144D are coupled to prefetch control unit 50 Scan block 140 is configured to scan the start and control transfer bits received therem in order to locate the first two branch mstructions withm the run section If a first branch mstruction is identified withm the run section, scan block 140 directs section target mux 142A to select the opcode byte, which is the byte for which both the start and control transfer bits are set, and the immediately succeedmg byte and the control transfer bit conespondmg to the immediately succeedmg byte, which collectively form the encoded target address if the first branch mstruction mcludes an eight bit relative displacement Similarly, if a second branch mstruction is identified withm the run section, scan block 140 dnects section target mux 142B to select the opcode byte of the second branch mstruction and the immediately succeedmg byte and the control transfer bit conespondmg to the immediately succeedmg byte In this manner, the opcode byte and target address conespondmg to the first two relative branch mstructions havmg eight bit displacement are selected Additionally, the position of each branch mstruction withm the run section is identified by scan block 140 Scan block 140 is further configured to control section target mux 142C in response to detecting the first branch mstruction More particularly, scan block 140 selects the four consecutive mstruction bytes beginning with the second byte followmg the start byte of the first branch mstruction (l e beginning with the byte two bytes subsequent to the start byte of the first branch mstruction withm the cache lme) These consecutive mstruction bytes are the encoded target address if the first branch mstruction mcludes a 32-bit relative displacement Similarly, scan block 140 controls section target mux 142D to select the four consecutive start bytes beginning with the second byte followmg the start byte of the second branch mstruction In this manner, the target address conespondmg to the first two relative branch mstructions havmg 32-bit displacements are selected Prefetch control unit 50 is configured to determme whether or not either (I) the target address selected by section target mux 142A, (n) the target address selected by section target mux 142C, or (m) a target address from return stack 64 or mdirect address cache 66 conesponds to the first branch instruction Similarly, prefetch control unit 50 is configured determme whether or not either (l) the target address selected by section target mux 142B, (n) the target address selected by section target mux 142D, or (m) a target address from return stack 64 or mdirect address cache 66 conesponds to the second branch mstruction Scan block 140, m conjunction with similar scan blocks for the other sections of the run, controls run target muxes 144A-144D to select target mformation conespondmg to the first two branch instructions withm the run Accordmgly, run target mux 144 A selects the target address (I e the immediately succeedmg byte and conespondmg control transfer bit), opcode, and position of the first branch mstruction withm the run Similarly, run target mux 144B selects the target address, opcode, and position of the second branch mstruction withm the run Run target muxes 144C-144D select 32-bit target addresses conespondmg to the first and second branch mstructions, respectively Turning next to Fig 9, a block diagram of one embodiment of prefetch control unit 50 is shown Other embodiments are possible contemplated As shown m Fig 9, prefetch control unit 50 includes a decoder 150, a fetch address mux 152, an mcrementor 154, and an Ll prefetch control unit 156 Decoder 150 is coupled to receive the first branch opcode conespondmg to the first branch mstruction withm the run from branch scanner 58 and to reorder buffer 28 to receive a misprediction redirection indication and conespondmg conected fetch address Additionally, decoder 150 is coupled to fetch address mux 152 and Ll prefetch control unit 156 Fetch address mux 152 is coupled to receive the first target address conesponding to the first branch mstruction withm the run as selected by run target mux 144A The second target address conespondmg to the second branch mstruction address is also provided to fetch address mux 152 with a one clock cycle delay Additionally, fetch address mux 152 is configured to receive the return address provided by return stack 64, the conected fetch address provided by reorder buffer 28 upon misprediction rednection, and the sequential address to the address fetched m the previous clock cycle (generated by mcrementor 154) Fetch address mux 152 is coupled to provide the target fetch address to L0 I-cache 16 and to Ll prefetch control unit 156 Ll prefetch control unit 156 is further coupled to L0 I-cache 16 to receive a miss indication, to mdirect address cache 66 to receive a predicted indirect target address, to branch scanner 58 to receive 32-bit target addresses conesponding to relative branch mstructions, to reorder buffer 28 to receive branch misprediction addresses, and to Ll I-cache 14 to provide an Ll prefetch address Prefetch control unit 50 provides a sequential fetch address to L0 I-cache 16 via a register 158 Decoder 150 is configured to decode the opcode conespond to the first identified branch instruction from branch scanner 58 m order to select the target fetch address for L0 I-cache 16 In order provide the target fetch address as rapidly is possible, decoder 150 decodes only a portion of the opcode byte received from branch scanner 58 More particularly, for the x86 mstruction set, decoder 150 may decode the four most significant bits of the opcode byte identified by the set start and control transfer bits to select one of the first target address from branch scanner 58, the return address from return stack 64, and the sequential address. Fig 10, described m more detail below, is a truth table conespondmg to one embodiment of decoder 150. Because only a subset of the bits of the opcode byte are decoded, fewer logic levels may be employed to generate the selection controls for fetch address mux 152, thereby allowing rapid target address selection If the target address selected responsive to the decode is mconect, the fetched mstructions may be discarded and the conect fetch address may be generated duπng a subsequent clock cycle. Because the branch prediction conespondmg to the first branch mstruction withm the run is not available until late m the clock cycle m which the fetch address is selected, decoder 150 does not attempt to select the second branch target address as the target fetch address If the first branch mstruction is predicted not taken, via branch history table 60, the second target address conesponding to the second identified branch mstruction (if any) may be fetched m a subsequent clock cycle if the second branch mstruction is predicted taken by branch history table 60. Also, if the first branch is predicted taken but the first target address is withm the same run as the first branch, the sequential address is selected. If the first branch does not branch past the second branch withm the run, the second target address is selected during the subsequent clock cycle Similarly, if the first branch mstruction uses an indirect target address or 32-bit relative target address, fetch address mux 152 may select an address and the fetched mstructions may be discarded m favor of mstructions at the actual branch target Ll prefetch control unit 156 generates an Ll prefetch address for Ll I-cache 14. The cache lme conespondmg to the Ll prefetch address is conveyed to L0 I-cache 16 for storage. Ll prefetch control unit 156 selects the prefetch address from one of several sources. If a branch misprediction is signalled by reorder buffer 28, the sequential address to the conected fetch address provided by reorder buffer 28 is selected since the other address sources are based upon mstructions withm the mispredicted path If no branch misprediction is signalled and an L0 fetch address miss is detected, Ll prefetch control unit 156 selects the L0 fetch address miss for prefetchmg. If no miss is detected, Ll prefetch control unit 156 selects either the indnect address provided by mdirect address cache 66 or a 32-bit branch target address from branch scanner 58 responsive to signals from decoder 150. If no signals are received from decoder 150, Ll prefetch control unit 156 prefetches the cache lme sequential to the target address selected by fetch address 152. Indirect addresses and 32-bit target addresses are not fetched from L0 I-cache 16 because these types of target addresses are typically selected by a programmer when the target mstruction sequence is not spatially located withm memory near the branch mstruction. Because L0 I-cache 16 stores a small number of cache lmes most recently accessed m response to the code sequence bemg executed, it may be statistically less likely that the target mstruction sequence is stored m the L0 I-cache 16. Incrementor 154 is configured to mcrement the fetch address conespondmg to the run selected for dispatch based on the branch prediction mformation received from branch history table 60. Prefetch control unit 50 mcludes logic (not shown) for selectmg the run, via mstruction select multiplexor 54, based on L0 I-cache hit mformation as well as the branch prediction mformation. This logic also causes mcrementor 154 to mcrement the fetch address conespondmg to the selected run (either the sequential fetch address provided from register 158 or the target fetch address provided from fetch address mux 152) Accordmgly, the sequential fetch address for the subsequent clock cycle is generated and stored m register 158 Turning next to Fig 10, a truth table 160 conespondmg to one embodiment of decoder 150 employed withm one embodiment of processor 10 employmg the x86 mstruction set is shown Other embodiments are possible and contemplated As shown m Fig 10, opcodes havmg the four most significant bits equal to (m hexadecimal) 7, E, or 0 result m the first target address bemg selected by fetch address mux 152 Opcodes havmg the four most significant bits equal to C result m the return address from return stack 64 being selected, and opcodes havmg the four most significant bits equal to F cause the sequential address to be selected Branch mstruction opcodes havmg the four most significant bits equal to 7 are conditional jump mstructions havmg eight bit relative displacements Accordmgly, an opcode conesponding to a set start bit and set control transfer bit which has the four most significant bits equal to 7 conectly selects the target address provided from run target mux 144A Branch mstruction opcodes havmg the four most significant bits equal to E may be conditional jump mstructions with eight bit relative displacements, or call or unconditional jump mstructions havmg either eight bit relative displacements or 32 bit relative displacements For these cases, decoder 150 selects the first target address provided by run target mux 144A and, if further decode indicates that a 32-bit displacement field is mcluded m the branch mstruction, the mstructions fetched m response to the selection are discarded and the conect fetch address is prefetch from Ll I-cache 14 via Ll prefetch control unit 156 receivmg the 32-bit fetch address from branch scanner 58 Finally, branch mstruction opcodes havmg the four most significant bits equal to 0 specify 32-bit relative displacements Smce decoder 150 cannot select the 32 bit target address for fetchmg from L0 I-cache 16 m the present embodiment, decoder 150 selects the first target address provided from branch scanner 58 and signals Ll prefetch control unit 156 to select the 32-bit branch target address from branch scanner 58 for prefetchmg from Ll I-cache 14 Branch mstruction opcodes havmg the four most significant bits equal to C are return mstructions, and hence the return address provided by return address stack 64 provides the predicted fetch address On the other hand, branch mstruction opcodes havmg the four most significant bits equal to F are call or unconditional jump mstructions which use lndnect target address generation The mdirect address is not provided to fetch address mux 152, and hence a default selection of the sequential address is performed The instructions fetched in response to the sequential address are discarded and mstructions prefetched from Ll I-cache 14 are provided duπng a subsequent clock cycle As truth table 160 illustrates, predecode of just a portion of the mstruction byte identified by the start and control transfer bits may be used to select a target fetch address for L0 I-cache 16 Accordmgly, prefetch control unit 50 and branch scanner 58 may support high frequency, smgle cycle L0 I-cache access Turning next to Fig 10A, a flowchart is shown illustrating operation of one embodiment of decoder 150 Other embodiments are possible and contemplated While shown as a serial series of steps m Fig 10A, it is understood that the steps illustrated may be performed m any suitable order, and may be performed m parallel by combmatoπal logic employed withm decoder 150 Decoder 150 determines if a branch misprediction is bemg signalled by reorder buffer 28 (decision block 192) If a misprediction is signalled, the conected fetch address received from reorder buffer 28 is selected (step 193) On the other hand, if a misprediction is not signalled, decoder 150 determines if the second target address conespondmg to the second branch mstruction identified durmg the previous clock cycle by branch scanner 58 is to be fetched (decision block 194) The second target address may be fetched if the first branch mstruction was predicted not-taken and the second branch mstruction was predicted taken Additionally, the second target address may be fetched if the first branch mstruction was predicted taken, but was a small forward displacement which does not cancel the second branch mstruction, and the second branch mstruction was predicted taken If the second target address is to be fetched, decoder 150 selects the second target address (which was received in the previous clock cycle and is one clock cycle delayed m reachmg fetch address mux 152 - step 195) Finally, if the second target address is not to be fetched, decoder 150 operates accordmg to truth table 160 descπbed above (step 196) Turning now to Fig 11, a flowchart is shown illustrating operation of one embodiment of Ll prefetch control unit 156 Other embodiments are possible and contemplated While shown as a serial series of steps m Fig 11, it is understood that the steps illustrated may be performed in any suitable order, and may be performed m parallel by combinatorial logic employed withm Ll prefetch control unit 156 If a branch misprediction rednection is received by Ll prefetch control unit 156 (decision block 170), the sequential cache lme to the cache line conespondmg to the conected fetch address is prefetched from Ll I- cache 14 (step 172) On the other hand, if a branch misprediction redirection is not received, Ll prefetch control unit 156 determmes if an L0 I-cache miss has occuπed (decision block 174) If an L0 I-cache miss is detected, the address missing L0 I-cache 16 is prefetched from Ll I-cache 14 (step 176) In the absence of an L0 I-cache miss, Ll prefetch control unit 156 determmes if either an mdirect target address or a 32-bit relative target address has been detected by decoder 150 (decision block 178) If such a signal is received, the indnect address received from mdirect address cache 66 or the 32-bit relative target address received from branch scanner 58 is prefetched from Ll I-cache 14 (step 180) Finally, if no indnect target address or 32-bit relative target address is signalled, Ll prefetch control unit 156 prefetches the next sequential cache lme to the cunent target fetch address (step 182) Turning now to Fig 12, a table 190 is shown illustrating the fetch results conespondmg to one embodiment of processor 10 for various target addresses and branch predictions conespondmg to the first and second branch mstructions identified withm an mstruction run Other embodiments are possible contemplated As used m table 190, a small forward target is a target which lies withm the cunent run Conversely, a large forward target is a target which does not lie withm the cunent run A target is forward if the target address is numeπcally greater than the address of the branch mstruction, and backward if the target address is numeπcally smaller than the address of the branch mstruction The taken/not taken prediction is derived from branch history table 60 As illustrated by the footnote, results conespondmg to the second branch prediction may be delayed by a clock cycle accordmg to one embodiment Therefore, processor 10 may assume not taken for the second branch prediction (I e fetch the sequential address) and, if the second branch prediction indicates taken, the fetch may be conected duπng the subsequent clock cycle The result column m table 190 lists several results The term "squash" when used m the result column of table 190 mdicates which mstructions are deleted from mstruction queue 20 via signals from forward collapse unit 68 shown m Fig. 2. Additionally, the target or sequential address to be fetched responsive to the first and/or second branch instructions is mdicated followed by parenthetical notation as to which of LO I-cache 16 (LO notation) or Ll I-cache 14 (Ll notation) the target or sequential address is conveyed. Turning next to Fig. 13, a block diagram of one exemplary embodiment of mstruction queue 20 is shown Other embodiments are possible and contemplated. In the embodiment of Fig. 13, mstruction queue 20 mcludes run storages 300A-300B, scan data storages 302A-302B, and address storages 304A-304B Additionally, mstruction queue 20 mcludes a mux 306 and a control unit 308 A run of instructions is provided to mstruction queue 20 from fetch/scan unit 18 via a run bus 310, conespondmg scan data is provided on a scan data bus 312; and conesponding addresses (one per run section) are provided on a run addresses bus 314. Instruction queue 20 provides a set of selected mstruction bytes to alignment unit 22 on mstruction bytes bus 316, pomters to mstructions withm the mstruction bytes on an instruction pointers bus 318, and addresses for the run sections compnsmg the set of selected instruction bytes on an addresses bus 320 Run bus 310 is coupled to run storages 300A-300B, while scan data bus 312 is coupled to scan data storages 302A-302B and address storages 304A- 304B are coupled to run addresses bus 314. Storages 300A-300B, 302A-302B, and 304A-304B are coupled to mux 306, which is further coupled to buses 316-320 Control unit 308 is coupled to mux 306 and scan data storages 302A-302B Fetch/scan unit 18, and more particularly mstruction scanner 56 accordmg to the embodiment of Fig 2, provides a run of mstructions and associated mformation to mstruction queue 20 via buses 310-314. Control unit 308 allocates one of run storages 300A-300B for the mstruction bytes compnsmg the mstruction run, and a conespondmg scan data storage 302A-302B and address storage 304A-304B for the associated mformation The scan data mcludes mstruction pomters which identify: (l) the start byte and end byte as offsets withm a run section; as well as (n) the run section withm which the mstruction resides. Accordmg to one particular embodiment, up to five mstructions may be identified withm an eight byte run section, and there are up to three run sections m a run for a total of up to 15 mstructions pomters stored withm a scan data storage 302 Additionally, address storages 304 store an address conespondmg to each run section. Control unit 308 examines the mstructions pomters withm scan data storages 302A-302B to identify mstructions withm a set of contiguous run sections for dispatch to alignment unit 22. In one particular embodiment, up to six mstructions are identified withm up to four contiguous run sections. The run sections may be stored m one of run storages 300A or 300B, or some run sections may be selected from one of run storages 300A-300B and the other run sections may be selected from the other one of run storages 300A-300B A first run section is contiguous to a second run section if the first run section is next, m speculative program order, to the second run section. It is noted that mux 306, while illustrated as a smgle mux in Fig. 13 for simplicity m the drawing, may be implemented by any suitable parallel or cascaded set of multiplexors. Control unit 308 provides a set of selection signals to mux 306 to select the set of run sections mcludmg the selected mstructions, as well as the mstruction pomters conespondmg to the selected mstructions. Additionally, the address for each selected run section is selected. The run sections are provided upon mstruction bytes bus 316, while the conespondmg mstruction pomters and addresses are provided upon mstruction pomters bus 318 and addresses bus 320, respectively Turning next to Fig 14, a block diagram of one embodiment of future file 26 and reorder buffer/register file 28 is shown in more detail Other embodiments are possible and contemplated In the embodiment of Fig 14, future file 26 is shown along with a register file 28A and a reorder buffer 28B Future file 26 is coupled to register file 28A, result buses 48, a set of source operand address buses 330, a set of source operand buses 332, and a set of lookahead update buses 334 Reorder buffer 28B is coupled to register file 28A, result buses 48, and dispatched mstructions buses 336 As mstructions are decoded by decode units 70 within lookahead/collapse unit 24, the register source operands of the mstructions are routed to future file 26 via source operand address buses 330 Future file 26 provides either the most cunent speculative value of each register, if the mstruction generating the most cunent value has executed, or a reorder buffer tag identifymg the mstruction which will generate the most cunent value, upon source operands buses 332 Additionally, one of the source operands may be mdicated to be a destination operand Future file 26 updates the location conespondmg to the destmation register with the reorder buffer tag to be assigned to the conespondmg mstruction m response to the destmation operand Future file 26 additionally receives updates from lookahead/collapse unit 24 Lookahead results generated by lookahead address/result calculation unit 74 are provided to future file 26 via lookahead update buses 334 By providmg lookahead updates from lookahead address/result calculation unit 74, speculative execution results may be stored mto future file 26 more rapidly and may thereby be available more rapidly to subsequently executmg mstructions Subsequent mstructions may thereby be more likely to achieve lookahead result calculation In one embodiment, to reduce the number of ports on future file 26, the number of lookahead updates is limited (for example, 2 updates may be allowable) Smce the ESP updates are already captured by lookahead/collapse unit 24, those updates need not be stored mto future file 26 Furthermore, not every issue position will have a speculative update for future file 26 Accordmgly, fewer speculative updates, on average, may be needed m future file 26 and therefore limiting the number of updates may not reduce performance Instruction results are provided upon result buses 48 Future file 26 receives the results and compares the conespondmg reorder buffer tags (also provided upon result buses 48) to the reorder buffer tags stored therem to determme whether or not the mstruction result compnses the most recent speculative update to one of the architected registers If the reorder buffer tag matches one of the reorder buffer tags m the future file, the result is capture by future file 26 and associated with the conespondmg architected register Future file 26 is coupled to register file 28A to receive a copy of the architected registers stored therem when an exception/branch misprediction is detected and retired Reorder buffer 28B may detect exceptions and branch mispredictions from die results provided upon result buses 48, and may signal register file 28A and future file 26 if a copy of the architected registers as retned in register file 28 A is to be copied to future file 26 For example, upon retiring an mstruction havmg an exception or branch misprediction, the copy may be performed In this manner, future file 26 may be recovered from mconect speculative execution Reorder buffer 28B receives the dispatched mstructions from lookahead collapse unit 24 via dispatched mstructions bus 336 The dispatched mstructions may be provided to reorder buffer 28B upon a determination by dispatch control unit 76 that mstructions are to be dispatched Additionally, reorder buffer 28B receives execution results upon results buses 48 and retires the results, m program order, to register file 28A Turning now to Fig. 15, a block diagram of one embodiment of a computer system 200 mcludmg processor 10 coupled to a variety of system components through a bus bridge 202 is shown. Other embodiments are possible and contemplated In the depicted system, a mam memory 204 is coupled to bus bπdge 202 through a memory bus 206, and a graphics controller 208 is coupled to bus bridge 202 through an AGP bus 210 Finally, a plurality of PCI devices 212A-212B are coupled to bus bridge 202 through a PCI bus 214 A secondary bus bridge 216 may further be provided to accommodate an electrical mterface to one or more EISA or ISA devices 218 through an EISA/ISA bus 220. Processor 10 is coupled to bus bridge 202 through bus mterface 46 Bus bridge 202 provides an mterface between processor 10, mam memory 204, graphics controller 208, and devices attached to PCI bus 214 When an operation is received from one of the devices connected to bus bπdge 202, bus bridge 202 identifies the target of the operation (e.g. a particular device or, in the case of PCI bus 214, that the target is on PCI bus 214). Bus bridge 202 routes the operation to the targeted device Bus bπdge 202 generally translates an operation from the protocol used by the source device or bus to the protocol used by the target device or bus. In addition to providmg an mterface to an ISA/EISA bus for PCI bus 214, secondary bus bridge 216 may further mcorporate additional functionality, as desired. For example, in one embodiment, secondary bus bridge 216 mcludes a master PCI arbiter (not shown) for arbitrating ownership of PCI bus 214. An input/output controller (not shown), either external from or mtegrated with secondary bus bridge 216, may also be mcluded withm computer system 200 to provide operational support for a keyboard and mouse 222 and for various seπal and parallel ports, as desired. An external cache unit (not shown) may further be coupled to bus mterface 46 between processor 10 and bus bridge 202 m other embodiments Alternatively, the external cache may be coupled to bus bπdge 202 and cache control logic for the external cache may be mtegrated mto bus bridge 202 Mam memory 204 is a memory m which application programs are stored and from which processor 10 prrmanly executes. A suitable mam memory 204 compπses DRAM (Dynamic Random Access Memory), and preferably a plurality of banks of SDRAM (Synchronous DRAM) PCI devices 212A-212B are illustrative of a variety of peripheral devices such as, for example, network mterface cards, video accelerators, audio cards, hard or floppy disk drives or dπve controllers, SCSI (Small Computer Systems Interface) adapters and telephony cards. Similarly, ISA device 218 is illustrative of vaπous types of peπpheral devices, such as a modem, a sound card, and a vanety of data acquisition cards such as GPIB or field bus mterface cards. Graphics controller 208 is provided to control the rendermg of text and images on a display 226. Graphics controller 208 may embody a typical graphics accelerator generally known m the art to render three- dimensional data structures which can be effectively shifted into and from mam memory 204. Graphics controller 208 may therefore be a master of AGP bus 210 m that it can request and receive access to a target mterface withm bus bridge 202 to thereby obtain access to mam memory 204. A dedicated graphics bus accommodates rapid refrieval of data from mam memory 204. For certam operations, graphics controller 208 may further be configured to generate PCI protocol transactions on AGP bus 210 The AGP mterface of bus bπdge 202 may thus mclude functionality to support both AGP protocol transactions as well as PCI protocol target and initiator transactions. Display 226 is any electronic display upon which an image or text can be presented. A suitable display 226 mcludes a cathode ray tube ("CRT"), a liquid crystal display ("LCD"), etc It is noted that, while the AGP, PCI, and ISA or EISA buses have been used as examples m the above description, any bus architectures may be substituted as desired It is further noted that computer system 200 may be a multiprocessmg computer system mcludmg additional processors (e g. processor 10a shown as an optional component of computer system 200). Processor 10a may be similar to processor 10. More particularly, processor 10a may be an identical copy of processor 10. Processor 10a may share bus interface 46 with processor 10 (as shown m Fig 15) or may be connected to bus bridge 202 via an independent bus Numerous variations and modifications will become apparent to those skilled m the art once the above disclosure is fully appreciated. It is intended that the following claims be interpreted to embrace all such variations and modifications.

Claims: WHAT IS CLAIMED IS: 1 A processor compnsmg a predecode unit configured to predecode a plurality of mstruction bytes received by said processor, wherem said predecode unit, upon predecodmg a relative control fransfer mstruction compnsmg a displacement, is configured to add an address to said displacement to generate a target address conespondmg to said relative control fransfer mstruction, and wherem said predecode unit is configured to replace said displacement withm said relative control transfer mstruction with at least a portion of said target address; and an mstruction cache coupled to said predecode unit, wherem said mstruction cache is configured to store said plurality of mstruction bytes mcludmg said relative confrol transfer mstruction with said displacement replaced by said at least said portion of said target address. 2. The processor as recited in claim 1 wherein said displacement mcludes fewer bits than said target address 3. The processor as recited m claim 2 wherem said predecode unit is configured to generate an encoded value to mdicate said target address. 4. The processor as recited m claim 3 wherem said encoded value mcludes a first field and a second field 5. The processor as recited m claim 4 wherem said first field comprises an offset withm a target cache lme of a byte identified by said target address. 6. The processor as recited m claim 5 wherem said second field comprises a number of cache lmes above or below a cache lme stormg said relative control transfer mstruction at which said target cache lme is stored. 7. The processor as recited m claim 6 wherem said first field and at least a portion of said second field form said at least said portion of said target address 8. The processor as recited m claim 7 wherem said predecode unit is configured to generate a plurality of control transfer mdications, and wherem each one of said plurality of confrol fransfer indications conesponds to a different one of said plurality of mstruction bytes, and wherem said mstruction cache is configured to store said plurality of confrol fransfer mdications, and wherem said plurality of control fransfer mdications identify control transfer instructions mcludmg said relative control transfer mstruction. 9 The processor as recited m claim 8 wherem a particular one of said control transfer mdications is configured to store a remaming portion of said second field, said particular one of said control transfer mdications conespondmg to said displacement 10 The processor as recited in claim 9 wherem said remammg portion of said second field identifies whether said target cache lme is above or below said cache lme storing said relative control transfer instruction 11 The processor as recited m claim 10 wherein said portion of said second field forming said at least said portion of said target address identifies said number of cache lines above or below the said cache line stormg said relative confrol fransfer mstruction 12 The processor as recited in claim 1 wherem said displacement mcludes an equal number of bits as said target address, and wherem said predecode unit is configured to replace said displacement with an entirety of said target address. 13 A method for generatmg a target address for a relative control transfer mstruction, the method compnsmg predecodmg a plurality of mstruction bytes mcludmg said relative transfer mstruction to detect a presence of said relative control transfer mstruction, addmg an address to a displacement included m said relative control transfer instruction, thereby generatmg said target address, replacing said displacement withm said relative control transfer mstruction with an encodmg indicative of said target address; and stormg said plurality of mstruction bytes mcludmg said relative control fransfer mstruction, with said displacement replaced by said encodmg, m an instruction cache 14 The method as recited m claim 13 wherem said displacement mcludes fewer bits than said target address, said encodmg mcludmg a first field identifymg an offset withm a target cache lme which mcludes a bytes identified by said target address, and at least a portion of a second field identifymg a number of cache lmes above or below a cache lme mcludmg said relative transfer mstruction at which said target cache lme is stored 15 The method as recited m claim 14 wherem said predecodmg compπses generatmg a plurality of control transfer mdications, wherem each of said plurality of control transfer mdications conesponds to a different one of said plurality of instruction bytes, and wherem said plurality of control transfer indications identify confrol fransfer mstructions starting at said different ones of said plurality of mstruction bytes 16. The method as recited in claim 15 wherein said predecoding further comprises storing a remaining portion of said second field in a particular one of said plurality of control transfer indications, said particular one of said plurality of control transfer indications conesponding to a particular one of said plurality of instruction bytes forming said displacement. 17. The method as recited in claim 13 wherein said displacement includes an equal number of bits as said target address, and wherein said encoding comprises an entirety of said target address. 18. A predecode unit comprising: a decoder configured to decode a plurality of instruction bytes and to identify a relative control transfer instruction therein; and a target generator configured to add a displacement selected from said relative control transfer instruction to an address, thereby generating a target address conesponding to said relative control fransfer instruction, and further configured to generate an encoding of said target address with which said predecode unit replaces said displacement within said relative control transfer instruction. 19. The predecode unit as recited in claim 18 wherein said encoding comprises a cache line offset and a number of cache lines above or below a cache line storing said relative control transfer instruction. 20. A computer system comprising: a processor configured to predecode a plurality of instruction bytes received by said processor, wherem said processor, upon predecoding a relative control transfer instruction comprising a displacement, is configured to add an address to said displacement to generate a target address conesponding to said relative control transfer instruction, and wherein said processor is configured to replace said displacement within said relative control transfer instruction with at least a portion of said target address; a memory coupled to said processor, wherein said memory is configured to store said plurality of instruction bytes and to provide said instruction bytes to said processor; and an input/output (I/O) device configured to transfer data between said computer system and another computer system coupled to said I O device.

Inventors: WITT DAVID B, WITT, DAVID, B.
Applicants: ADVANCED MICRO DEVICES INC, ADVANCED MICRO DEVICES, INC.
Application year: 1998
Main classification: G06F9
IPC codes: G06F9, G06F12