Surety is performing system maintenance this weekend. Electronic date stamps on new Prior Art Database disclosures may be delayed.
Browse Prior Art Database

Contiguous Byte Detection By Extending Byte Enable Boundaries

IP.com Disclosure Number: IPCOM000200049D
Publication Date: 2010-Sep-24
Document File: 5 page(s) / 135K

Publishing Venue

The IP.com Prior Art Database


The purpose of this invention is to provide an efficient method of determining whether two sets of data are contiguous. From a high level, the solution extends one set of byte enables by one bit at the leading and trailing edge. The result is combined with the byte enables for the other set of data to determine whether the two sets of data are contiguous.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 52% of the total text.

Page 01 of 5

Contiguous Byte Detection By Extending Byte Enable Boundaries

Store gathering is only a single potential usage of this idea; there may be other usages. An advantage of this solution versus the a pre-existing address based method of keeping the next sequential starting address is that it enables the design to gather stores in incrementing or decrementing address order. The address method could also enable this feature, but with added complexity. A beginning and ending address would have to be calculated. The gathering logic would have to look at the address and length of the new store and see if the final byte of the new store would be exactly one byte address before the beginning address of the existing data. Our solution provides this functionality without having to perform any additions or compares.

Figure 1 below shows an illustration of the problem we are solving with our invention. The figure shows two different pairs of byte enables. One belongs to some previous piece of data ("Existing"), while the other shows the new data ("New") which is arriving. The first pair of byte enables is contiguous because there are no invalid bytes between the new data and the existing data. Looking at the resulting byte enables, between the first valid byte and the last valid byte, there are no invalid bytes. In the second pair of byte enables, there is one invalid byte between them; so, these are discontiguous.

Figure 2 shows a potential logic implementation of this solution. Figure 3 shows how the contiguous detection is performed using our solution for a contiguous case. Figures 4 show the same for a discontiguous case....