# US 2006/0242335 A1 · Race free data transfer algorithm using hardware based polling

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

- Number: US 2006/0242335 A1
- Document ID: US20060242335A1
- Status: Published application
- Kind: A1
- Application number: 11/474,040
- Filed: 2006-06-22
- Published: 2006-10-26
- Earliest claimed: 1998-11-03
- Inventors: David Poisner; Karthi Vadivelu
- Web page: https://patentgrep.com/patent/US20060242335A1

## CPC

- G06F 13/32: using combination of interrupt and burst mode transfer
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and apparatus for a race free data transfer algorithm using hardware based polling. One disclosed method transfers information between a target device and a buffer which is one of a set of buffers. The buffer is pointed to by a current buffer value stored in a controller. The current buffer value is adjusted to point to a next buffer if the current buffer value is different than a last buffer value. One of the set of buffers is serviced utilizing either the current buffer value or the last buffer value from the controller.

## Claims

### Claim 1

A method comprising:
transferring information between a target device and one of a plurality of buffers based on a current buffer value stored in a controller, wherein the current buffer value is a first index into a buffer descriptor table and wherein the current buffer value points to the one of the plurality of buffers by pointing to a buffer descriptor offset by the first index from a buffer descriptor table base location; and
prefetching a next buffer descriptor from the buffer descriptor table.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
adjusting the current buffer value stored in the controller to point to a next buffer if the current buffer value is different than a last buffer value stored in the controller; and
servicing one of the plurality of buffers utilizing one of the current buffer value and the last buffer value from the controller.

### Claim 3 (depends on 2)

The method of claim 2, wherein servicing comprises:
retrieving the current buffer value from the controller;
comparing the current buffer value to a head pointer of a buffer list;
marking a buffer pointed to by the head pointer as being processed if the head pointer has not reached the current buffer value; and
adjusting the head pointer to point to a next potentially reclaimable buffer if the head pointer has not reached the current buffer value.

### Claim 4 (depends on 2)

The method of claim 2, wherein servicing comprises:
preparing a buffer pointed to by an incremented tail pointer; and
storing the incremented tail pointer as the last buffer value in the controller.

### Claim 5 (depends on 1)

The method of claim 1 further comprising:
testing an interrupt field to determine whether the interrupt field is set to a first value to interrupt upon completion of processing the one of the plurality of buffers; and
generating an interrupt if the interrupt field is set to the first value.

### Claim 6 (depends on 1)

The method of claim 1 further comprising:
executing a buffer underrun routine according to a command field associated with the one of the plurality of buffers if there are no further buffers available for transfer.

### Claim 7

A bus agent comprising:
a current buffer register for storing a first value indicating a first memory location for a current buffer;
a last buffer register for storing a second value indicating a second memory location for a last buffer ready for processing; and
control logic coupled to transfer data to or from the current buffer and to update the current buffer register to point to a next buffer unless the first value from the current buffer register is equivalent to the second value from the last buffer register.

### Claim 8 (depends on 7)

The bus agent of claim 7, wherein the current buffer register contains a first index value and wherein the first index value in the current buffer register indicates the first memory location by pointing to a first buffer descriptor in a buffer descriptor table, the first buffer descriptor being the first index value locations from a buffer descriptor table base.

### Claim 9 (depends on 8)

The bus agent of claim 8, wherein the last buffer register contains a second index value and wherein the second index value in the last buffer register indicates the second memory location by pointing to a second buffer descriptor in the buffer descriptor table, the second buffer descriptor being the second index value locations from the buffer descriptor table base.

### Claim 10 (depends on 7)

The bus agent of claim 7, further comprising
a prefetch buffer register, wherein the control logic is coupled to set the current buffer register equal to a value in the prefetch buffer register, to increment the value in the prefetch buffer register, and to schedule a prefetch of a buffer descriptor pointed to by the prefetch buffer register.

### Claim 11 (depends on 7)

The bus agent of claim 7, wherein the current buffer register contains a first pointer to a linked list of buffers in memory and wherein the last buffer register contains a second pointer to a last buffer in the linked list of buffers in memory.

### Claim 12

An article comprising a machine readable medium having stored thereon a plurality of instructions which, if executed by the machine, cause the machine to perform:
transferring information between a direct memory access (DMA) controller and a first buffer which is one of a plurality of buffers, the first buffer being pointed to by a current buffer register in the DMA controller;
adjusting the current buffer register to point to a next buffer if the current buffer register contains a different value than a last buffer register; and
servicing one of the plurality of buffers utilizing information contained in one of the current buffer register and the last buffer register.

### Claim 13 (depends on 12)

The article of claim 12, wherein the servicing performed by the machine further comprises:
retrieving a first value from the current buffer register;
comparing the first value to a head pointer of a buffer list;
marking the buffer pointed to by the head pointer as being processed if the head pointer has not reached the first value; and
adjusting the head pointer to point to a next potentially reclaimable buffer if the head pointer has not reached the first value.

### Claim 14 (depends on 12)

The article of claim 12, wherein the servicing performed by the machine further comprises:
preparing a buffer pointed to by an incremented tail pointer; and
storing the incremented tail pointer in last buffer register.

### Claim 15 (depends on 12)

The article of claim 12, wherein the current buffer value is a first index into a buffer descriptor table and wherein the current buffer value points to the first buffer by pointing to a buffer descriptor offset by the first index from a buffer descriptor table base location.

### Claim 16 (depends on 15)

The article of claim 15, wherein the plurality of instructions, if executed, further causes the machine to perform:
prefetching a next buffer descriptor from the buffer descriptor table.

### Claim 17 (depends on 12)

The article of claim 12, wherein the plurality of instructions, if executed, further causes the machine to perform:
testing an interrupt field to determine whether the interrupt field is set to a first value to interrupt upon completion of processing the first buffer; and
generating an interrupt if the interrupt field is set to the first value.

### Claim 18 (depends on 12)

The article of claim 12, wherein the plurality of instructions, if executed, further causes the machine to perform:
executing a buffer underrun routine according to a command field associated with the first buffer if there are no further buffers available for transfer.
