A pipeline having an integral cache for computer processors

Abstract: A load/store pipeline in a computer processor for loading data to registers and storing data from the registers has a cache memory within the pipeline for storing data. The pipeline includes buffers which support multiple outstanding read request misses. Data from out of the pipeline is obtained independently of the operation of the pipeline, this data corresponding to the request misses. The cache memory can then be filled with the requested for data. The provision of a cache memory within the pipeline, and the buffers for supporting the cache memory, speed up loading operations for the computer processor.

Description: Field of the Invention The present invention relates to the field of computer processors, and specifically, to an apparatus for loading data entries to registers, and storing data entries from these registers. Background of the Invention The operations of many modern processors are pipelined so as to improve the speed of the processor. Thus, a second load operation will enter a load/store pipeline before a first operation will pass completely through the pipeline. Typically, a cache memory which loads data to a register or stores data from the register is outside of the load/store pipeline. When an operation is passing through the load/store pipeline, the cache memory will be accessed. If the proper data is in the cache memory at the correct address, a hit is returned, and the data is loaded to the register and the pipelining of operation continues. When requested data is not in the cache memory, a miss is returned and the data must be fetched from the main memory over an external bus. Until the miss is serviced such that the data is retrieved from main memory and loaded to the cache, the pipeline is stalled. Since a retrieval from main memory can be relatively slow compared to the pipeline operation, if there are many cache misses, the load/store operation will be dominated by the servicing of those misses. This loses the performance advantages sought by pipelining. Vector processors are designed to operate on arrays of information in an extremely fast manner. These vector processors typically include a vector register file that is a data store, which is coupled to arithmetic units which operate on the data stored in the vector register file. Data is loaded into the vector register file from a memory, such as a cache memory. The cache memory can also receive and store data from the vector register file. The cache memory itself receives data from a large, main memory, which is typically coupled by a bus to the vector processor. When data is to be loaded into the vector register file, a load/store pipeline accesses the cache memory for the data elements and sends them over a bus to the vector register file. Scalar processors in which instructions are pipelined would also benefit from the use of a cache which is integral to the pipeline. Again, the problem of multiple cache misses can cause the pipeline to be dominated by the servicing of those misses. US-4,345,309 describes a cached multiprocessor system which operates in an ordered pipeline timing sequence in which the time slot for use of the cache is made long enough to permit only once cache access. Transactions that require two cache accesses must complete the second cache access during a later available pipeline sequence. US-4,354,282 purports to describe a computer system with a system interface unit for controlling data transfers between a lower speed main memory and either a central processor unit or a high-speed cache memory unit. EP-0 192 578 A2 purports to describe a microprocessor system architecture having a high-speed system bus for coupling system elements thereto for high speed communications. The system includes a dual bus microprocessor having separate ultra-high speed instruction and data cache interfaces coupled to independently operable instruction and data caches. Summary of the Invention The present invention retains the pipeline advantages by including a distributed cache within the pipeline, rather than have the cache be outside the pipeline. This is achieved by providing the load/store pipeline as described in claim 1. The loading and storing requests to the cache memory are pipelined. By providing such a distributed cache within the pipeline itself, a greater speed in the loading or storing of data in the cache can be obtained. In order to service possible misses in the cache during load operations, certain embodiments of the invention provide read miss buffers. Such an arrangement is particularly advantageous when used in vector processors, since the data elements of an array being loaded into a cache during a vector load operation are not related to one another. Thus, when one of the data elements is a miss, this miss can be serviced at the same time as the pipelined loading of the remaining data elements continues. In other words, the pipeline does not have to stall while the misses are being serviced. The only limitation to the number of read misses which can be serviced before the pipeline must be stopped to fill the cache, is the number of read miss buffers which are used or the number of simultaneous operations that can be supported by the system. The present invention does not attempt to load a single data element as fast as possible. Rather, since the individual elements are not related to one another for purposes of a load operation, speed for the total load is maximised. Again, this is done by continuing to pipeline and load data in the data cache and service misses in a parallel operation. This is done instead of stopping the pipeline to service a miss, which would be the fastest way to load an individual element. When the cache is part of a pipeline in a scalar processor, the above holds true, i.e., the speed of the overall operations is maximized instead of the speed of operation on a single instruction. Brief Description of the Drawings Figure 1 is a block diagram of an embodiment of a load/store pipeline constructed in accordance with the invention. Figures 2-4 show reconfigurations of the embodiment of Figure 1 to illustrate the timing in a load operation, a cache fill operation and a store operation. Figures 5-11 show examples of timing diagrams for exemplary load/store operations using the pipeline shown in Figure 1. Figure 12 shows an embodiment of the present invention for use in a scalar processor. Figure 13 is an example of a nonaligned hexaword. Detailed Description An embodiment of the present invention used with a vector processor is illustrated in Figure 1. A load/store pipeline 8 for the processor has five stages. These stages manage pipe entries propagating through the pipeline. An address generator 10 receives commands from a vector controller 6 and generates from these commands pipe entries. A pipe entry contains all of the information needed to initiate a transaction between processors or a processor and main memory such as address, element number, byte mask, validity bit, etc. Such transactions are carried out over an external bus 50. Specifically, an exemplary embodiment of a pipe entry will contain the following bits. Kind bits 〈2:0〉 tell each of the five stages what mode to be in for that particular pipe entry. These modes include the "normal" mode (either a load or a store), an invalidate mode, or a read (fill) mode. Element bits 〈5:0〉 define which element is being loaded or stored. A valid bit informs as to the validity of the pipe entry. A last bit tells when the pipe entry is the last pipe entry of an instruction. The "don't cache" bit is used in cache fills, and causes the pipeline to not validate the cache, but just put the element into a vector register file. The physical address bits 〈29:0〉 correspond to the physical address of the data element in the main memory. Longword mask bits 〈7:0〉 contain the information needed to know which elements within a hexaword (to be defined later) are to be loaded or stored. The pipe entry from the address generator 10 contains a virtual address. A translation buffer 12 receives the virtual address and translates it into a physical address. From the translation buffer 12, the pipe entry (which now contains a physical address) enters a cache tag look up stage 14. This look up stage 14 parses the physical address into a cache index and tag compare data. The lookup stage 14 sends the cache index of a cache location to a tag store 34. The tag store 34 is a store of tags for entries in a data cache 38. The tag is made up of a portion of the bits of a physical address. Each block of data in the data cache 38 has an associated tag. The tag portion of the physical address (the tag compare data) is compared with the tag data (located in the tag store 34) for the cache location accessed by this physical address. The comparison is done by a comparator 16. A hit signal is output by the comparator 16 if the tags match, while a miss signal is output if they do not match. The cache index has also been sent by the cache tag look up stage 14 to the data cache 38. In order to know the results of the tag comparison before a decision to write to the data cache 38 is made, a delay stage 35 is interposed between the cache tag look up stage 14 and the data cache 38. The pipe entry and a hit or miss signal is then sent to the cache data storage stage 18. At this time, the data cache 38 has the physical address of a cache location and will either read data from or write data to that location, as long as there is a hit signal at the cache data storage stage 18. The data cache 38 is connected to a cache data bus 40 via a latch 19. Vector register files 42 which use the data from the cache 38 are also coupled to the cache data bus 40. When the tags are matched by the tag comparator 16, a hit signal is generated and the data is either driven by the cache data storage stage 18, from latch 19 coupled to the data cache 38 onto the cache data bus 40, or is driven from a vector register file 42 onto the cache data bus 40 to be stored in the data cache 38. If the tags do not match, the data is still driven but it is ignored by the data cache 38 or the register file 42. A pipeline entry propagates through one stage every clock cycle, so that a single pipe entry will pass through the pipeline in five cycles. In a vector processor according to the invention, the load/store commands, and hence the pipe entries, are pipelined. This means that a second pipe entry will follow a first pipe entry into the load/store pipeline 8 before the first entry completely passes through the pipeline 8. In the embodiment of Figure 1, the pipelining is such that during the normal course of operation, all of the five stages at any one time can contain successive pipe entries. The load/store pipeline 8 operates in one of three modes, as determined by a load/store controller 52. These modes are the load mode, the store mode and the cache fill mode. In the load mode, data is loaded from the data cache 38 to a vector register 42. During a store mode, data is conditionally stored into the data cache 38 from a vector register 42 depending whether the data misses or hits. The cache fill mode will be described later. The load/store controller sends out signals to the pipeline stages which inform the stages what mode the pipeline is to be in. In order to access each particular location in a vector register file 42, a register file address (RFA) is sent to the vector register file 42 from certain points in the pipeline 8. The RFA is a portion of bits (for example, six) of each pipe entry. With these bits, the vector register file 42 will know where it is to store data coming from the cache 38 in a load operation, or from where data in the file 42 is to be retrieved to send to the cache 38 in a store operation. The points in the pipeline at which the RFA is "tapped" off and sent to a vector register file 42 are different, depending on the type of operation. This is due to the different cache data bus timing required for each operation. The timing for the various operations will be described in more detail later with reference to Figures 2-4. For now, it is sufficient to say that for a store operation, the RFA is tapped off after the address generator stage 10; at the tag comparator stage 16 for a cache fill operation; and after the cache data storage stage 18 for a load operation. The RFA after each of these stages is sent to a multiplexer 51, which selects the appropriate RFA input line depending on a control signal from the load/store controller 2. The appropriate RFA is output by the multiplexer 51 to a delay latch 53 and from there, to the vector register files 42. During a load operation, no problems arise if all of the tags match so that all of the cache requests are hits. However, sometimes there will be cache misses (when the tags do not match), indicating that there is no valid data at the specified physical address in the data cache 38. These cache misses must be serviced so that the requested data can eventually be read from the cache 38. The servicing of a read miss during a load operation includes obtaining the requested data from another processor or main memory via the external bus 50. The requested data is filled into the data cache 38 at the specified physical address and then driven onto the cache data bus 40 to the vector register file 42. The above servicing of a miss can be performed in different ways. A relatively slow method is to stop the pipeline upon a read miss, fetch the data over the external bus 50, fill the data to the cache 38 and then restart the pipeline. Such a method would be used when the cache is not part of the pipeline. The speed of this method is limited by the speed with which the external bus 50 can get the requested data to the cache 38. Until then, no other loads would be performed. The present invention avoids this limitation by servicing a read miss while the pipeline is still operating (performing loads). The invention is implemented using read miss buffers 26a-d. Although four read miss buffers 26a-d are illustrated in Figure 1, any number of read miss buffers could be used. Upon receiving a miss signal during a load operation, the cache data storage stage 18 does not drive data from the cache 38 onto the cache data bus 40. Instead, the cache data stage 18 sends a command address in the pipe entry to an available read miss buffer 26a via a load/store internal command address bus 45. Assuming that successive pipe entries are hits, the loading from the cache 38 continues while the read miss buffer 26a is being filled with data from the main memory via external bus 50 as described below. Each read miss buffer 26a-d contains buffers for holding the command address of the pipe entry and a number of data elements corresponding to that command address, four for example. An external bus controller 58 requests the data elements from main memory for a buffer which receives a command address. As the data elements are received over the external bus 50, the external bus controller 58 fills the data into the data buffers in the corresponding read miss buffer 26a-d. When a read miss buffer 26a-d is completely filled, an internal flag is set, which indicates to the load/store controller 52 that data can be filled to the cache 38. In similar fashion, the other three read miss buffers 26b-d will be serviced when there are three more read misses. It is only after there have been four read misses so that there are no more available read miss buffers that the load/store pipeline 8 is stalled by the load/store controller 52. The load/store controller 52 now causes the pipeline 8 to enter the cache fill mode. Processing is suspended for all the pipe entries currently active in the pipeline. Instead, when the read miss buffer 26a which received the first command address which missed has received the data from the external bus 50, the command address stored in the buffer 26a is sent over the command address bus 45 to the cache tag look up stage 14 and is allocated as valid in the tag store 34, since the pipeline 8 is in the cache fill mode. The load/store controller 52 drives the data from the read miss buffer 26a onto a load/store internal data bus 47, through a latch 20, and onto the cache data bus 40. The data is loaded into the appropriate vector register file 42, as indicated by the cache fill RFA. The data is then written through the latch 19 into the data cache 38. The address generator 10 has backed up to regenerate those pipe entries which followed the pipe entry which caused the last miss, in this case the fourth miss. In the embodiment, the pipeline 8 then continues processing as before since at least one empty read miss buffer 26a-d now exists. The pipeline 8 will again be halted and the above procedures repeated when another read miss occurs so that read miss buffer 26a will again be unavailable. However, instead of filling the cache from the read miss buffer 26a, the read miss buffer, for example 26b, which received the second read miss command address is the buffer which fills the data cache 38. In other words, the read miss buffers 26a-d will fill the data cache 38, when called upon, in the order in which read misses were assigned to the buffers in a round-robin, FIFO order. In the illustrated embodiment, the fill operation takes place in the order of buffer allocation. Other implementations may fill in different orders. After the vector has been completely scanned, in order to complete the load operation, the cache 38 is filled from the read miss buffers 26a-d with the requested data when this data becomes available. This data is driven onto the load/store data bus 47 and cache data bus 40 to the vector register 42. After all the requested data has been filled to the cache 38 and loaded to the vector register 42, the load operation is complete. Storing data from the vector register 42 into the data cache 38 is not as involved. The data cache 38 is only changed during a store operation when there is a hit in the tag comparator 16. If there is a cache miss, the data cache 38 remains unchanged. The only consequence of this is that when data is to be loaded from the data cache 38 to the vector register 42 in a load operation, a miss will occur with the miss being serviced as described earlier. For coherency reasons, it is important that the rest of the system knows what is in the data cache 38 at any time. For this purpose, during a store operation, a command address is sent to an address FIFO 54, and the data from the vector register file 42 corresponding to that command address is sent to a data FIFO 56. From these FIFO's 54, 56, the address and data are put onto the external bus 50, through the external bus controller 58 and sent to the system. The above description is for direct mapped write-through data cache. Other embodiments can handle write-back data caches. The FIFO's 54, 56 are of a size such that they can take one complete vector store operation. This allows the pipeline 8 to be used for a simultaneous load operation. One embodiment has the load operation wait for the store operation to complete if a read miss occurs during the load operation. Should there be a translation buffer miss during the store operation, the store operation will be stopped and the read miss serviced over the external bus 50. In other words, the translation buffer miss operation has priority over the store operation in the use of the external bus 50. The invention has been described for ease of explanation using pipe entries which represent individual quadword eight contiguous byte) elements. However, in the illustrated embodiment, a single pipe entry represents four aligned quadword elements (a hexaword). In this case, the pipe entry is decomposed in the cache tag look up stage 14 into its component quadwords, these quadword addresses being fetched one at a time from the data cache 38. Since only one quadword per cycle can be delivered from the data cache 38, the address generator 10 is stalled during the decomposition until the last quadword of the hexaword is reached. If there is a read miss, then the entire hexaword will be retrieved and eventually filled to the read miss buffers 26a-d and the data cache 38. An example of a hexaword is shown in Figure 13. Note that in this example, the hexaword is not aligned. In other words, longword 1 is not on the left, so that the first quadword, containing longwords 1 and 2 are not aligned. To account for this, the cycle type information (explained later) and the generation of address and address +1 by the address generator 10 allow the information to be properly written into the vector registers 42. The use of the read miss buffers 26a-d to obtain four quadwords at a time speeds the loading process since all of the aligned quadwords within the hexaword would miss if any one of the quadwords missed. Another embodiment loads single quadword elements on hits, but after a read miss, will retrieve a hexaword to which the quadword that missed belonged. During the cache fill, the hexaword is decomposed, but only the quadword that missed is loaded into the vector register file 42, while the entire hexaword is filled into the cache 38. A cycle type (CT) is also part of the pipe entry, and informs the vector register files 42 what type of element is being used, such as a quadword or longword and the alignment of the longword within that quadword. The pipe entry data can be double precision numbers (a quadword) or two longwords (single precision floating point) or integer numbers. Due to physical alignments of the longwords in main memory, the load/store unit can request the vector registers 42 to transmit or receive data with the desired longword in the upper or lower longword of the quadword. This is specified by the CT. The CT is tapped off the pipeline 8 at the same locations as the RFA. As mentioned earlier, the RFA is tapped off the pipeline 8 at different stages depending on what mode the pipeline 8 is in. Figures 2-4 show some of the components of Figure 1, reconfigured for purposes of explanation in the drawing to show the timing of the various operations. Figure 2 illustrates the pipeline configuration for the load operation, where data is loaded from the cache to the vector register 42. In stage 1L, the address generator stage 10 generates a virtual address. The translation buffer 12 translates the virtual address in stage 2L, and the physical cache tag data is looked up in stage 3L. The tag comparison is done in stage 4L, and data is driven out of the data cache 38 in stage 5L into the latch 19, and the RFA is tapped out of the cache data storage stage 18. In stage 6L, the RFA and the data are driven into latches 53 and 19, respectively. In stage 7L, the RFA and the data are driven into the vector register files 42. Note that to satisfy electrical and timing constraints, latches can be used before the data cache 38 and the cache data store stage 18. Such latches would prevent timing race and loading conditions, as one skilled in the art would readily appreciate. The pipeline configuration for the cache fill operation is shown in Figure 3. In stage 1CF, the command address which is to be filled is driven from one of the read miss buffers 26a-d (e.g. 26a) onto the command address bus 45. During stage 2CF, the data which was filled into the read miss buffer 26a is driven onto the load/store internal data bus 47. The tag for that command address is written into the tag store 34 by the cache tag lookup 14, which acts as an allocator in the cache fill mode. The RFA is driven out of the cache tag lookup stage 14. In stage 3CF, the data and the RFA are latched, as is the pipe entry by the tag comparator 16 which is acting as a latch and not a comparator in this mode. During stage 4CF, the data on the internal data bus 47 is driven onto the cache data bus 40 and into the vector register files 42. The RFA is also driven to the vector register files 42 at this time. Finally, in stage 5CF, the data is latched, and driven onto the cache data bus 40 and into the data cache 38. The configuration for stores is shown in Figure 4. In stage 1S, the virtual address is generated and the RFA is driven out of the address generator stage 10. During stage 2S, the virtual address is translated into a physical address, and the RFA is driven on the cache data bus 40 to the vector register files 42. Because of an inherent two cycle delay, data will appear two cycles later. The physical cache tag data is looked up in stage 3S. In stage 4S, the tag data and the tag compare data are compared, and the vector register files 42 drives the data designated by the RFA onto the cache data bus 40 and latched in latch 19. This data is driven into the data cache 38 during stage 5S. The data is written into the data cache 38 if there is a cache hit, and is ignored if there is a cache miss. Although Figures 2-4 show the various components of Figure 1 arranged in different positions, note that the couplings between the components are the same as in Figure 1. The reconfigurations are merely aids for understanding the timing and operation of the embodiment of Figure 1 in the three different operating modes. The "reconfiguring" is done by the controller 6 sending control signals to the various components. The timing diagrams shown in Figures 5-11 described below illustrate some examples of operation of the invention according to the principles of the invention discussed above. Referring to Figure 5 there is shown a timing chart for a load operation in the load/store pipeline. The pipeline stage configuration for a load operation is shown in Figure 2. The timing chart illustrates a six element load operation. For purposes of Figure 5, it is assumed that the cache tag comparator 16 will always generate a match or hit. This particular vector load instruction is a six element load instruction transferring eight bytes of information per element. The load/store pipeline 8 functions by inputting a command or vector instruction into the address generator 10 as shown in Figure 5 at time t 0 . The address generator 10 decomposes the vector instruction into an efficient sequence of external bus transactions that will complete the instruction. The output from the address generator 10 is called a pipe entry. All the remaining stages of the load/store pipeline receive and transmit pipe entries. As shown in Figure 5, the address generated for the pipe entry at time t 0 is 408 (hex) for element 0. The pipeline is in a normal mode for a quadword load operation. At time t 1 , element 0 is passed through the pipe to the translation buffer 12 as shown by arrow 60. The virtual address from the address generator stage 10 is translated to a physical address by the translation buffer 12. Due to the nature of a pipeline, the next element 1 enters the address generator stage 10 of the pipe at time t 1 . Again, the address generator stage decomposes the vector instruction into transactions that will complete the vector instruction. The output of the address generator stage 10 for element 1 is a complete external bus transaction having virtual addresses. At time t 2 , element 0 is shifted from the translation buffer 12 into the cache tag look up stage 14 as shown by arrow 61. The cache tag look up stage 14 looks up the tag in the tag store 34 for the physical address and returns it to the cache tag comparator 16. Element 0 is transferred to the cache tag comparator 16 at time t 3 where the tag compare is performed. Assuming in Figure 5 that all cache compares generate a match or hit, element 0 is read in the data cache 38 at time t 4 as shown by arrow 63 and illustrated in Figure 2. The data is then driven out of the data cache 38 into the latch 19 to be placed on the cache data bus 40. Also at time t 4 , the RFA is driven out of the cache data store stage 18 into a latch 62. At time t 5 , the RFA/CT is driven from the latch 62 onto the cache data bus 40 as shown by arrow 64. Further, the data for element 0 is driven from latch 19 onto the cache data bus 40 and the cache data bus is instructed to write the vector registers 42 thus completing the load operation for element 0. Returning to time t 2 , it is seen that element 1 is passed from the address generator 10 to the translation buffer 12 as shown by arrow 65. Further, element 2 now enters the address generator 10 of the pipeline. Element 1 is shifted through the stages 14, 16, 38 and 40 of the load/store pipeline as shown by arrows 66-69. Further, elements 2-5 shift in sequence through the pipeline behind this first element. In this manner, the six element load operation completes at time t 10 . The read miss buffers 26a-d are therefore not utilized when the cache tag comparator 16 does not generate a miss. Referring to Figures 6-6c in conjunction with Figures 2 and 3, there is shown an eight element vector quadword load operation wherein cache miss signals are generated in the cache tag comparator 16. In operation, at time t 0 , element 0 enters the address generator 10. The operation of the address generator 10 is the same as described above in the vector load operation of Figure 5. Element 0 passes through the pipe at time t 1 to the translation buffer stage 12 as shown by arrow 80. Element 0 continues to transfer stages as shown by arrows 81 and 82 through the cache tag look up stage 14 into the cache tag comparator 16. Again, the operation of the load pipeline is the same as described above. However, at time t 3 the cache tag comparator 16 performs a tag compare which results in a cache miss. Therefore, as seen from block 83, the command/address for element 0 is loaded into the first of the four read miss buffers 26a-d over the load/store internal command address bus 45. The subsequent pipe entries, elements 1-3, pass through the pipe in order until each element generates a cache miss in the cache tag comparator 16. Each cache miss loads the command address of the pipe entry sequentially into one of the four read miss buffers 26a-d through the command address bus 45 as shown in the timing chart by blocks 90-92. As can be seen from the timing chart at time t 6 , all four of the read miss buffers 26a-d are filled. However, elements 4, 5 and 6 have entered the pipeline before the fourth miss is generated in block 89 by the cache tag comparator 16. The pipe entry elements 0-3 in the read miss buffers 26a-d are serviced by the external bus 58 which fetches the cache fill information from memory. Because the pipeline queues the four read misses into the read miss buffers 26a-d in the four successive clock ticks, there are no longer any read miss buffers available for the pipeline to use should another read miss occur. However, as indicated above, there are three vector element addresses already started in the pipeline that have not been processed. As indicated at time t 7 and t 8 , the pipeline 8 must therefore halt while the read miss buffers 26a-d are serviced by the external bus 58. The address generator 10 will back up to the pipe entry element following the pipe entry element which caused the fourth cache miss. Time t 9 shows the holding of pipe element 5 in the address generator 10 as indicated by block 93. At the same time t 9 , element 4 is on hold in the translation buffer 12 as indicated by block 94. Once the first read miss buffer 26a has been serviced by the external bus 58, the data information is available on the command address bus 45 as indicated by block 95 for element 0. At time t 10 , the pipeline continues with element 5 in the address generator 10 and element 4 recording a hit in the translation buffer 12, as indicated by blocks 96 and 97 respectively. Because the command address is now available on the command address bus 45 and all read miss buffers are filled, the pipeline is changed into the cache fill mode and the physical address for the cache fill is sent to the cache tag lookup stage 14 as shown in block 98. Also as indicated in block 98, the address is allocated and validated in the lookup stage 14. At the same time, the data is available on the internal data bus 47 as shown in block 200. Continuing at time t 11 , block 99 indicates that element 6 is ready in the address generator 10. In the next stage down the pipeline, element 5 records a hit in the translation buffer 12 as shown by block 100. Further, the cache tag lookup on element 4 is performed in the cache lookup stage 14 as shown by block 101. The cache tag comparator 16, indicated by block 102, now receives the cache fill of element 0 as shown by block 102. At the same time, the cache data bus 40 receives the fill data from the internal data bus 47 as shown in block 103. Further, the fill RFA and CT are driven onto the cache data bus 40. At time t 12 the final element 7 enters the address generator 10. Further, elements 6 and 5 have continued through the load pipeline 8 as shown by blocks 105 and 106. At time t 12 , however, element 4 encounters a cache miss in the cache tag comparator 16 as shown by block 107. As was done previously, the cache miss loads the available read miss buffer 26a by using the command address bus 45 as indicated by block 109. At the same time t 12 , the data cache 38 is written with the information from element 0 which was on the cache data bus 40 from the read miss buffers as indicated in block 108. As can be seen from Figures 6 and 6A, the four read miss buffers 26a-d are again filled and thus the load pipeline must drain, hold and back up to element 5 as shown at times t 13 and t 14 . The term "drain" means the permitting of all stages of the pipeline to complete their operation. At time t 14 , element 6 is holding in the address generator 10 and element 5 is holding in the translation buffer 12 as shown by blocks 110 and 111 respectively. Block 112 indicates that the command address bus 45 now has available the information for servicing element 1 which was the second element placed in one of the read miss buffers 26a-d. At time t 15 , therefore, the pipeline 8 continues with element 6 in the address generator 10 and element 5 recording a hit in the translation buffer 12 as indicated by blocks 113 and 114 respectively. Further, the data for element 1 which was serviced by the external bus 50 is now available on the internal data bus 47 as shown by block 116. The address is input to the cache tag comparator 16 from the command address bus 45 as shown by block 115. The allocation and validation process is performed by the cache tag lookup 14. Continuing at time t 16 , a pipe entry element 7 again enters the address generator 10 of the pipeline 8. Further, element 6 records a hit in the translation buffer 12 and element 5 has the cache tag look up stage 14 perform a tag lookup. At time t 16 , the cache tag comparator 16 receives the cache fill of element 1 as shown by block 117. Further, the cache data bus 40 now has the data and RFA/CT for element 1 available on the bus 40 for writing the vector registers 42. At time t 17 , as shown in block 119, the data cache 38 has element 1 written to it, so as to complete the cache fill for that element. At the same time, element 5 passes from the cache tag lookup stage 14 to the cache tag comparator 16 where a cache miss is generated as shown in block 120. Again, the cache miss of element 5 is loaded into one of the available read miss buffers 26a-d through the command address bus 45 as seen in block 121. This sequence of running the load pipeline and servicing the cache fills continues in the pipe until the final element 7 encounters a cache miss in the cache tag comparator 16 as shown at time t 29 by block 122 (Figure 6B). At time t 29 , the cache miss in element 7 loads one of the available read miss buffers 26a-d through the load/store internal command address bus 45 as shown in block 123. At the same time, as shown in block 124, element 3 is written into the data cache 38 from the cache data bus 40 as was done previously for elements 0-2. Because the read miss buffers 26a-d are again filled, the load pipeline drains, holds and backs up as shown illustratively at times t 30 and t 31 . Finally, at time t 32 , element 4 has been serviced by the external bus 50 and is ready to return to the pipeline as is illustrated at times t 33 -t 35 . Element 4 has its cache miss filled as was done previously for the earlier elements. Because no further elements are loaded into the address generator 10 for the vector instruction, the pipeline 8 remains in a cache fill mode to service the remaining read miss buffers until the entire load is completed (Figure 6C). An alternative embodiment for a non-unity stride vector load operation is shown in Figures 7-7D. The timing charts of Figures 7-7D illustrate a six element load operation where each element encounters a cache miss. The load operation is performed substantially as described above for Figures 6-6C. However, after the fourth cache miss which fills the read miss buffers, as shown by blocks 202-208 (Figure 7), the cache fill mode operates differently than described above. In operation, the cache fill mode has available the command address on the command address bus 45 as shown in block 210 at time t 10 (Figure 7A). At time t 11 , the address is input to the cache tag lookup stage 14 for allocation and validation. The embodiment of Figures 7-7D returns a hexaword of information into the read miss buffers rather than the single quadword described above in Figures 6-6C. Therefore, although only a single quadword is needed for the non-unity stride operation, the cache tag lookup stage must decompose the hexaword address into its four quadwords as shown during times t 12 to t 14 . During the decomposition time, the address generator 10 and translation buffer 12 stages of the pipeline hold until the final decomposition at time t 14 . The data for each quadword is sequentially driven onto the internal data bus 47 as shown by blocks 212-218. On the following clock tick, the data is driven onto the cache data bus 40 as shown during times t 12 to t 15 . At the same times, t 12 to t 15 , the RFA/CT is driven onto the cache data bus 40. Because only a single quadword is necessary, the RFA and CT are only valid for one quadword out of the hexaword. This is shown for element 0 having the valid quadword address 408, at time t 13 . On the next clock tick, t 14 , the data cache 38 is written with the fill data. This process continues as described above for all of the elements in the load operation. Figures 7-7D allow a hexaword of information to be fetched by the external bus even though only a single quadword is necessary. Referring to Figure 8 in conjunction with Figure 4, there is shown a timing chart for a vector store operation having eight elements. The operation of Figure 8 begins with the address generator 10 producing a sequence of pipe entries starting with element 0 as shown in block 140 at time t 0 . Element 0 passes down the pipeline to the translation buffer 12 as shown by arrow 141 at time t 1 . The virtual address from the address generator 10 is translated to a physical address in the translation buffer 12. At the same time, the RFA/CT is driven onto the cache data bus 40 as shown in block 222. The store operation reads the data from the vector registers 42. The physical address is then driven into the cache tag lookup stage 14 as shown by arrow 143 at time t 2 . The cache tag is looked up and the element 0 passes to the cache tag comparator 16 as shown by arrow 145 at time t 3 . Also at time t 3 , the vector registers 42 drives the data onto the cache data bus 40 as shown by block 224. The cache tag comparator 16 performs a tag compare as shown by block 146. Finally, at time t 4 , the data is driven from the cache data bus 40 and written into the data cache 38 as shown by block 148 when the tag compare, block 146, results in a cache hit. However, if the tag compare results in a cache miss, the cache is unchanged. This operation continues for the entire store operation as shown in Figure 8. Referring to Figures 9 and 9A, there is shown a timing diagram for a vector load operation having a unity stride. When the stride is unity, the vector elements are stored contiguously in memory. Therefore, each pipe entry produced by the address generator stage 10 represents multiple elements. This takes advantage of the higher external bus bandwidth available when accessing contiguous memory locations. Figures 9 and 9A viewed in conjunction with Figure 2 shows a five hexaword vector operation loading seventeen elements where it is assumed that the cache tag comparator 16 continuously generates a match. In general, the operation of the load/store pipeline 8 for a unity stride operation is the same as for a non-unity stride operation as described above. However, the address generator 10 can produce a sequence of pipe entries beginning with element 0. Each pipe entry may represent between 1 and 4 elements (i.e., a hexaword). This is shown in the timing chart at address generator 10 where the elements entering the address generator 10 are multiples of four. Thus, the element count is incremented by four for every pipe entry. As was done previously, each virtual address from the address generator 10 is translated to a physical address in the translation buffer 12. Next, the physical address is passed to the cache tag lookup stage 14 and then to the cache tag comparator 16. A tag compare is performed in the cache tag comparator 16 which, for purposes of Figure 9, always will result in a cache hit. The block size of the cache is one hexaword; a cache hit indicates that the entire hexaword (all elements contained in the pipe entry) is in the cache. It is noted that the pipe entry is composed of four sub elements (or quadwords) in Figure 9. The cache, however, can only deliver one sub element per clock tick. Therefore, as shown during time t 2 -t 5 , the pipe entry contained in the cache tag lookup stage 14 must be decomposed into its component sub elements and these sub element addresses are then read from the data cache 38. The sub elements read from the data cache 38 are driven onto the cache data bus 40 and written into the vector registers. While the pipe entry is being decomposed in the cache tag lookup stage 14, the address generator 10 of the pipe is stalled at the next hexaword address (t 1 ). The generator 10 remains stalled until the last sub element of the hexaword is reached. It is important to note from Figure 9 that the pipe entry decomposition in the cache tag lookup stage 14 begins before the results of the cache lookup are known in the cache tag comparator 16. Decomposition begins unconditionally and it is assumed that the cache will hit. After the last element has been loaded from the data cache 38, its parity is checked. If the parity is correct, the load/store chip notifies the vector controller that the vector load operation is complete. Referring to Figures 10-10D, there is shown a unity stride timing chart for a six hexaword vector operation loading twenty-two elements. It is assumed in Figures 10-10D that the cache tag comparison will always result in a cache miss. The operation of Figures 10-10D, viewed in conjunction with Figures 2 and 3, for a unity stride vector load operation is similar to that for the non-unity stride operation illustrated in Figures 7-7D. The initial operation of Figures 10-10D, i.e. t 0 -t 2 is the same as that for Figure 9. However, unlike Figure 9 which always generates tag hits, the tag compare performed in the cache tag comparator 16 of Figure 10 always results in a cache miss. The cache miss loads the pipe entry into one of the read miss buffers 26a-d by the command address bus 45, block 230(t 4 ), for servicing by the external bus 58. The decomposition started in the cache tag lookup stage 14, block 232(t 3 ), is aborted when this occurs and the resulting pipe entry is ignored as shown in block 234(t 4 ). The address generator 10 which was stalled when the decomposition started is now released from the stalled condition and produces a new pipe entry when the miss is loaded into the read miss buffer. This operation continues until all four read miss buffers 26a-d are loaded by the command address bus 45, block 236, at time t 13 . Because there are no more read miss buffers available should another read miss occur, the pipeline must halt and the address generator 10 must back up to the pipe entry following the pipe entry causing the fourth cache miss. The generation of pipe entries will eventually be restarted at this point. While the pipeline is halted, the address generator 10 and translation buffer 12 stall, t 15 -t 18 (Figure 10A), until the first read miss buffer has been serviced the command address being available on the command address bus 45. The command address is used to service the cache fill. Once the external bus 58 has serviced the read miss buffer, the pipe entry from the read miss buffer is delivered to the cache tag lookup stage 14 of the pipe by the command address bus 45 as shown at time t 16 . The cache fill data is driven onto the load/store internal data bus 47 at the same time. The mode of the pipeline is changed to the cache fill mode by the pipe controller 52. The tag is allocated and validated in the tag store 34 by the tag lookup 14. As shown in Figure 10A at time t 17 , the pipe entry in the cache tag comparator 16 is now decomposed into its four component sub elements. The four sub elements of the returned hexaword are driven onto the cache data bus 40 during times t 17 -t 20 . The data is written into the data cache 38 during times t 18 -t 21 . After the first cache fill service completes the decomposition at time t 19 , the pipe controller 52 releases the address generator 10 of the pipe as a read miss buffer is now available if another cache miss occurs. At time t 21 , another cache miss occurs thus filling the fourth read miss buffer at time t 22 . The pipeline is again halted, backed up and stalled until the next read miss buffer is serviced. This operation continues until all of the elements have been processed. If no further misses occur, the read miss buffers are serviced after all the other elements have been processed through the pipeline. After the last element has been loaded, and all of the sub elements (quadwords) of the last hexaword fill are complete, the vector controller 6 is notified that the vector load of unity stride is complete. Figure 11 shows a timing chart for a seven hexaword vector store operation having a unity stride. The operation of Figure 11 is the same as that of Figure 8 for a non-unity stride store operation. The following embodiment is not covered by the scope of the claims. It is mentioned for explanatory purposes. An embodiment of a pipeline with an integral cache for use in a scalar processor according to the present invention is illustrated in Figure 12. The reference numeral 200 refers to the entire pipeline. The issuer 210 provides a displacement value and control signals depending on the type of instruction, e.g. a load instruction or a store instruction. A register file 212 stores results from an arithmetic logic unit (ALU) 216 and has two write ports and two read ports. The displacement value from the issuer 210 is added to a base address from the register file 212 by the ALU 216 to produce a virtual address. Such a virtual address can be thirty-two bits for example. The thirty-two bits of virtual address (VA〈31:0〉) are presented simultaneously to a translation buffer (TB) 218 and a cache tag look up 220 although the cache tag lookup 220 only uses eight bits (VA〈10:3〉) to index a tag. The translation buffer 218 and cache tag look up 220 each send twenty-one physical address bits (PA〈31:11〉) to the comparator 224 which produces a hit signal when the bits match or a miss signal when there is a mismatch. The eight bits which are sent to the cache tag look up 220 are the untranslated bits of the virtual address VA〈31:0〉. Thus, no translation mechanism is necessary in front of the cache tag look up 220, and the tag lookup, address translation and comparison can be done within one cycle. The use of only eight untranslated bits to index the tag is allowed due to the size of the data cache and the page size used in the system. A controller 222 receives the hit/miss signal from the comparator 224, and will cause the data to be written in or read from the data cache 226 if there is a hit. A latch 252 receives the bits VA〈10:3〉 so that the data cache is indexed one cycle after the comparison. If there is a hit, data is written into the cache (in a store operation) or read from the cache (in a load operation). Due to the cache load or store being performed serially after the comparison, there is an equal number of stages in the pipeline for both the load operation and the store operation. When there is a miss signal, the entire physical address (PA〈31:0〉) is sent to an output fifo 228 which is connected to the main memory system of the scalar processor. The address is then sent from the output fifo 228 in order to fetch the data from the main memory. At the same time, the physical address is sent to a memory reference tag 230, which in the illustrated embodiment, has four locations which each store a physical address (PA), a register file number (RF#) and the data length (DL). It should be noted that control information has been passed down the pipe along with the address, although it has not been shown for purposes of illustration. Some of this information is the register file number which determines where in the register file data is written to; and the data length, which tells the register file 212 what part of the returning data is to be input to the register file 212. In the embodiment shown in Figure 12, the output fifo 228 has eight locations and the memory reference tag 230 has four locations. Thus, during a load operation, up to four load misses can be put into the memory reference tag 230. When another load miss occurs while the memory reference tag 230 is full, no-ops are sent by the issuer 210 until data has been returned over the external bus 250. When the data is returned, it enters a buffer 236 which sends the data to both the data cache 226 (through multiplexer 238) and the register file 212. The corresponding RF# and DL are sent from the memory reference tag 230 to the register file 212 so that the returned data can be properly written into the register file 212. The physical address (PA〈31:0〉) is sent to the cache tag lookup 220 and at the indexed location (PA〈10:3〉), bits PA〈31:11〉 (the tag) will be written so that the next lookup to that tag location will be valid. Because the data cache 226 is a write-through cache, during write operations in which the data cache 226 is being changed, the rest of the system must know what is in the data cache 226. For this reason, buffers 234A-C are coupled between the register file 212 and the output fifo 228 and pass the data out through the output fifo 228 during every store operation. During a load operation, when there is a miss, the output fifo provides information to the processor indicating that there is a load operation, the size of the data element requested, the physical address where the data element is located in the main memory of the processor and the tag which is used by the pipeline. For a store operation the information which is output by the output fifo 228 is the fact that it is a store operation, the size of the data element, the physical address and the data element itself. Due to the operation of the fifo 228 and the memory reference tag 230, the pipeline 200 of Figure 12 can support multiple outstanding misses while continuing to operate. In order to continue the pipeline subsequent to a cache miss, dependancy checks must be made. To that end, the controller provides for a write abort. Thus, if during a load operation there is a cache miss (so that the memory reference tag 230 contains a miss) which is followed by any store instruction, this subsequent store operation will be aborted. Alternatively, a procedure for checking the dependency between loads and stores is to compare, using a content addressable memory device, the physical address of the store instruction in the output fifo 228 with the physical address in the memory reference tag 230, and performing a write abort if any of the numbers match. A write abort includes aborting all the instructions currently in the pipeline and backing up the program counter in the issuer 210 to reissue all of the instructions subsequent to the last load instruction which missed and was put into the memory reference tag 230.

Claims: A pipeline (8) in a computer processor for loading data from a cache memory to registers (42) and storing data from the registers (42) to the cache memory, the pipeline comprising: an address generator (10) operating to generate address information entries serially, each one of the address information entries relating to a corresponding one of a series of data entries; a cache tag look_up and a comparator device coupled to the address generator (10) to receive the address information entries serially from the address generator (10) and operating to perform a cache tag look_up and tag compare operations, serially, for each one of the address information entries, the cache tag look_up and comparator device outputting a cache index and either a hit signal or a miss signal as a result of the cache tag look_up and compare operation; the cache memory including a data cache (38) having inputs coupled to the cache tag look_up and comparator device to receive said cache index and to be responsive to either a hit signal or a miss signal, and an output coupled to the registers; the data cache (38) operating to selectively perform in respect of each of the data entries corresponding to the address information entries from the address generator (10), either a load of each of the data entries from the cache memory to the registers or a store of each one of the data entries from the registers (42) to the cache memory only if the cache tag look_up and comparator device output generates a hit for the address information entry received from the address generator (10) corresponding to the data entry; the pipeline being characterized by: said cache tag look_up and comparator device having first and second pipe stages: a) said first stage including: a cache tag look_up stage (14) for parsing a physical address into said cache index and tag compare data comprising the tag portion of the physical address; and a tag store (34) coupled to the cache tag look_up stage (14) for storing tags corresponding to addresses in said cache, said tag store receiving said cache index and outputting corresponding tag data; b) said second stage including: a comparator (16) coupled to said tag store (34) and said cache tag look_up stage (14) for receiving said tag data and said tag compare data and generating a hit signal when said tag data and said tag compare data match, and a miss signal when said tag data and said tag compare data do not match, and a delay (35) coupled between said cache tag look_up stage (14) and said data cache (38) which delays the receipt of said cache index by said data cache, so that said data cache is not accessed until after the generation of a hit signal or a miss signal by said comparator (16). The pipeline of claim 1 further comprising an address generator (10) coupled to said cache tag look-up stage (14) for receiving load and store commands and generating pipe entries which include virtual addresses. The pipeline of claim 2 further comprising a translation buffer (12) coupled between said cache tag look_up stage (14) and said address generator (10) for translating said virtual addresses into physical addresses. The pipeline of claim 1, including read miss buffers (26a-d) that store said command addresses, receive said address information data in arbitrary order from out of said pipeline (8) and fill the cache memory with the data in the order the command addresses were stored in said read miss buffers (26a-d). The load/store pipeline of claim 1 further comprising a load/store controller (52) for controlling the pipeline into either a load mode, a store mode, or a cache fill mode. The pipeline as in claim 1 including: a cache data bus (40) coupled to said cache memory and to said registers (42) which transfers data entries between said cache memory and said registers (42), and said filling device includes an internal data bus coupling said read miss buffers (26a-d) to said cache data bus (40) and carrying said obtained data entries. The pipeline of claim 1, wherein said comparator device (16) includes obtaining devices which obtain additional data entries from out of said pipeline (8) when said data entry corresponding to said command address is obtained, and wherein said filling device fills the cache memory with said obtained data entry and said additional data entries. The pipeline of claim 7, wherein said data entries are longwords, and said additional data entries are longwords within an aligned hexaword, which contains a longword corresponding to said obtained data. The pipeline of claim 1, wherein said data is a quadword having two longwords. The pipeline of claim 9, wherein said entries contain information regarding alignment of said longwords of a quadword such that non-aligned longwords are storable in said registers. The pipeline of claim 10, wherein said information is cycle type information and said register is presented by said pipeline with an address and an address plus 1 for each said quadword. The pipeline of claim 1 further comprising a write buffer coupled to said cache memory which buffers data entries corresponding to a storing operation out of said pipeline, said write buffer having a capacity to store contents of an entire register, such that an operation subsequent to said storing operation can be performed in said pipeline while said data entries corresponding to said storing operation are buffered out of said pipeline. The pipeline of claim 12, wherein said write buffer is a dynamically configurable write buffer which is configurable during storing operations to accommodate different data formats.

Inventors: BURNS DOUGLAS J, FENWICK DAVID M, HEYE RICHARD, STAMM REBECCA L, STANLEY TIMOTHY J, WILLIAMS DOUGLAS D, WITEK RICHARD T, BURNS, DOUGLAS J., FENWICK, DAVID M., HEYE, RICHARD, STAMM, REBECCA L., STANLEY, TIMOTHY J., WILLIAMS, DOUGLAS D., WITEK, RICHARD T.
Applicants: DIGITAL EQUIPMENT CORP, DIGITAL EQUIPMENT CORPORATION
Application year: 1989
Main classification: G06F12
IPC codes: G06F12, G06F15, G06F17, G06F9