Data transfer control device electronic equipment and method data transfer control

• US 7,249,204 B2
• Filed: 10/12/2004
• Issued: 07/24/2007
• Est. Priority Date: 10/15/1999
• Status: Expired due to Fees

• Current Assignee: Seiko Epson Corporation (Seiko Group)
• Original Assignee: Seiko Epson Corporation (Seiko Group)
• Inventors: Horiuchi, Hiroshi, Sato, Daisuke
• Primary Examiner(s): Huynh; Kim
• Assistant Examiner(s): Chen; Alan S.
• Application Number:
  US10/961,191
• Publication Number:
  US 20050044291A1
• Time in Patent Office: 1,015 Days
• Field of Search: 710/22, 710/33, 710 52- 54, 711/206
• US Class Current: 710/33
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/36 by determining packet size, e.g. maximum transfer unit [MTU]

Abstract

A data transfer control device and electronic equipment that make it possible to implement high-speed data transfer while observing restriction that prevent the traversing of page boundaries. A data transfer control device that conforms to the IEEE 1394 standard comprises a page table fetch circuit for fetching a page table from another node if a page table exists in a data buffer at the initiator, a page table creation circuit for creating a virtual page table if no page table exists, and an SBP-2 core for automatically dividing transfer data into a series of packets that do not traverse page boundaries based on the thus fetched or created page table and transmitting them. The page table creation circuit creates a page table in which a portion between a start address and a Kth page boundary is an X-type page table element, a portion between the Kth and Lth page boundaries is a Y-type page table element, and a portion between the Lth page boundary and an end address is a Z-type page table element.

Claims

1. A data transfer control device for transferring data among a plurality of nodes that are connected to a bus, the data transfer control device comprising:

a page table fetch circuit that operates when a page table exists in the memory of another node, to fetch the page table from the other node;

a page table creation circuit that operates when no page table exists in a memory of the other node, to create a virtual page table based on page boundary information; and

a transfer execution circuit which executes processing to divide transfer data into packets that do not traverse page boundaries, based on the thus fetched or created page table, and transmit the packets,

wherein the page table creation circuit creates a page table having a predetermined number of page table elements between Kth and Lth page boundaries of the memory of the other node, when the start address of transfer data lies between (K−

1)th and Kth page boundaries or on the Kth page boundary and when the end address of the transfer data lies between Lth and (L+1)th page boundaries or on the Lth page boundary.

2. The data transfer control device as defined in claim 1,

wherein the page table creation circuit creates a page table such that, when the start address of transfer data is between the (K−

1)th and Kth page boundaries and the end address of the transfer data is between the Lth and (L+1)th page boundaries, a portion between the start address and the Kth page boundary is a first page table element, a portion between the Kth and Lth page boundaries is a second page table element, and a portion between the Lth page boundary and the end address is a third page table element.

3. The data transfer control device as defined in claim 1,

wherein the page table creation circuit creates a page table such that, when the start address of transfer data is between the (K−

1)th and Kth page boundaries and the end address of the transfer data is between the (K−

1)th and Kth page boundaries or on the Kth page boundary, a portion between the start address and the end address is a first page table element.

4. The data transfer control device as defined in claim 1,

wherein the page table creation circuit creates a page table such that, when the start address of transfer data is between the (K−

1)th and Kth page boundaries and the end address of the transfer data is beyond the Kth page boundary, a portion between the start address and the Kth page boundary is a first page table element, and subsequent page table elements are processed assuming that the start address lies on the Kth page boundary.

5. The data transfer control device as defined in claim 1,

wherein data transfer is performed in accordance with the IEEE 1394 standard.

6. Electronic equipment comprising:

the data transfer control device as defined in claim 1;

a device for performing given processing on data that has been received from another node via the data transfer control device and the bus; and

a device for outputting or storing data that has been subjected to the processing.

7. Electronic equipment comprising:

the data transfer control device as defined in claim 1;

a device for performing given processing on data that is to be transferred to another node via the data transfer control device and the bus; and

a device for fetching data to be subjected to the processing.

8. A data transfer control method for transferring data among a plurality of nodes that are connected to a bus, the data transfer control method comprising:

fetching a page table from another node when the page table exists in a memory of the other node;

creating a virtual page table based on page boundary information when no page table exists in the memory of the other node; and

executing processing to divide transfer data into packets that do not traverse page boundaries, based on the thus fetched or created page table, and transmit the packets.

9. The data transfer control method as defined in claim 8,

wherein, when a processor has issued a transfer start command:

a page table is automatically fetched or automatically created, and

transfer data equivalent of the page table is automatically divided into a series of packets and the thus-divided series of packets is transferred continuously.

10. The data transfer control method as defined in claim 8, further comprising:

dividing transfer data into packets of a payload size, based on page table element information possessed by a page table.

11. The data transfer control method as defined in claim 8, further comprising:

storing packet control information in a control information area of a packet RAM and packet data in a data area of the packet RAM,

wherein the data area of the packet RAM is separated into a first data area for storing first data for a first layer and a second data area for storing second data for a second layer that is the object of continuous packet transfer.

12. The data transfer control method as defined in claim 11,

wherein, when a request packet for starting a transaction is transmitted to another node, instruction information for instructing the processing to be performed when a response packet will be received from the other node is comprised within transaction identification information in the requests packet;

and

wherein, when the response packet is received from the other node, control information and first and second data of the response packet are respectively written to the control information area and the first and second data areas, based on the instruction information comprised within the transaction identification information in the response packet.

13. The data transfer control method as defined in claim 8, further comprising:

storing a page table in a page table area of a packet RAM when the page table has been fetched or created.

14. The data transfer control method as defined in claim 8, further comprising:

indicating the size of a fetched page table when a page table has been fetched, or the size of a created page table when a page table has been created.

20. The data transfer control method as defined in claim 8,

wherein data transfer is performed in accordance with the IEEE 1394 standard.

15. A data transfer control method for transferring data among a plurality of nodes that are connected to a bus, the data transfer control method comprising:

creating a page table having a predetermined number of page table elements between Kth and Lth page boundaries of a memory of another node, when the start address of transfer data lies between (K−

1)th and Kth page boundaries or on the Kth page boundary and when the end address of the transfer data lies between Lth and (L+1)th page boundaries or on the Lth page boundary; and

executing processing to divide transfer data into packets that do not traverse page boundaries, based on the thus created page table, and transmit the packets.

16. The data transfer control method as defined in claim 15, further comprising:

dividing transfer data into packets of a payload size the maximum value of which is divisor of the page boundary size.

17. The data transfer control method as defined in claim 15, further comprising:

creating a page table such that, when the start address of transfer data is between the (K−

1)th and Kth page boundaries and the end address of the transfer data is between the Lth and (L+1)th page boundaries, a portion between the start address and the Kth page boundary is a first page table element, a portion between the Kth and Lth page boundaries is a second page table element, and a portion between the Lth page boundary and the end address is a third page table element.

18. The data transfer control method as defined in claim 15, further comprising:

creating a page table such that, when the start address of transfer data is between the (K−

1)th and Kth page boundaries and the end address of the transfer data is between the (K−

1)th and Kth page boundaries or on the Kth page boundary, a portion between the start address and the end address is a first page table element.

19. The data transfer control method as defined in claim 15, further comprising:

creating a page table such that, when the start address of transfer data is between the (K−

1)th and Kth page boundaries and the end address of the transfer data is beyond the Kth page boundary, a portion between the start address and the Kth page boundary is a first page table element, and subsequent page table elements are processed assuming that the start address lies on the Kth page boundary.