Xmas - the patent describes the use of a linked-list to hold AA samples (when using compressed AA sample sets).
You need a linked list because you don't know how many AA samples (in a compressed storage mechanism, using a coverage mask) you'll need for each pixel.
When a new AA sample needs to be stored (a new visible fragment appears that covers at least one AA sample point) the memory address it's stored at is unpredictable. If the pixel has three AA samples currently, then the new AA sample will be stored at the "first memory address available", leaving the three existing AA samples where they are. The linked list will have each fragment's coverage mask updated (if required), and the linked list's final fragment will have its pointer set to point to the new fragment's AA sample.
An alternative to using a linked list would be to scrap the original memory locations and write the updated AA sample set to a fresh, contiguous, piece of memory.
The patent describes the use of a stack to keep track of memory locations that are freed up when AA samples are discarded.
The patent seems to be quite emphatic about the use of a linked list.
When a pixel is entirely covered by a fragment, there is no need to store any AA sample data. This is the basis of ATI's compressed AA sample set architecture. When the
majority of pixels in a frame are not representing one or more edges, AA sample compression is a big win.
This is why the patent is entitled:
Method and apparatus for video graphics antialiasing using a
single sample frame buffer and associated sample memory
To be quite honest I can't address the memory incoherency (and therefore bandwidth wastage due to granularity) problem that you describe. I can only say that this is the technique ATI has described.
Perhaps some brave soul will create a model representing the conflicting variables in AA:
- number of triangles per frame
- number of pixels per frame
- overdraw
- average triangle size
- degree of AA
- super-sampling versus edge multi-sampling
and evaluate the memory efficiency (bandwidth versus latency versus consumption) of uncompressed versus various compressed AA sample set schemes
Jawed