PROCESSOR EMPLOYING CONTROL TRANSFER BIT IN PREDECODE FOR IDENTIFYING CONTROL TRANSFER INSTRUCTIONS

Abstract: A processor is configured to predecode instruction bytes prior to storing them in an instruction cache. The predecode information generated by the processor includes instruction boundary indications identifying which of the instruction bytes are boundaries of instructions and control transfer indications identifying which of the instructions are control transfer instructions. The combination of the control transfer indications and the instruction boundary indications allows the branch prediction mechanism to locate the branch instructions in a group of instruction bytes fetched from instruction cache by scanning the control transfer and instruction boundary indications. In one embodiment, the branch prediction mechanism attempts to predict up to two branch instructions per clock cycle. Accordingly, the branch prediction mechanism scans the control transfer and instruction boundary indications to locate the first two branch instructions within a group of instruction bytes fetched from the instruction cache. In one embodiment, the instruction boundary indications comprise a start bit corresponding to each instruction byte. The start bit is set if the corresponding instruction byte is the initial byte of an instruction, and clear if the corresponding instruction byte is not the initial byte of instruction. The control transfer indications may similarly comprise a control transfer bit corresponding to each instruction byte. If a byte is indicated to be the initial byte of an instruction via the start bit, the control transfer bit is used to indicate whether or not the instruction is a control transfer instruction.

Description: TITLE: PROCESSOR EMPLOYING CONTROL TRANSFER BIT IN PREDECODE FOR IDENTIFYING 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 dispatchmg 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 issumg) a larger maximum number of instructions per clock cycle than a "narrow issue" superscalar processor is capable of dispatchmg Duπng 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 m the computer industry For example, the K5 and K6 processors from Advanced Micro Devices, Ine , of Sunnyvale, California implement the x86 instruction set The x86 instruction set is a vaπable length instruction set in which various instructions occupy differmg 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 encodmg Vaπable length instruction sets, such as the x86 instruction set, minimize the amount of memory needed to store a particular program by only occupymg 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, vaπable 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 withm a code sequence m order to provide sufficient instructions to the instruction dispatch hardware. Because the location of each vaπable length instruction withm 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 gams 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 herem, the branch prediction mechanism refers to the hardware which detects control transfer instructions withm the instructions being identified for dispatch and which predicts the next fetch address resulting 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 mstructions are an example of control transfer instructions. A jump instruction specifies a target address different than the address of the byte immediately following 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 mstruction at the sequential address responsive to an execution result of a previous mstruction (for example, by specifying a condition flag set via mstruction execution). Other types of instructions besides jump mstructions may also be control transfer mstructions. For example, subroutine call and return mstructions may cause stack manipulations m addition to specifying the next fetch address Many of these additional types of control transfer mstructions include a jump operation (either conditional or unconditional) as well as additional instruction operations. Control transfer instructions may specify the target address in a vaπety of ways. "Relative" control transfer instructions mclude a value (either directly or indirectly) which is to be added to an address corresponding 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 mstructions, the address of the byte immediately following the control transfer mstruction is the address to which the value is added. Other mstruction sets may specifying adding the value to the address of the control transfer mstruction itself. For relative control transfer instructions which directly specify the value to be added, an mstruction field is included for stoπng 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 mstructions therefore do not require an address corresponding to the control transfer instruction 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 in 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 instructions per clock cycle but may ultimately cancel many of the issued mstructions 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 mstructions 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 m accordance with the present mvention. The processor is configured to predecode mstruction bytes pπor to stormg them in an mstruction cache. The predecode information generated by the processor mcludes mstruction boundary indications identifying which of the mstruction bytes are boundaries of instructions and control transfer indications identifying which of the mstructions are control transfer mstructions. The mstruction boundary indications provide for rapid and parallel identification of multiple mstructions for dispatch, supporting wide issue superscalar processors by parallelizing mstruction identification. Furthermore, the control transfer indications allow for rapid and parallel identification of branch mstructions withm the mstructions identified for dispatch. Advantageously, the branch prediction mechanism employed by the processor may quickly locate branch mstructions m order to generate predictions for the branch mstructions. Because the branch prediction mechanism rapidly locates the branch mstructions, and hence may rapidly develop branch predictions for the identified branch mstructions, the branch prediction mechanism may operate more efficiently than if instruction bytes were decoded to locate branch mstructions. The combination of the control transfer indications and the instruction boundary indications allows the branch prediction mechanism to quickly locate the branch instructions in a group of mstruction bytes fetched from instruction cache simply by scanning the control transfer and mstruction boundary indications. The more efficient branch prediction mechanism may support wide issue superscalar processors at a high performance level In one embodiment, the branch prediction mechanism attempts to predict up to two branch mstructions per clock cycle Accordmgly, the branch prediction mechanism scans the control transfer and mstruction boundary indications to locate the first two branch mstructions withm a group of mstruction bytes fetched from the mstruction cache. In one embodiment, the mstruction boundary indications comprise a start bit correspondmg to each instruction byte. The start bit is set if the correspondmg instruction byte is the initial byte of an mstruction, and clear if the correspondmg mstruction byte is not the initial byte of mstruction. The control transfer indications may similarly compπse a control transfer bit correspondmg to each mstruction byte. If a byte is mdicated to be the initial byte of an mstruction via the start bit, the control transfer bit is used to indicate whether or not the mstruction is a control transfer instruction. The branch prediction mechanism may therefore detect branch mstructions by scanning the start bits and control transfer bits correspondmg to a group of instruction bytes fetched from mstruction cache Broadly speakmg, the present mvention contemplates a processor comprising a predecode unit and an mstruction cache. The predecode unit is configured to generate predecode information correspondmg to a plurality of mstruction bytes received by the processor. The predecode information includes a first indication, correspondmg to a particular mstruction byte withm the plurality of instruction bytes, which is indicative, in a first state, that the particular mstruction byte is a boundary of an mstruction. Furthermore, the predecode information mcludes a control transfer indication, correspondmg to the particular mstruction byte, which is indicative, in a first state, that the mstruction of which the particular mstruction byte is a boundary is a control transfer mstruction. Coupled to the predecode unit, the mstruction cache is configured to store the plurality of mstruction bytes and the predecode information received from the predecode unit. The present mvention further contemplates a predecode unit compπsmg a storage device and a decoder The storage device is configured to store a plurality of mstruction bytes received from a memory. The decoder is configured to decode the plurality of mstruction bytes to generate predecode information correspondmg thereto, mcludmg a boundary mdication identifying a boundary of each mstruction withm the plurality of instruction bytes and a control transfer mdication identifying which mstructions withm the plurality of instruction bytes are control transfer mstructions. Moreover, the present invention contemplates a method for rapid control transfer mstruction detection A plurality of mstruction bytes are predecoded to generate an mstruction boundary indication and a control transfer mdication correspondmg to each of the plurality of instruction bytes. The mstruction boundary mdication mdicates whether or not a correspondmg one of the plurality of mstruction bytes is a boundary of an mstruction. If the correspondmg one of the plurality of instruction bytes is a boundary of the mstruction, the control transfer mdication mdicates whether or not the mstruction is a control transfer mstruction. The instruction boundary indications and the control transfer mdications are scanned upon fetchmg the plurality of mstruction bytes to identify control transfer instructions therem. The present mvention still further contemplates a computer system compπsmg a processor, a memory, and an input/output (I/O) device. The processor is configured to generate predecode information correspondmg to a plurality of mstruction bytes received by the processor. The predecode information mcludes a first mdication correspondmg to a particular mstruction byte withm the plurality of mstruction bytes. The first mdication is indicative, m a first state, that the particular mstruction byte is a boundary of an instruction. The predecode information also mcludes a control transfer mdication correspondmg to the particular mstruction byte. The control transfer mdication is indicative, m a first state, that the instruction of which the particular instruction byte is a boundary is a control transfer instruction. Coupled to the processor, the memory is configured to store the plurality of mstruction bytes and to provide the plurality of 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 mvention will become apparent upon readmg the following detailed description and upon reference to the accompanying 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 lookahead/collapse unit shown in Fig. 1. Fig. 4 is a block diagram of one embodiment of a predecode unit shown in 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 corresponding 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 m Fig. 9 Fig 11 is a flowchart illustrating operation of one embodiment of the LI prefetch control unit shown m Fig. 9. Fig. 12 is a table illustrating mstruction fetch and dispatch results for one embodiment of the processor shown in Fig. 1 m which up to two branch mstructions are predicted per clock cycle. Fig. 13 is a block diagram of one embodiment of an mstruction queue illustrated m Fig. 1 Fig 14 is a block diagram of one embodiment of a future file, register file, and reorder buffer shown m Fig. 1. Fig. 15 is a block diagram of one embodiment of a computer system mcludmg the processor shown in Fig. 1. While the mvention is susceptible to vaπous modifications and alternative forms, specific embodiments thereof are shown by way of example m the drawings and will herem be descπbed in detail. It should be understood, however, that the drawings and detailed descπption thereto are not mtended to limit the mvention to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling withm the spirit and scope of the present mvention 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 m Fig 1, processor 10 includes a predecode unit 12, an LI I-cache 14, an L0 I-cache 16, a fetch/scan unit 18, an mstruction 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 LI D-cache 38, an FPU/multimedia unit 40, and an external mterface unit 42. Elements referred to herem by a particular reference number followed by vaπous letters will be collectively refeπed 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 mterface unit 42 is coupled to predecode unit 12, LI D-cache 38, an L2 mterface 44, and a bus mterface 46. Predecode unit 12 is further coupled to LI I-cache 14. LI 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 umt 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 mstruction wmdow 30A, second mstruction wmdow 30B, and FPU/multimedia unit 40 FPU/multimedia unit 40 is coupled to load/store umt 36 and to reorder buffer/register file 28 Load/store unit 36 is coupled to LI D-cache 38. First instruction wmdow 30A is coupled to functional units 32A-32B and to address generation units 34A-34B Similarly, second mstruction wmdow 30B is coupled to functional units 32C- 32D and address generation units 34C-34D Each of LI D-cache 38, functional units 32, and address generation umts 34 are coupled to a plurality of result buses 48 which are further coupled to load/store unit 36, first mstruction wmdow 30A, second mstruction window 30B, reorder buffer/register file 28, and future file 26 Predecode unit 12 receives mstruction bytes fetched by external mterface unit 42 and predecodes the mstraction bytes prior to their storage withm LI I-cache 14 Predecode mformation generated by predecode unit 12 is stored m LI I-cache 14 as well Generally, predecode mformation is provided to aid m the identification of mstruction features which may be useful during the fetch and issue of mstructions but which may be difficult to generate rapidly duπng the fetch and issue operation The term "predecode", as used herem, refers to decoding mstructions to generate predecode mformation which is later stored along with the instruction bytes being decoded m an mstruction cache (e g LI I-cache 14 and/or LO I-cache 16) In one embodiment, processor 10 employs two bits of predecode mformation per mstraction byte One of the bits, referred to as the "start bit", mdicates whether or not the instruction byte is the initial byte of an mstruction When a group of mstruction bytes is fetched, the correspondmg set of start bits identifies the boundaπes between mstructions withm the group of mstruction bytes Accordmgly, multiple mstructions may be concurrently selected from the group of instruction bytes by scanning the correspondmg start bits While start bits are used to locate mstraction boundaπes by identifying the initial byte of each mstraction, end bits could alternatively be used to locate mstruction boundaπes by identifying the final byte of each mstruction 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 instruction mdicates whether or not the instruction is a branch mstraction 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 descnbed below In addition to generatmg predecode mformation correspondmg to the mstraction bytes, predecode unit 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 mstraction set employed by processor 10 The resulting target address is encoded mto the displacement field as a replacement for the displacement, and the updated displacement field is stored mto LI 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 mstraction 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 into a cache lme offset portion and a relative cache lme portion The cache lme offset portion is the cache lme offset portion of the target address. The relative cache lme portion defines the cache line identified by the target address (the "target cache lme") m terms of a number of cache lines above or below the cache line stormg the relative branch mstraction. A first cache lme is above a second cache line if each byte withm the first cache lme is stored at an address which is numeπcally 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 numeπcally less than the addresses which the bytes withm a second cache lme are stored. A signed eight bit displacement specifies an address which is +/- 128 bytes of the address correspondmg to the branch mstruction. Accordmgly, the number of above and below cache lmes which can be reached by a relative branch mstraction havmg an eight bit displacement is limited. The relative cache lme portion encodes this limited set of above and below cache lmes. Tables 1 and 2 below illustrates an exemplary encodmg of the predecode mformation correspondmg to a byte m accordance with one embodiment of processor 10. Table 1: Predecode Encoding Start Bit Control Transfer Bit Meanmg 1 0 Start byte of an mstruction which is not a branch. 1 1 Start byte of a branch mstraction. 0 X Not an mstruction boundary Control Transfer Bit corresponding to displacement is used on 8-bit relative branches to encode target address as shown in Table 2 below. Table 2: Target Address Encoding Control Transfer Bit Displacement Byte Meanmg Most Significant Bits (binary) 0 00 Withm Current Cache Lme 0 01 One Cache Lme Above 0 10 Two Cache Lmes Above 1 01 One Cache Lme Below 1 10 Two Cache Lmes Below Note: Remammg displacement byte bits are the offset withm the target cache lme. 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 correspondmg predecode mformation to LI I-cache 14 for storage. LI I-cache 14 is a high speed cache memory for stormg mstruction bytes and predecode mformation. LI I-cache 14 may employ any suitable configuration, mcludmg direct mapped and set associative configurations. In one particular embodiment, LI I-cache 14 is a 128 KB, two way set associative cache employing 64 byte cache lmes. LI I-cache 14 mcludes additional storage for the predecode mformation correspondmg to the mstraction bytes stored therem. The additional storage is organized similar to the instruction bytes storage. As used herem, the term "cache line" refers to the umt of allocation of storage m 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, LI 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 index. As specified by the x86 architecture, instructions are defined to generate logical addresses which are translated through a segmentation translation mechanism to a lmear address 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 correspondmg lmear address are equal. Processor 10 may be configured to assume flat addressing mode. Accordingly, fetch addresses, target addresses, etc. as generated by executmg mstructions are lmear addresses. In order to determine if a hit is detected m LI I- cache 14, the lmear address presented thereto by fetch/scan unit 18 is translated usmg a translation lookaside buffer (TLB) to a correspondmg physical address which is compared to the physical tags from the indexed cache lmes to determine a hit/miss. When flat addressing 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 mstruction bytes. Because LI I-cache 14 is large, the access time of LI I-cache 14 may be large. In one particular embodiment, LI 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 LI 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 LI I-cache 14, LO I-cache 16 is configured to store cache lines of mstruction bytes and correspondmg predecode mformation (e g. 512 bytes stores eight 64 byte cache lmes and correspondmg predecode data is stored m 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 LI I-cache 14 Instructions fetched from LO I-cache 16 are scanned by fetch/scan unit 18 to identify instructions for dispatch as well as to locate branch mstructions and to form branch predictions correspondmg to the located branch mstructions. Instraction scan mformation and correspondmg mstruction bytes are stored mto instruction queue 20 by fetch scan unit 18 Additionally, the identified branch instructions and branch predictions are used to generate subsequent fetch addresses for L0 I-cache 16 Fetch/scan unit 18 employs a prefetch algorithm to attempt to prefetch cache lmes from LI I-cache 14 to L0 I-cache 16 pπor to the prefetched cache lmes bemg fetched by fetch/scan unit 18 for dispatch mto processor 10. Any suitable prefetch algoπthm may be used. In one embodiment, fetch/scan unit 18 is configured to prefetch the next sequential cache line to a cache lme fetched from L0 I-cache 16 duπng a particular clock cycle unless: (i) a branch misprediction is signalled; (π) 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 indirect target address generation are assumed to miss L0 I-cache 16. For case (l), fetch/scan umt 18 prefetches the cache lme sequential to the corrected fetch address. For cases (n) and (lii), fetch/scan unit 18 prefetches the correspondmg 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 "ran" 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 mstraction bytes from LO I-cache 16. Each ran is divided mto several sections which fetch/scan unit 18 scans m parallel to identify branch mstractions and to generate mstruction scan mformation for mstraction 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 mstraction 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 comprising, a run of mstractions, scan data identifying up to five mstructions withm each section of the run, and addresses correspondmg to each section of the run. Additionally, mstraction queue 20 may be configured to select up to six instructions within up to four consecutive run sections for presentation to alignment unit 22 Instruction queue 20 may, for example, employ 2- 3 entπes. An exemplary embodiment of mstraction queue 20 is illustrated below in Fig. 13. Alignment unit 22 is configured to route mstractions identified by instruction 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 ran sections provided by instruction queue 20 responsive to the scan mformation provided by mstruction queue 20 The mstructions are provided mto the issue positions m program order (l e. the mstruction which is first in 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 instructions detected by lookahead/collapse unit 24 are routed to FPU/multimedia unit 40. Other mstractions are routed to first instruction window 30A, second instruction window 30B, and/or load/store unit 36. In one embodiment, a particular instruction is routed to one of first instruction wmdow 30A or second mstraction wmdow 30B based upon the issue position to which the instruction was aligned by alignment unit 22. Accordmg to one particular embodiment, mstractions from alternate issue positions are routed to alternate mstruction wmdows 30A and 30B For example, mstractions from issue positions zero, two, and four may be routed to the first instruction wmdow 30A and mstractions from issue positions one, three, and five may be routed to the second mstraction wmdow 30B. Instructions which mclude a memory operation are also routed to load/store unit 36 for access to LI D-cache 38 Additionally, lookahead/collapse unit 24 attempts to generate lookahead addresses or execution results for certain types of mstractions. Lookahead address/result generation may be particularly beneficial for embodiments employmg the x86 instruction set Because of the nature the x86 instruction set, many of the mstructions in 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 destination operand Therefore, one of the source operands of each mstruction is overwπtten with an execution result Furthermore, the x86 mstraction set specifies very few registers for stormg register operands. Accordmgly, many mstructions are moves of operands to and from a stack maintained withm memory. Still further, many mstraction dependencies are dependencies upon the ESP/EBP registers and yet many of the updates to these registers are increments 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 mstractions decoded durmg a clock cycle. Additionally, lookahead/collapse unit 24 accesses future file 26 for register operands selected by each mstraction. For each register operand, future file 26 may be stormg either an execution result or a tag identifying a reorder buffer result queue entry correspondmg to the most recent mstraction havmg that register as a destination operand In one embodiment, lookahead/collapse unit 24 attempts to perform an address calculation for each mstruction which: (l) 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 mstraction which: (l) does not mclude a memory operand; (n) specifies an add/subtract operation (mcludmg mcrement and decrement); and (m) 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 instructions being sent to mstruction windows 30A-30B. Lookahead/collapse unit 24 detects dependencies between a group of instructions bemg dispatched and collapses any execution results generated therem mto mstractions dependent upon those instruction 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 mstraction wmdows 30A-30B. Lookahead/collapse unit 24 allocates a result queue entry m reorder buffer/register file 28 for each instruction dispatched. In one particular embodiment, reorder buffer/register file 28 mcludes a result queue organized in a hne-oπented fashion m which storage locations for execution results are allocated and deallocated m lmes havmg enough storage for execution results correspondmg to a maximum number of concurrently 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, leavmg the certam storage locations empty. In one embodiment, the result queue includes 40 lmes, each of which may store up to six execution results correspondmg to concurrently dispatched mstractions. 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 corrected fetch address generated by the execution of the branch mstruction to fetch/scan unit 18 Similarly, instructions which generate other exceptions are handled withm the reorder buffer. Results correspondmg to instructions subsequent to the exception- generating mstraction are discarded by the reorder buffer. The register file comprises a storage location for each architected register. For example, the x86 instruction set defines 8 architected registers. The register file for such an embodiment mcludes eight storage locations. The register file may further mclude storage locations used as temporary registers by a microcode unit in 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 mamtams the speculative state of each architected register as mstructions are dispatched by lookahead/collapse unit 24. As an mstraction 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 10 buffer/register file 28 assigned to the instruction is stored mto the future file 26 storage location correspondmg to that register. When the correspondmg execution result is provided, the execution result is stored mto the correspondmg 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 mstractions is selected from mstruction queue 20 and moves through the pipeline withm lookahead/collapse unit 24 as a unit. If one or more mstructions withm the group generates a stall condition, the entire group stalls. An exception to this rule is if lookahead/collapse unit 24 generates a split lme condition due to the number of ESP updates withm the group). Such a group of mstractions is referred to as a "lme" of mstructions herein. Instruction wmdows 30 receive mstructions from lookahead/collapse unit 24. Instruction windows 30 store the mstructions until the operands correspondmg to the mstractions are received, and then select the mstructions for execution. Once the address operands of an mstraction mcludmg a memory operation have been received, the mstruction 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 mstruction have been received, the mstraction is transmitted to one of the functional units 32 for execution. In one embodiment, each mteger wmdow 30A-30B mcludes 25 storage locations for mstructions. Each mteger wmdow 30A-30B is configured to select up to two address generations and two functional unit operations for execution each clock cycle m the address generation units 34 and functional units 32 connected thereto. In one embodiment, mstructions fetched from LO I-cache 16 remain m the order fetched until stored mto one of instruction wmdows 30, at which pomt the instructions may be executed out of order. In embodiments of processor 10 employing the x86 mstraction set, an mstruction may include implicit memory operations for load/store unit 36 as well as explicit functional operations for functional units 32. Instructions havmg 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 destmation operand mclude 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 mclude implicit load and store memory operations handled by load/store unit 36 and an explicit functional operation handled by functional units 32. Finally, mstructions which do not have an explicit functional operation are handled by load/store unit 36. Each memory operation results m 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 referred to herem separately, but may be sourced from a smgle mstruction. Address generation units 34 are configured to perform address generation operations, thereby generatmg addresses for memory operations m 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 mteger arithmetic/logical operations and execute branch mstructions. Execution results are forwarded to future file 26, reorder buffer/register file 28, and mstraction wmdows 30A-30B via result buses 48. Address generation units 34 and functional units 32 convey the result queue tag assigned to the instruction bemg executed upon result buses 48 to identify the mstruction 11 bemg executed. In this manner, future file 26, reorder buffer/register file 28, mstruction wmdows 30A-30B, and load/store unit 36 may identify execution results with the correspondmg mstruction. FPU/multimedia unit 40 is configured to execute floating pomt and multimedia mstructions. Load/store unit 36 is configured to mterface with LI 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 instruction, or may be implicit portion of an mstraction 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 LI 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 LI 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 mclude a 96 entry miss buffer for buffermg 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. LI D-cache 38 is a high speed cache memory for stormg data Any suitable configuration may be used for LI D-cache 38, mcludmg set associative and direct mapped configurations. In one particular embodiment, LI D-cache 38 is a 128 KB two way set associative cache employmg 64 byte lmes. LI D-cache 38 may be organized as, for example, 32 banks of cache memory per way. Additionally, LI D-cache 38 may be a linearly addressed/physically tagged cache employing a TLB similar to LI I-cache 14. External interface unit 42 is configured to transfer cache lines of mstraction 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 LI D-cache 38. Additionally, external mterface unit 42 is configured to transfer cache lmes discarded by LI 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 mterface 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 in 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 mstraction scanner 56, a branch scanner 58, a branch history table 60, a branch select mux 62, a return stack 64, an indirect address cache 66, and a forward collapse unit 68. Prefetch control unit 50 is coupled to LI I-cache 14, L0 I-cache 16, indirect 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 LI I-cache 14, while select next blocks 52B-52C are coupled to L0 I-cache 16. Each select next block 52 is coupled to mstraction select mux 54, which is further coupled to branch scanner 58 and mstruction scanner 56. Instruction scanner 56 is coupled to mstraction queue 20. Branch scanner 12 58 is coupled to branch history table 60, return stack 64, and branch select mux 62. Branch select mux 62 is coupled to indirect address cache 66. Branch history table 60 and branch scanner 58 are coupled to forward collapse unit 68, which is coupled to mstraction 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 indirect address cache 66. Responsive to the branch prediction mformation, prefetch control unit 50 generates fetch addresses for L0 I-cache 16 and a prefetch address for LI I-cache 14. In one embodiment, prefetch control unit 50 generates two fetch addresses for L0 I-cache 16. The first fetch address is selected as the target address correspondmg to the first branch mstruction 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 correspondmg to the run selected by mstraction select mux 54). L0 I-cache 14 provides the cache lines (and predecode mformation) correspondmg 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 correspondmg to the sequential address and the next mcremental cache lme to the sequential cache lme. Select next block 52C receives the target cache lme corresponding 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 correspondmg fetch address. Select next blocks 52B-52C each select a run of mstraction bytes (and correspondmg predecode mformation) from the received cache lmes, beginning with the ran section mcludmg the offset portion of the correspondmg 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 correspondmg predecode information) from LI I-cache 14 and selects an mstraction run therefrom. Smce one cache lme is prefetched from LI I-cache 14, the ran selected therefrom may comprise less than a full run if the offset portion of the prefetch address is near the end of the cache line. It is noted that the fetch cache lines from L0 I-cache 16 may be provided m the same clock cycle as the correspondmg addresses are generated by prefetch control umt 50, but the prefetch cache line may be a clock cycle delayed due to the larger size and slower access time of LI I-cache 14. In addition to providing the prefetched cache line to select next block 52A, LI 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 line is not already stored m L0 I-cache 14, the prefetched cache line 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 compnses a fully associative cache stracture of eight entπes. A fully associative structure may be employed due to the relatively small number of cache lmes mcluded m L0 I-cache 16. Other embodiments may employ other organizations (e.g. set associative or direct-mapped). Prefetch control unit 50 selects the instruction ran provided by one of select next blocks 52 m response 13 to branch prediction mformation by controlling mstruction select mux 54. As will be explamed m more detail below, prefetch control unit 50 receives target addresses from branch scanner 58, return stack 64, and indirect address cache 66 early m the clock cycle as well as at least a portion of the opcode byte of the first branch instruction 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 LO 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 in the previous clock cycle (either the target address or the sequential address from the previous clock cycle, depending 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 correspondmg to the target address fetched from LO I-cache 16 is predicted taken, then prefetch control unit 50 selects the mstruction ran provided by select next block 52C. On the other hand, if the branch mstraction is predicted not taken, then the mstraction ran selected by select next block 52B is selected. The mstraction run provided by select next block 52A is selected if a predicted fetch address missed L0 I-cache 16 m a previous clock cycle and was fetched from LI I-cache 14 Additionally, the mstraction run from LI I- cache 14 is selected if the mstruction run was prefetched responsive to a branch mstruction have a 32 bit displacement or indirect target address generation or an L0 I-cache miss was fetched. The selected mstraction ran is provided to mstruction scanner 56 and branch scanner 58. Instraction scanner 56 scans the predecode mformation correspondmg to the selected instruction ran to identify mstractions withm the mstraction run. More particularly m one embodiment, mstruction scanner 56 scans the start bits correspondmg to each ran section m parallel and identifies up to five mstructions withm each ran section Pomters to the identified mstructions (offsets withm the run section) are generated. The pomters, mstraction bytes, and addresses (one per run section) are conveyed by instruction scanner 56 to mstraction queue 20. If a particular ran section mcludes more than five instructions, the mformation correspondmg to ran sections subsequent to the particular run section is invalidated and the particular ran section and subsequent run sections are rescanned duπng the next clock cycle. Branch scanner 58 scans the mstraction run m parallel with mstruction scanner 56 Branch scanner 58 scans the start bits and control transfer bits of the mstraction ran to identify the first two branch mstructions withm the mstraction run. As described above, a branch mstruction is identified by the control transfer bit correspondmg to the start byte of an mstraction (as identified by the start bit) bemg set. Upon locatmg the first two branch instructions, branch scanner 58 assumes that the mstructions are relative branch instructions and selects the correspondmg encoded target addresses from the mstruction bytes following the start byte of the branch mstraction. For embodiments employmg the x86 instruction set, a nine bit target address (the displacement byte as well as the correspondmg 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 instruction (determined from the fetch address of the run section mcludmg each branch mstruction and the position of the branch mstruction withm the section) are routed to branch history table 60 for selecting a taken/not-taken prediction correspondmg 14 to each branch mstruction. Furthermore, the fetch addresses correspondmg to each branch mstruction are routed to branch select mux 62, which is further routed to indirect address cache 66. The target address of each branch mstraction 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 scanner 58 may further be configured to determine if a subroutme call mstraction is scanned duπng a clock cycle. Branch scanner 58 may forward the fetch address of the next mstruction following the detected subroutme call mstraction to return stack 64 for storage therem. In one embodiment, if there are more than two branch mstractions withm a ran, the ran 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 mstraction. Branch history table 60 compnses a plurality of taken/not-taken predictors corresponding to the previously detected behavior of branch mstractions. 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 correspondmg 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 correspondmg to the second branch mstruction is dependent upon the prediction of the first branch mstruction (for exclusive ORing with the least significant bit of the correspondmg fetch address). Branch history table 60 provides the second predictor by selectmg both of the predictors which might be selected (i.e. the predictor that would be selected if the first branch instruction is predicted not-taken and the predictor that would be selected if the first branch mstraction is predicted taken) and then selectmg one of the two predictors based on the actual prediction selected for the first branch instruction. Branch history table 60 receives information regardmg the execution of branch mstructions from functional units 32A-32D. The history of recent predictions correspondmg to the executed branch mstraction as well as the fetch address of the executed branch mstruction are provided for selectmg a predictor to update, as well as the taken/not taken result of the executed branch mstruction. Branch history table 60 selects the correspondmg predictor and updates the predictor based on the taken/not taken result. In one embodiment, the branch history table stores a bimodal counter. The bimodal counter is a saturating counter which saturates at a minimum and maximum value (i.e. subsequent decrements of the minimum value and mcrements of the maximum value cause no change m the counter). Each tune a branch mstruction is taken, the correspondmg counter is mcremented and each tune a branch mstraction is not taken, the correspondmg 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 embodunent, branch history table 60 stores 64K predictors and mamtams a history of the 16 most recent predictions. Each clock cycle, the predictions selected during 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 correspondmg to detected subroutme call 15 mstractions. Return stack 64 receives the fetch address of a subroutme call mstruction from branch scanner 58 The address of the byte following 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 mstraction is detected by branch scanner 58 and prefetch control unit 50. In this manner, each return mstraction receives as a target address the address correspondmg to the most recently detected call mstruction. Generally m the x86 mstraction set, a call mstruction is a control transfer mstraction which specifies that the sequential address to the call mstruction be placed on the stack defined by the x86 architecture. A return mstraction is an mstruction which selects the target address from the top of the stack. Generally, call and return mstractions are used to enter and exit subroutmes withm a code sequence (respectively). By placmg addresses correspondmg to call instructions m return stack 64 and usmg the address at the top of return stack 64 as the target address of return mstructions, the target address of the return mstraction may be correctly predicted. In one embodiment, return stack 64 may compnse 16 entnes. Indirect address cache 66 stores target addresses correspondmg to previous executions of indirect branch mstractions. The fetch address correspondmg to an mdirect branch mstruction and the target address correspondmg to execution of the mdirect branch mstraction are provided by functional units 32A-32D to indirect address cache 66. Indirect address cache 66 stores the target addresses mdexed by the correspondmg 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 correspondmg target address to prefetch control unit 50 In one embodiment, indirect address cache 66 may compnse 32 entnes. According to one contemplated embodiment, if indirect address cache 66 detects a miss for a fetch address, indirect address cache 66 may be configured to select a target address to provide from one of the entnes. In this manner, a "guess" at a branch target is provided m case an indirect branch mstruction is decoded. Fetchmg from the guess may be performed rather than awaitmg the address via execution of the mdirect branch instruction. Alternatively, another contemplated embodiment awaits the address provided via execution of the mdirect branch mstraction. Accordmg to one embodiment, prefetch control unit 50 selects the target address for fetching from L0 I- cache 16 from: (l) the first encoded target address correspondmg to the first branch instruction identified by branch scanner 58, (π) 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 corresponding to the first mstraction indicates that the mstraction may be a relative branch mstraction. If the decode mdicates that the mstruction may be a return mstraction, 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 LI 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 in L0 I-cache 16. Additionally, if the second branch mstraction is predicted taken and the first branch mstraction is predicted not taken or the first branch mstruction is a forward branch which does not eliminate the second branch mstruction in the mstraction ran, the second target address correspondmg to the second branch prediction may be used as the target fetch address during the 16 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 LO I-cache 16. Prefetch control unit 50 may be configured to precalculate each of the possible above/below target addresses and select the correct address based on the encoded target address. Alternatively, prefetch control unit 50 may record which LO 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 mstraction run of each selected branch mstraction as well as the taken/not taken predictions. Forward collapse unit 68 determines which instructions withm the run should be cancelled based upon the received predictions. If the first branch mstraction is predicted taken and is backward (i.e. the displacement is negative), all mstractions subsequent to the first branch instruction are cancelled. If the first branch mstruction is predicted taken and is forward but the displacement is small (e.g. withm the instruction run), the mstructions which are between the first branch mstruction and the target address are cancelled. The second branch mstraction, if still withm the run accordmg to the first branch instruction's prediction, is treated similarly Cancel mdications for the mstractions withm the run are set to mstraction queue 20. Prefetch control unit 50 may be further configured to select a cache lme withm L0 I-cache 16 for replacement by a cache lme provided from LI I-cache 14 In one embodiment, prefetch control unit 50 may use a least recently used (LRU) replacement algonthm 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 in Fig 3, lookahead/collapse unit 24 includes 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 instructions from alignment unit 22. Decode units 70A-70F are coupled to provide decoded instructions to FPU/multimedia unit 40, ESP/EBP lookahead unit 72, future file 26, and lookahead address/result calculation unit 74. ESP/EBP lookahead unit 72 is coupled to lookahead address/result calculation umt 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 mstraction wmdows 30. Each decode unit 70A-70F forms an issue position to which alignment unit 22 aligns an mstruction 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 mstraction wmdows 30A-30B if not completed withm lookahead/collapse unit 24. Decode units 70A-70F route FPU/multimedia instructions to FPU/multimedia umt 40. However, if the FPU/multimedia mstractions 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 instruction wmdows 30A-30B. Still further, entnes withm reorder buffer 28 are allocated to the FPU/multimedia mstractions for mamtenance of 17 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: (1) whether or not the mstraction 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 destmation operand). Indications of these determinations are provided by decode units 70A-70F to ESP/EBP lookahead umt 72. ESP/EBP lookahead unit 72 generates lookahead mformation for each mstraction which uses the ESP or EBP registers as a source operand. The lookahead mformation may mclude a constant to be added to the current lookahead value of the correspondmg register and an mdication of a dependency upon an instruction m a prior issue position. In one embodiment, ESP/EBP lookahead unit 72 is configured to provide lookahead mformation as long as the set of concurrently decoded mstractions provided by decode units 70A-70F do not mclude more than: (I) two push operations (which decrement the ESP register by a constant value); (n) two pop operations (which mcrement ESP register by a constant value); (in) one move to ESP register; (IV) one anthmetic/logical mstruction havmg the ESP as a destmation; or (v) three mstractions 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 restnctions until the succeedmg clock cycle (a "split lme" case) For those mstractions preceded, m the same clock cycle but m earlier issue positions, by mstractions which mcrement or decrement the ESP register, ESP/EBP lookahead unit 72 generates a constant mdicatmg the combmed total modification to the ESP register of the precedmg mstructions For those mstractions preceded by a move or aπthmetic operation upon the ESP or EBP registers, ESP/EBP lookahead unit 72 generates a value identifying the issue position contammg the move or anthmetic instruction The lookahead values may be used by lookahead address/result calculation unit 74 to generate either a lookahead address coπespondrng to the mstraction 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 correspondmg to the mstraction (thereby providmg lookahead state to future file 26 earlier m the pipelme). Performance may be mcreased by removing address generation operations and/or providmg lookahead state pnor 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 anthmetic/logical operation or simple anthmetic 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 arithmetic/logical operations and branch instructions 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 correspondmg speculative register values or result queue tags for each register operand. Decode units 70 further provide dependency checking between the lme of instructions to ensure that an mstruction which uses a result of an instruction withm a different issue position receives a tag correspondmg to that issue position. 18 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 correspondmg 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 addressing 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 correspondmg result queue tag to load/store unit 36 to allocate storage withm load/store unit 36 for the memory operation. Simple anthmetic operations which increment 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 comprise, for example, an adder for each issue position along with corresponding control logic for selecting among the lookahead values, immediate data, and speculative register values. It is noted that simple anthmetic operations may still be forwarded to instruction windows 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 instructions may be stalled until a new lookahead copy of the ESP/EBP can be provided from future file 26 (after execution of the mstraction which updates ESP/EBP m the undeterminable manner) Dispatch control unit 76 determmes whether or not a group of instructions are dispatched to provide pipelme flow control. Dispatch control unit 76 receives instruction counts from mstraction windows 30 and load/store counts from load/store unit 36 and, assuming the maximum possible number of mstractions are m flight m pipelme stages between dispatch control units 76 and mstruction wmdows 30 and load/store unit 36, determmes whether or not space will be available for stormg the mstractions to be dispatched withm mstraction wmdows 30 and/or load/store unit 36 when the mstractions arπve therem If dispatch control unit 76 determmes 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. 19 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 umt 78 collapses speculatively generated lookahead results mto subsequent, concurrently decoded mstructions which depend upon those results as indicated by the previously determined rntraline dependencies. In this manner, the dependent mstructions receive the speculatively generated lookahead results smce these results will not subsequently be forwarded from functional units 32A-32D. Those mstructions not completed by lookahead address/result calculation unit 74 are then transmitted to one of mstraction wmdows 30A-30B based upon the issue position to which those mstructions were aligned by alignment unit 22. It is noted that certam embodiments of processor 10 may employ a microcode unit (not shown) for executing complex mstructions by dispatchmg a plurality of simpler instructions refened to as a microcode routine. Decode units 70A-70F may be configured to detect which mstractions are microcode mstructions and to route the microcode mstractions to the microcode unit. For example, the absence of a directly decoded mstruction output from a decode unit 70 which received a valid mstruction may be an mdication to the microcode unit to begm execution for the correspondmg valid mstraction. Is further noted that vanous storage devices are shown m Figs. 2 and 3 (e.g. devices 79A, 79B, and similar devices m Fig. 2 and devices 79C, 79D and similar devices m Fig. 3). The storage devices represent latches, registers, flip-flops and the like which may be used to separate pipeline stages. However, the particular pipelme stages shown m Figs. 2 and 3 are but one embodiment of suitable pipeline stages for one embodiment of processor 10 Other pipelme stages may be employed m other embodiments. It is noted that, while the x86 mstraction 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 herem). Furthermore, while cache line fetchmg may be descπbed herem, it is noted that cache lmes may be sectors, and sectors may be fetched, if desirable based upon cache lme size and the number of bytes desned to be fetched Tummg now to Fig. 4, a block diagram of one embodiment of predecode unit 12 is shown Other embodiments are possible and contemplated. As shown m Fig. 4, predecode unit 12 mcludes an mput mstraction 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 mstruction bytes register 92, and a byte select mux 94. Input mstruction bytes register 80 is coupled to byte predecoder 84, control unit 86, target generator 88, byte select mux 94, and external mterface unit 42. Fetch address register 82 is coupled to LI 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 LI 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 mstruction bytes register 92. Output mstruction bytes register 92 and start and control transfer bits register 90 are further coupled to LI I-cache 14 Upon detection of an LI I-cache miss, predecode unit 12 receives the lmear fetch address correspondmg to the miss mto fetch address register 82. In parallel, external mterface unit 42 receives the coπesponding 20 physical fetch address and initiates an external fetch for the cache lme identified by the fetch address. External interface unit 42 provides the received mstraction bytes to mput mstraction bytes register 80. Byte predecoder 84 predecodes the received mstruction bytes to generate correspondmg start and control transfer predecode bits. The generated predecode mformation is stored mto start and control transfer bits register 90. Because mstractions can have boundanes at any byte withm the cache lme due to the vaπable length nature of the x86 mstraction set, byte predecoder 84 begms predecodmg at the offset withm the cache lme 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 mstraction (i.e. the correspondmg start bit is set). Byte predecoder 84 predecodes each byte beginning with the first byte to determine the beginning of each mstraction and to detect branch mstractions. Branch instructions result m the control transfer bit conespondmg to the start byte of the branch mstraction bemg set by byte predecoder 84. Additionally, byte predecoder 84 informs control unit 86 if the branch mstraction is a relative branch instruction and mdicates the position of the mstruction subsequent to the branch instruction withm the cache lme. In one embodiment, byte predecoder 84 is configured to predecode four bytes per clock cycle in parallel. Responsive to the signal from byte predecoder 84 mdicatmg that a relative branch mstraction has been detected, control unit 86 causes target generator 88 to generate the target address correspondmg to the relative branch mstruction The displacement byte or bytes are selected from the mstraction 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 mstraction subsequent to the branch mstraction) is provided to target generator 88. Target generator 88 adds the received address and displacement byte or bytes, thereby generatmg 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 mstraction bytes register 92 mstead of the conespondmg displacement bytes of the relative branch mstraction from input mstruction bytes register 80 Other mstruction bytes are selected from input mstruction bytes register 80 for storage in output mstraction 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 mstraction has had its displacement replaced by an encodmg of the target address, control unit 86 asserts a predecode complete signal to LI I-cache 14, which then stores the output instruction bytes and conespondmg start and control transfer bits As descnbed above, for relative branch instructions 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 appropnate control transfer bit, which byte predecoder 84 stores in the conespondmg position withm start and control transfer bits register 90. It is noted that, if a relative branch mstraction spans the boundary between two cache lmes (i.e. a first cache lme stores a first portion of the mstraction 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 instruction. It is further noted that predecode unit 12 may be configured to handle multiple outstandmg cache lmes simultaneously. 21 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 mcludes a displacement mux 100, a sign extend block 102, an adder 104, and a displacement encoder 106. Displacement mux 100 is coupled to input mstraction 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 withm the cache lme 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 mstraction. In the present embodiment, displacements may be one or four bytes. Accordmgly, displacement mux 100 selects four bytes from mput mstruction bytes register 80. If a one byte displacement is mcluded m the relative branch mstruction, the displacement is selected mto the least significant of the four bytes. The remammg three bytes may be zeros or may be pnor bytes withm mput mstruction bytes register 80. Sign extend block 102, under control from control umt 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 that larger addresses may be employed by processor 10. Generally, the displacement may be sign extended to the number of bits withm the address. Displacement encoder 106 receives the target address calculated by adder 104 and encodes the target address into a format storable mto 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 m output mstraction bytes register 92. Additionally, the control transfer bits correspondmg 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 withm the target cache lme (e.g. m the present embodiment, 6 bits to store a 64 byte offset). The remammg portion of the displacement byte and the conespondmg control transfer bit is encoded with a value mdicatmg the target cache lme as a number of cache lmes above or below the cache lme identified by the fetch address stored m fetch address register 82. Accordmgly, 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 lmes therebetween, but the direction. Upon generating the encodmg, displacement encoder 106 transmits the modified displacement byte to byte select mux 94 for storage m output mstraction bytes register 92 and also transmits the value for the control transfer bit conespondmg 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 lme offset) by examining the value of the displacement field and the position of the branch mstraction withm the cache lme. 22 Turning now to Fig. 5, a diagram illustratmg an exemplary relative branch mstruction 110 havmg an eight bit displacement accordmg to the x86 mstruction set is shown. Relative branch mstraction 110 mcludes 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 mstraction 110 is a relative branch instruction and that the instruction has an eight bit displacement. Displacement byte 114 has been updated with an encodmg of the target address. The encodmg includes a cache line offset portion labeled "CL offset" (which compnses six bits m the cunent embodiment but may compnse any number bits suitable for the conespondmg mstruction cache lme 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 mstraction 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 begmnmg of an mstraction and the control transfer bit conespondmg to opcode byte 112 is also set to mdicate that the mstraction begmnmg 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 begmnmg of an mstraction. 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 mstraction 120 havmg a 32-bit displacement accordmg to the x86 mstraction 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 instruction 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 begmnmg of an mstraction. The first control transfer bit conespondmg to opcode field 122 is also set mdicatmg that mstraction 120 is a control transfer instruction. 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 (indicated 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 mstraction. Turning now to Fig. 7, a diagram of an exemplary set of mstractions 130 from the x86 mstraction set are shown, further illustratmg 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 instructions 130 is illustrated along with a conespondmg start bit and control transfer bit. 23 The first mstraction 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 stormg the result m the AL register. The add mstruction is a two byte mstraction in 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 begmnmg of the instruction. 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 mstraction, and the control transfer bit is a don't care. Subsequent to the add mstraction is a single byte instruction (an mcrement of the EAX register). The start bit conespondmg to the mstraction set because the byte is the begmnmg of instruction. The control transfer bit is clear smce the mcrement is not a branch mstruction. Finally, a second add mstraction specifymg the addition of a one byte immediate field to the contents of the AL register is shown subsequent to the increment mstraction. The start bit conespondmg to the opcode of the add mstraction is set, and the control transfer bit is clear. The mcrement mstraction followed by the add mstraction 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 mstraction set. Other embodiments are possible and contemplated In the embodunent 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 ran section from select next blocks 52 through mstraction 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 remammg ran sections of the selected ran. 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 ran sections) provide selection controls for ran target muxes 144A-144D. Each of section target muxes 142A-142B is coupled to receive the mstraction 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 mstraction bytes conespondmg to the ran 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 ran target muxes 144A-144D as shown m Fig. 8. The outputs of run target muxes 144 A and 144B are coupled to prefetch control unit 50 and to branch history table 60. The outputs of ran 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 m order to locate the first two branch mstractions withm the ran section. If a first branch mstraction is identified withm the ran section, scan block 140 directs section target mux 142 A 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 mstraction mcludes an eight bit relative displacement Similarly, if a second branch mstraction is identified withm the run section, scan block 140 directs section target mux 142B to select the opcode byte of the second branch mstraction and the immediately succeedmg byte and the control transfer bit conespondmg to the 24 immediately succeedmg byte. In this manner, the opcode byte and target address conespondmg to the first two relative branch mstractions havmg eight bit displacement are selected Additionally, the position of each branch mstraction withm the ran 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 mstraction. More particularly, scan block 140 selects the four consecutive instruction bytes begmnmg with the second byte following the start byte of the first branch mstraction (i.e. begmnmg with the byte two bytes subsequent to the start byte of the first branch mstruction withm the cache lme). These consecutive mstraction 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 begmnmg with the second byte following the start byte of the second branch mstraction. In this manner, the target address conespondmg to the first two relative branch mstractions havmg 32-bit displacements are selected. Prefetch control unit 50 is configured to determine whether or not either: (l) the target address selected by section target mux 142A; (n) the target address selected by section target mux 142C; or (in) a target address from return stack 64 or indirect address cache 66 conesponds to the first branch mstraction Similarly, prefetch control unit 50 is configured determine 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 indirect address cache 66 conesponds to the second branch mstruction. Scan block 140, m conjunction with similar scan blocks for the other sections of the ran, controls run target muxes 144A-144D to select target mformation conespondmg to the first two branch mstractions withm the ran. Accordmgly, ran target mux 144A selects the target address (i.e. the immediately succeedmg byte and conespondmg control transfer bit), opcode, and position of the first branch mstraction withm the ran. Similarly, ran target mux 144B selects the target address, opcode, and position of the second branch mstraction withm the ran. Run target muxes 144C-144D select 32-bit target addresses conespondmg to the first and second branch mstractions, 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 mcludes a decoder 150, a fetch address mux 152, an mcrementor 154, and an LI prefetch control unit 156. Decoder 150 is coupled to receive the first branch opcode conespondmg to the first branch mstraction withm the ran from branch scanner 58 and to reorder buffer 28 to receive a misprediction redirection mdication and conespondmg conected fetch address Additionally, decoder 150 is coupled to fetch address mux 152 and LI prefetch control unit 156. Fetch address mux 152 is coupled to receive the first target address conespondmg to the first branch mstraction within the ran as selected by ran target mux 144 A. 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 redirection, 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 LI prefetch control unit 156. LI prefetch control unit 156 is further coupled to L0 I-cache 16 to receive a miss mdication, to mdirect address cache 66 to receive a predicted 25 mdirect target address, to branch scanner 58 to receive 32-bit target addresses conespondmg to relative branch mstructions, to reorder buffer 28 to receive branch misprediction addresses, and to LI I-cache 14 to provide an LI prefetch address. Prefetch control unit 50 provides a sequential fetch address to LO I-cache 16 via a register 158. Decoder 150 is configured to decode the opcode conespond to the first identified branch mstraction from branch scanner 58 m order to select the target fetch address for LO 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, descπbed m more detail below, is a trath 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 mstractions may be discarded and the conect fetch address may be generated during a subsequent clock cycle. Because the branch prediction conespondmg to the first branch mstraction withm the ran 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 conespondmg to the second identified branch mstraction (if any) may be fetched m a subsequent clock cycle if the second branch mstraction 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 ran, 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 mstractions may be discarded m favor of instructions at the actual branch target LI prefetch control unit 156 generates an LI prefetch address for LI I-cache 14. The cache lme conespondmg to the LI prefetch address is conveyed to L0 I-cache 16 for storage. LI 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, LI prefetch control unit 156 selects the L0 fetch address miss for prefetchmg. If no miss is detected, LI prefetch control unit 156 selects either the uidnect 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, LI 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 lines 26 most recently accessed m response to the code sequence being executed, it may be statistically less likely that the target mstraction sequence is stored m the LO I-cache 16. Incrementor 154 is configured to mcrement the fetch address conespondmg to the ran selected for dispatch based on the branch prediction information received from branch history table 60. Prefetch control unit 50 mcludes logic (not shown) for selectmg the ran, via mstraction select multiplexor 54, based on LO 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 trath table 160 conespondmg to one embodiment of decoder 150 employed withm one embodunent 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 in 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 bemg 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 conespondmg 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 mstraction 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 ran target mux 144 A and, if further decode mdicates that a 32-bit displacement field is mcluded m the branch mstraction, the mstructions fetched m response to the selection are discarded and the conect fetch address is prefetch from LI I-cache 14 via LI prefetch control unit 156 receiving the 32-bit fetch address from branch scanner 58 Finally, branch mstraction opcodes having 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 LI prefetch control unit 156 to select the 32-bit branch target address from branch scanner 58 for prefetchmg from LI I-cache 14. Branch mstruction opcodes havmg the four most significant bits equal to C are return mstractions, and hence the return address provided by return address stack 64 provides the predicted fetch address. On the other hand, branch instruction opcodes havmg the four most significant bits equal to F are call or unconditional jump mstractions which use indirect 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 mstructions fetched m response to the sequential address are discarded and mstractions prefetched from LI I-cache 14 are provided during a subsequent clock cycle. 27 As trath table 160 illustrates, predecode of just a portion of the instruction byte identified by the start and control transfer bits may be used to select a target fetch address for LO I-cache 16. Accordingly, prefetch control unit 50 and branch scanner 58 may support high frequency, single cycle LO 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 in Fig. 10A, it is understood that the steps illustrated may be performed in any suitable order, and may be performed in parallel by combinatorial logic employed within decoder 150. Decoder 150 determines if a branch misprediction is being signalled by reorder buffer 28 (decision block 192). If a misprediction is signalled, the corrected 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 conesponding to the second branch instraction identified during 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 instraction was predicted not-taken and the second branch instraction was predicted taken. Additionally, the second target address may be fetched if the first branch instraction was predicted taken, but was a small forward displacement which does not cancel the second branch instraction, and the second branch instraction 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 in reaching fetch address mux 152 — step 195). Finally, if the second target address is not to be fetched, decoder 150 operates according to truth table 160 described above (step 196). Turning now to Fig. 11, a flowchart is shown illustrating operation of one embodiment of LI prefetch control unit 156. Other embodiments are possible and contemplated. While shown as a serial series of steps in Fig. 11, it is understood that the steps illustrated may be performed in any suitable order, and may be performed in parallel by combinatorial logic employed within LI prefetch control unit 156. If a branch misprediction redirection is received by LI prefetch control unit 156 (decision block 170), the sequential cache line to the cache line conesponding to the conected fetch address is prefetched from LI I- cache 14 (step 172). On the other hand, if a branch misprediction redirection is not received, LI prefetch control unit 156 determines if an L0 I-cache miss has occuned (decision block 174). If an L0 I-cache miss is detected, the address missing L0 I-cache 16 is prefetched from LI I-cache 14 (step 176). In the absence of an L0 I-cache miss, LI prefetch control unit 156 determines if either an indirect 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 indirect address received from indirect address cache 66 or the 32-bit relative target address received from branch scanner 58 is prefetched from LI I-cache 14 (step 180). Finally, if no indirect target address or 32-bit relative target address is signalled, LI prefetch control unit 156 prefetches the next sequential cache line to the cunent target fetch address (step 182). Turning now to Fig. 12, a table 190 is shown illustrating the fetch results conesponding to one embodiment of processor 10 for various target addresses and branch predictions conesponding to the first and second branch instructions identified within an instraction ran. Other embodiments are possible contemplated. As used in table 190, a small forward target is a target which lies within the cunent ran. Conversely, a large 28 forward target is a target which does not lie within the cunent run. A target is forward if the target address is numerically greater than the address of the branch instraction, and backward if the target address is numerically smaller than the address of the branch instruction. The taken/not taken prediction is derived from branch history table 60. As illustrated by the footnote, results conesponding to the second branch prediction may be delayed by a clock cycle according 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 during the subsequent clock cycle. The result column in table 190 lists several results. The term "squash" when used in the result column of table 190 indicates which instractions are deleted from instraction queue 20 via signals from forward collapse unit 68 shown in Fig. 2. Additionally, the target or sequential address to be fetched responsive to the first and/or second branch instractions is indicated followed by parenthetical notation as to which of L0 I-cache 16 (L0 notation) or LI I-cache 14 (LI notation) the target or sequential address is conveyed. Turning next to Fig. 13, a block diagram of one exemplary embodiment of instraction queue 20 is shown. Other embodiments are possible and contemplated. In the embodiment of Fig. 13, instruction queue 20 includes ran storages 300A-300B, scan data storages 302A-302B, and address storages 304A-304B. Additionally, instraction queue 20 includes a mux 306 and a control unit 308. A run of instractions is provided to instruction queue 20 from fetch/scan unit 18 via a ran bus 310; conesponding scan data is provided on a scan data bus 312; and conesponding addresses (one per ran section) are provided on a run addresses bus 314. Instraction queue 20 provides a set of selected instraction bytes to alignment unit 22 on instraction bytes bus 316, pointers to instructions within the instraction bytes on an instruction pointers bus 318, and addresses for the run sections comprising the set of selected instraction bytes on an addresses bus 320. Run bus 310 is coupled to ran storages 300A-300B, while scan data bus 312 is coupled to scan data storages 302A-302B and address storages 304A- 304B are coupled to ran 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 instraction scanner 56 according to the embodiment of Fig. 2, provides a ran of instractions and associated information to instruction queue 20 via buses 310-314. Control unit 308 allocates one of ran storages 300A-300B for the instruction bytes comprising the instraction ran, and a conesponding scan data storage 302A-302B and address storage 304A-304B for the associated information. The scan data includes instruction pointers which identify: (i) the start byte and end byte as offsets within a ran section; as well as (ii) the ran section within which the instraction resides. According to one particular embodiment, up to five instractions may be identified within an eight byte ran section, and there are up to three run sections in a ran for a total of up to 15 instractions pointers stored within a scan data storage 302. Additionally, address storages 304 store an address conesponding to each run section. Control unit 308 examines the instractions pointers within scan data storages 302A-302B to identify instructions within a set of contiguous run sections for dispatch to alignment unit 22. In one particular embodiment, up to six instructions are identified within up to four contiguous run sections. The ran sections may be stored in one of run storages 300A or 300B, or some ran sections may be selected from one of ran storages 29 300A-300B and the other run sections may be selected from the other one of run storages 300A-300B. A first ran section is contiguous to a second ran section if the first ran section is next, m speculative program order, to the second ran section. It is noted that mux 306, while illustrated as a smgle mux m Fig. 13 for simplicity m the drawing, may be implemented by any suitable parallel or cascaded set of multiplexors. Control umt 308 provides a set of selection signals to mux 306 to select the set of run sections mcludmg the selected mstractions, as well as the mstraction pomters conespondmg to the selected mstractions. Additionally, the address for each selected run section is selected. The ran sections are provided upon mstruction bytes bus 316, while the conespondmg mstruction pomters and addresses are provided upon mstraction pomters bus 318 and addresses bus 320, respectively. Tummg next to Fig. 14, a block diagram of one embodiment of future file 26 and reorder buffer/register file 28 is shown m 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 mstractions are decoded by decode units 70 withm lookahead/collapse unit 24, the register source operands of the mstractions 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 mstraction generatmg the most cunent value has executed, or a reorder buffer tag identifying the mstraction which will generate the most cunent value, upon source operands buses 332. Additionally, one of the source operands may be mdicated to be a destmation operand. Future file 26 updates the location conespondmg to the destmation register with the reorder buffer tag to be assigned to the conespondmg mstraction 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 mstractions. Subsequent mstractions 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 in 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 determine whether or not the mstraction 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. 30 Future file 26 is coupled to register file 28 A to receive a copy of the architected registers stored therein when an exception branch misprediction is detected and retired. Reorder buffer 28B may detect exceptions and branch mispredictions from the results provided upon result buses 48, and may signal register file 28A and future file 26 if a copy of the architected registers as retired in register file 28A is to be copied to future file 26. For example, upon retiring an instruction having an exception or branch misprediction, the copy may be performed. In this manner, future file 26 may be recovered from inconect speculative execution. Reorder buffer 28B receives the dispatched instractions from lookahead/collapse unit 24 via dispatched instructions bus 336. The dispatched instractions may be provided to reorder buffer 28B upon a determination by dispatch control unit 76 that instractions are to be dispatched. Additionally, reorder buffer 28B receives execution results upon results buses 48 and retires the results, in program order, to register file 28A. Turning now to Fig. 15, a block diagram of one embodiment of a computer system 200 including 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 main memory 204 is coupled to bus bridge 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 interface 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 interface 46. Bus bridge 202 provides an interface between processor 10, main 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 bridge 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 bridge 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 providing an interface to an ISA/EISA bus for PCI bus 214, secondary bus bridge 216 may further incorporate additional functionality, as desired. For example, in one embodiment, secondary bus bridge 216 includes a master PCI arbiter (not shown) for arbitrating ownership of PCI bus 214. An input/output controller (not shown), either external from or integrated with secondary bus bridge 216, may also be included within computer system 200 to provide operational support for a keyboard and mouse 222 and for various serial and parallel ports, as desired. An external cache unit (not shown) may further be coupled to bus interface 46 between processor 10 and bus bridge 202 in other embodiments. Alternatively, the external cache may be coupled to bus bridge 202 and cache control logic for the external cache may be integrated into bus bridge 202. Main memory 204 is a memory in which application programs are stored and from which processor 10 primarily executes. A suitable main memory 204 comprises 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 interface cards, video accelerators, audio cards, hard or floppy disk drives or drive controllers, SCSI (Small Computer Systems Interface) adapters and telephony cards. Similarly, ISA device 218 is illustrative of various 31 types of peripheral devices, such as a modem, a sound card, and a variety of data acquisition cards such as GPIB or field bus interface cards. Graphics controller 208 is provided to control the rendering of text and images on a display 226. Graphics controller 208 may embody a typical graphics accelerator generally known in the art to render three- dimensional data structures which can be effectively shifted into and from main memory 204. Graphics controller 208 may therefore be a master of AGP bus 210 in that it can request and receive access to a target interface within bus bridge 202 to thereby obtain access to main memory 204. A dedicated graphics bus accommodates rapid retrieval of data from main memory 204. For certam operations, graphics controller 208 may further be configured to generate PCI protocol transactions on AGP bus 210. The AGP interface of bus bridge 202 may thus include 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 includes 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 in the above description, any bus architectures may be substituted as desired. It is further noted that computer system 200 may be a multiprocessing computer system including 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 in Fig. 15) or may be connected to bus bridge 202 via an independent bus. In accordance with the above disclosure, a processor has been shown which provides for fetching long runs of instraction bytes from an instraction cache to provide large numbers of instractions to the wide issue superscalar core therein. The processor is capable, in one embodiment, of predicting up to two branch instructions per clock cycle and identifying up to 15 instractions within an instruction ran per clock cycle. Advantageously, instractions may be provided to the wide issue superscalar core to make use of the ability to issue multiple instractions concunently. Numerous variations and modifications will become apparent to those skilled in 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. 32

Claims: WHAT IS CLAIMED IS: 1 A processor compπsmg: a predecode unit configured to generate predecode mformation correspondmg to a plurality of mstraction bytes received by said processor, said predecode mformation mcludmg a first mdication correspondmg to a particular mstruction byte withm said plurality of mstraction bytes, wherem said first mdication is indicative, m a first state, that said particular mstraction byte is a boundary of an mstraction, and wherem said predecode mformation mcludes a control transfer mdication conespondmg to said particular mstraction byte, and wherem said control transfer mdication is indicative, m a first state, that said mstraction of which said particular mstraction byte is said boundary is a control transfer mstraction; and an mstraction cache coupled to said predecode unit, wherein said mstruction cache is configured to store said plurality of mstruction bytes and said predecode mformation received from said predecode umt. 2. The processor as recited m claim 1 wherem said mstruction is said control transfer mstruction only if said first mdication is m said first state m conjunction with said control transfer mdication bemg m said first state. 3. The processor as recited m claim 2 wherem said first mdication bemg in said first state is indicative that said particular mstraction byte is a start of an mstraction 4 The processor as recited m claim 3 wherem said first mdication is a bit and said first state is the bit bemg set 5. The processor as recited m claim 4 wherem said control transfer mdication is a bit and said first state is the bit bemg set 6 The processor as recited m claim 1 wherein said predecode mformation compnses a plurality of said first mdications and a plurality of said control transfer mdications 7. The processor as recited m claim 7 wherem a number of said plurality of first mdications and a conespondmg number of said control transfer mdications is equal to a number of said plurality of mstruction bytes 8. The processor as recited m claim 7 wherem a particular one of said control transfer mdications m not indicative of said control transfer instruction if a conespondmg one of said first mdications is not m said first state. 33 9. The processor as recited in claim 1 wherem said plurality of mstraction bytes is a cache lme of mstruction bytes. 10. A predecode unit compπsmg. a storage device configured to store a plurality of mstraction bytes received from a memory; and a decoder configured to decode said plurality of mstraction bytes to generate predecode mformation conespondmg thereto, said predecode mformation mcludmg a boundary mdication identifymg a boundary of each mstruction withm said plurality of mstruction bytes and a control transfer mdication identifymg which mstractions withm said plurality of mstruction bytes are control transfer mstractions. 11. The predecode unit recited m claim 10 wherem said boundary indication compnses a first plurality of mdications and said control transfer mdication compnses a second plurality of mdications wherem each one of said second plurality of mdications conesponds to a different one of said first plurality of mdications 12. The predecode unit as recited m claim 11 wherein each one of said first plurality of mdications conesponds to a different one of said plurality of instruction bytes 13. The predecode unit as recited m claim 12 wherein a particular mstruction withm said plurality of mstraction bytes is a control transfer mstraction if a particular one of said first plurality of mdications which conespond to said particular mstraction is m a first state identifymg said boundary of said particular mstruction and a particular one of said second plurality of mdications conespondmg to said particular one of said first plurality of mdications mdicates that said particular mstruction is said control transfer instruction. 14. The predecode unit as recited in claim 13 wherem each one of said second plurality of mdications depends upon a conesponding one of said first plurality of mdications bemg in said first state to identify said control transfer mstraction 15. A method for rapid control transfer mstraction detection, the method compnsmg- predecodmg a plurality of mstruction bytes to generate an mstruction boundary mdication and a control transfer mdication conespondmg to each of said plurality of mstraction bytes, wherem said mstraction boundary indication mdicates whether or not a conespondmg one of said plurality of mstraction bytes is a boundary of an mstraction, and wherem, if said correspondmg one of said plurality of mstraction bytes is said boundary of said mstruction, said control transfer mdication mdicates whether or not said mstruction is a control transfer mstraction; and 34 scanning said instraction boundary indications and said control transfer indications upon fetching said plurality of instruction bytes to identify control transfer instructions therein. 16. The method as recited in claim 15 wherein said control transfer indication conesponding to a particular one of said plurality of instruction bytes indicates an alternate feature of said instraction including said particular one of said plurality of instraction bytes if said instraction boundary indication conesponding to said particular one of said plurality of instruction bytes indicates that said particular one of said plurality of instraction bytes is not said boundary. 17. The method as recited in claim 16 wherein said boundary is a start of said instraction. 18. The method as recited in claim 15 further comprising storing said predecode information and said plurality of instraction bytes in a instraction cache prior to said fetching said plurality of instraction bytes. 19. A computer system comprising: a processor configured to generate predecode information conesponding to a plurality of instraction bytes received by said processor, said predecode information including a first indication corresponding to a particular instraction byte within said plurality of instraction bytes, wherein said first indication is indicative, in a first state, that said particular instraction byte is a boundary of an instraction, and wherein said predecode information includes a control transfer indication conesponding to said particular instraction byte, and wherein said control transfer indication is indicative, in a first state, that said instraction of which said particular instraction byte is said boundary is a control transfer instraction; a memory coupled to said processor, wherein said memory is configured to store said plurality of instruction bytes and to provide said plurality of instraction 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. 20. The computer system as recited in claim 19 further comprising a second processor configured to generate said predecode information correspondmg to said plurality of instraction bytes received by said second processor. 35

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