# US 2001/0043227 A1 · Priority methods for texture map storage

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2001/0043227 A1
- Document ID: US20010043227A1
- Status: Published application
- Kind: A1
- Application number: 09/102,612
- Filed: 1998-06-22
- Published: 2001-11-22
- Earliest claimed: 1996-06-27
- Assignees: Cirrus Logic, Inc.
- Inventors: CHRISTOPHER W. SHAW
- Web page: https://patentgrep.com/patent/US20010043227A1

## CPC

- G06T 1/60: Memory management
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

A process and implementing computer system for graphics applications in which information files such as texture maps (TMs) are prioritized and stored in a local relatively fast RDRAM memory. The method of prioritization includes initially sorting the information files by order of the frequency with which corresponding graphics primitive elements are called by the application. The priority is adjusted such that the smaller TMs get an increase in their priority so that more TMs may be placed in faster graphics memory. Thereafter among similarly prioritized groups of information files, the larger of the files are first stored in the fast graphics memory and the remaining files are marked for storage in the system memory after the fast local memory has been fully utilized. A searching routine enables an identification of available or free storage space in the local memory and the method further compares individual texture map files with available free memory space to optimize storage of the texture maps on a priority basis to the fast local graphics memory.

## Claims

### Claim 1

A method for storing a group of blocks of information in a first memory, each of said blocks of information being associated with an element of an image which may be displayed, said method comprising:
marking each of the blocks according to at least one predetermined characteristic of the information; and
storing said blocks in said first memory in accordance with a predetermined priority schedule for said characteristic.

### Claim 2 (depends on 1)

The method as set forth in claim 1 wherein said blocks of information comprise texture maps and said elements are pixels of a display system.

### Claim 3 (depends on 2)

The method as set forth in claim 2 wherein said predetermined characteristic is related to a frequency with which said block is retrieved from said first memory.

### Claim 4 (depends on 2)

The method as set forth in claim 2 wherein said predetermined characteristic is related to a size aspect of said block.

### Claim 5 (depends on 4)

The method as set forth in claim 4 wherein larger ones of said blocks are stored on a priority basis before smaller one of said blocks.

### Claim 6 (depends on 4)

The method as set forth in claim 4 wherein said blocks are stored in accordance with a second predetermined characteristic.

### Claim 7 (depends on 6)

The method as set forth in claim 6 wherein said second predetermined characteristic is related to a frequency with which said blocks are retrieved from said first memory.

### Claim 8 (depends on 2)

The method as set forth in claim 2 wherein said first memory is comprised of free space areas and non-free space areas, said non-free space areas representing first memory area which is not available for storing said blocks of information, said free space areas being representative of first memory source available for storing said blocks of information, said method further including:
registering all free space areas of said first memory;
fetching a largest one of said blocks of information;
finding a smallest one of said free space areas;
attempting to fit said largest one of said blocks into said smallest one of said free space areas.

### Claim 9 (depends on 8)

The method as set forth in claim 8 wherein said method further includes a step of:
iteratively fetching a next larger free space area if said largest one of said blocks of Information does not fit into said smallest one of said free space areas.

### Claim 10 (depends on 9)

The method as set forth in claim 9 wherein said method further includes:
storing said largest one of said blocks of information into said smallest one of said free space areas if said largest one of said blocks of information is determined to fit into said smallest one of said free space areas.

### Claim 11 (depends on 10)

The method as set forth in claim 10 wherein said method further includes:
storing said largest one of said blocks of information into a second memory when said largest one of said blocks of information in unable to fit into said smallest one of said free space areas and there are no larger free space areas available in said first memory.

### Claim 12 (depends on 11)

The method as set forth in claim 11 wherein said first memory is faster than said second memory.

### Claim 13 (depends on 12)

The method as set forth in claim 12 and further including:
determining if there are more of said blocks of information available after each time one of said blocks of information is stored; and
iteratively repeating said steps of registering, fetching, finding and attempting, when it is determined that more of said blocks of information are available, said method being further operable to continue until it is determined that there are no more blocks of information available and all available blocks of information have been stored in one of said first and second memories.

### Claim 14 (depends on 13)

The method as set forth in claim 13 wherein said method further includes repeating said registering of said free space areas after each time one of said blocks of information is stored in said free space area.

### Claim 15 (depends on 8)

The method as set forth in claim 8 wherein said step of registering further includes;
finding a free space area in said first memory; and
selectively creating a new free space file when any of said free space areas found in said first memory are determined not to be a subset of a previously established free space area.

### Claim 16 (depends on 15)

The method as set forth in claim 15 wherein said finding step further includes:
determining a zero reference starting point in said first memory;
finding a lower right side vertex of a non free space memory area adjacent to said zero reference starting point; and
searching memory space below said starting point and registering any free space found.

### Claim 17 (depends on 16)

The method as set forth in claim 16 and further including:
searching memory space to the right of said start point and registering any free space found.

### Claim 18 (depends on 17)

The method as set forth in claim 17 and further Including repeating said step of registering until all non-free space areas of said first memory have been registered.

### Claim 19 (depends on 8)

The method as set forth in claim 8 wherein after said step of attempting, said method further includes:
re-shuffling said texture maps in said first memory whenever said largest one of said blocks does not fit within said smallest one of said free space areas.

### Claim 20 (depends on 19)

The method as set forth in claim 19 wherein said re-shuffling step comprises size re-shuffling said texture maps based upon size of said texture maps, said size re-shuffling being accomplished whenever texture map size is greater than existing free space in said first memory but less than the existing texture maps in said first memory.

### Claim 21 (depends on 20)

The method as set forth in claim 20 wherein said method is further operable to put said texture map in a second memory whenever said texture map size is not greater than existing free space and less than existing texture maps.

### Claim 22 (depends on 21)

The method as set forth in claim 21 wherein said first memory has a faster access time than said second memory.

### Claim 23 (depends on 21)

The method as set forth in claim 21 wherein said size re-shuffling step includes:
clearing non-free space areas in said first memory;
clearing available free space areas in said first memory;
finding available free space areas in said first memory;
getting a largest one of available texture maps; attempting to put said largest one of said texture maps in said first memory; and
putting said largest one of said texture maps in a second memory if said largest one of said texture maps does not fit in said first memory.

### Claim 24 (depends on 23)

The method as set forth in claim 23 wherein said method further includes attempting to UV mux said largest one of said texture maps when said largest one of said texture maps does not fit in said first memory.

### Claim 25 (depends on 19)

The method as set forth in claim 19 wherein said re-shuffling step comprises priority re-shuffling said texture maps based upon a priority of said texture maps, said priority re-shuffling being accomplished whenever texture map priority is higher than priorities of existing texture maps in said first memory.

### Claim 26 (depends on 25)

The method as set forth in claim 25 wherein said method is further operable to put said texture map in a second memory whenever said priority of said texture map is not greater than priorities of texture maps previously established in said first memory.

### Claim 27 (depends on 26)

The method as set forth in claim 26 wherein said first memory has a faster access time than said second memory.

### Claim 28 (depends on 25)

The method as set forth in claim 25 wherein said priority re-shuffling step includes:
assigning priorities to said texture maps;
sorting said texture maps by said assigned priority; and iteratively attempting to fit differing percentages of said texture maps having higher ones of said priorities into free space of said first memory until a predetermined number of fits occurs.

### Claim 29 (depends on 24)

The method as set forth in claim 24 wherein said muxing step includes:
determining if dimensions of said texture map are muxable;
changing dimensions of said texture map when it is determined that said dimensions are muxable;
attempting to put said muxed texture map into said first memory; and
assigning said muxed dimensions to said texture map if said muxed texture map fits into said first memory.

### Claim 30 (depends on 29)

The method as set forth in claim 29 wherein said method further includes:
restoring original dimensions to said texture map when said muxed texture map does not fit into said first memory.

### Claim 31

A storage medium including machine readable indicia, said storage medium being selectively coupled to a reading device, said reading device being coupled to processing circuitry, said reading device being selectively operable to read said machine readable indicia and provide program signals representative thereof, said program signals being effective to cause said processing circuitry to store a group of blocks of information in a first memory, wherein each of said blocks of information is associated with an element of an image which may be displayed, said program signals being further effective to accomplish the steps of:
marking each of the blocks according to at least one predetermined characteristic of the information; and
storing said blocks in said first memory in accordance with a predetermined priority schedule for said characteristic.

### Claim 32

A computer based graphics station, including a computer system comprising a main bus and a display device, and a graphics subsystem, said graphics subsystem comprising a graphics processor device connected to said main bus and to said display device, said graphics subsystem further including a graphics memory coupled to said graphics processor, said graphics subsystem being selectively operable to provide program signals, said program signals being effective to cause said graphics station to store a group of blocks of information in a first memory, wherein each of said blocks of information is associated with an element of an image which may be displayed, said program signals being further effective to accomplish the steps of:
marking each of the blocks according to at least one predetermined characteristic of the information; and
storing said blocks in said first memory in accordance with a predetermined priority schedule for said characteristic.
