# US 2008/0313436 A1 · Handling of extra contexts for shader constants

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

- Number: US 2008/0313436 A1
- Document ID: US20080313436A1
- Status: Published application
- Kind: A1
- Application number: 11/808,887
- Filed: 2007-06-13
- Published: 2008-12-18
- Earliest claimed: 2007-06-13
- Assignees: Advanced Micro Devices, Inc.
- Inventors: Mark M. Leather; Brian D. Emberling
- Web page: https://patentgrep.com/patent/US20080313436A1

## CPC

- G06F 9/3877: {using a secondary processor, e.g. coprocessor (peripheral processor G06F13/12)}
- G06T 1/20: Processor architectures; Processor configuration, e.g. pipelining
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

The present invention provides a system for handling extra contexts for shader constants, and applications thereof. In an embodiment there is provided a computer-based method for executing a series of compute packets in an execution pipeline. The execution pipeline includes a first plurality of registers configured to store state-updates of a first type and a second plurality of registers configured to store state-updates of a second type. A first number of state-updates of the first type and a second number of state-updates of the second type are respectively identified and stored in the first and second plurality of registers. A compute packet is sent to the execution pipeline responsive to the first number and the second number. Then, the compute packet is executed by the execution pipeline.

## Claims

### Claim 1

A computer-based method for executing a series of compute packets in an execution pipeline, wherein the execution pipeline includes a first plurality of registers configured to store state-updates of a first type and a second plurality of registers configured to store state-updates of a second type, the computer-based method comprising:
identifying a first number of state-updates of the first type and a second number of state-updates of the second type respectively stored in the first and second plurality of registers;
sending a compute packet to the execution pipeline responsive to the first number and the second number; and
executing the compute packet sent to the execution pipeline.

### Claim 2 (depends on 1)

The computer-based method of claim 1, wherein the identifying comprises:
maintaining a first counter corresponding to the first number of state-updates of the first type and a second counter corresponding to the second number of state-updates of the second type.

### Claim 3 (depends on 1)

The computer-based method of claim 1, wherein the sending comprises:
sending a compute packet to the execution pipeline if (i) a first counter does not exceed a first predetermined value and (ii) a second counter does not exceed a second predetermined value.

### Claim 4 (depends on 3)

The computer-based method of claim 3, wherein the first predetermined value is greater than the second predetermined value.

### Claim 5 (depends on 3)

The computer-based method of claim 3, wherein the first plurality of registers comprises sixty-four registers and the second plurality of registers comprises eight registers, and the sending comprises:
sending a compute packet to the execution pipeline if (i) the first counter does not exceed sixty-four and (ii) the second counter does not exceed eight.

### Claim 6 (depends on 1)

The computer-based method of claim 1, further comprising:
parsing state-updates into the first type and the second type based on an identifier included in each respective state-update.

### Claim 7 (depends on 6)

The computer-based method of claim 6, wherein the identifier comprises a register address and the parsing comprises:
identifying a first state-update as the first type if the register address corresponding to the first state-update is within a predetermined address range; and
identifying the first state-update as the second type if the register address corresponding to the first state-update is not within the predetermined address range.

### Claim 8

A computer readable medium containing instructions for generating a processor which when executed are adapted to create the processor, the processor comprising an execution pipeline that includes a first plurality of registers configured to store state-updates of a first type and a second plurality of registers configured to store state-updates of a second type, wherein the processor is adapted to:
identify a first number of state-updates of the first type and a second number of state-updates of the second type respectively stored in the first and second plurality of registers;
send a compute packet to the execution pipeline responsive to the first number and the second number; and
execute the compute packet sent to the execution pipeline.

### Claim 9 (depends on 8)

The computer readable medium of claim 8, wherein, to identify the first number and the second number, the processor is adapted to maintain a first counter corresponding to the first number of state-updates of the first type and a second counter corresponding to the second number of state-updates of the second type.

### Claim 10 (depends on 8)

The computer readable medium of claim 8, wherein the processor is adapted to:
send a compute packet to the execution pipeline if (i) a first counter does not exceed a first predetermined value and (ii) a second counter does not exceed a second predetermined value.

### Claim 11 (depends on 10)

The computer readable medium of claim 10; wherein the first predetermined value is greater than the second predetermined value.

### Claim 12 (depends on 10)

The computer readable medium of claim 10, wherein the first plurality of registers comprises sixty-four registers and the second plurality of registers comprises eight registers, and the processor is adapted to:
send a compute packet to the execution pipeline if (i) the first counter does not exceed sixty-four and (ii) the second counter does not exceed eight.

### Claim 13 (depends on 8)

The computer readable medium of claim 8, wherein the processor is further adapted to:
identify state-updates as the first type or the second type based on an identifier included in each respective state-update.

### Claim 14 (depends on 13)

The computer readable medium of claim 13, wherein the identifier comprises a register address, and wherein the processor is adapted to identify a first state-update by one of
identifying the first state-update as the first type if the register address corresponding to the first state-update is within a predetermined address range, and
identifying the first state-update as the second type if the register address corresponding to the first state-update is not within the predetermined address range.

### Claim 15 (depends on 8)

The computer readable medium of claim 8, wherein the processor is embodied in hardware description language software.

### Claim 16 (depends on 8)

The computer readable medium of claim 8, wherein the processor is embodied in one of Verilog hardware description language software and VHDL hardware description language software.

### Claim 17

A processor for executing a series of compute packets, comprising:
an execution pipeline that stores a first plurality of state packages of a first type and a second plurality of state packages of a second type; and
a scheduler configured to send a compute packet to the execution pipeline responsive to the first plurality of state packages and the second plurality of state packages;
wherein the execution pipeline executes the compute packet corresponding to the first and second plurality of state packages.

### Claim 18 (depends on 17)

The processor of claim 17, wherein the scheduler includes a first counter that identifies a first number of state packages of the first type stored by the execution pipeline and a second counter that identifies a second number of state packages of the second type stored by the execution pipeline.

### Claim 19 (depends on 18)

The processor of claim 18, wherein the scheduler is configured to send a compute packet to the execution pipeline if (i) the first counter does not exceed a first predetermined value and (ii) the second counter does not exceed a second predetermined value.

### Claim 20 (depends on 19)

The processor of claim 19, wherein the first predetermined value corresponds to a first number of registers that store state packages of the first type and the second predetermined value corresponds to a second number of registers that store state packages of the second type, and the first number of registers is greater than the second number of registers.

### Claim 21 (depends on 20)

The processor of claim 20, wherein the first number of registers is sixty-four registers and the second number of registers is eight registers.

### Claim 22 (depends on 17)

The processor of claim 17, wherein the scheduler identifies a state package as one of the first type or the second type based on a register address of the state package.
