System and method for receiving iSCSI protocol data units

Information

  • Patent Grant
  • 7260631
  • Patent Number
    7,260,631
  • Date Filed
    Friday, December 19, 2003
    21 years ago
  • Date Issued
    Tuesday, August 21, 2007
    17 years ago
Abstract
An Internet small computer system interface (iSCSI) system, method and associated data structure are provided for receiving data in protocol data units. After a protocol data unit is received, a data list is identified that describes how the data contained in the protocol data unit is to be stored (i.e. placed, saved, etc.) in memory (i.e. application memory). Further stored is a state of the data list. To this end, the state of the data list is used in conjunction with the storage of data from a subsequent protocol data unit.
Description
FIELD OF THE INVENTION

The present invention relates to network storage, and more particularly to receiving Internet small computer system interface (iSCSI) data for storage purposes.


BACKGROUND OF THE INVENTION

The Internet small computer system interface (iSCSI) protocol is an Internet protocol (IP)-based storage networking standard for linking data storage facilities, developed by the Internet Engineering Task Force (IETF). By carrying SCSI commands over IP networks, iSCSI is used to facilitate data transfers over intranets and to manage storage over long distances.


The iSCSI protocol is among the key technologies expected to help bring about rapid development of the storage area network (SAN) market, by increasing the capabilities and performance of storage data transmission. Because of the ubiquity of IP networks, iSCSI can be used to transmit data over local area networks (LANs), wide area networks (WANs), or the Internet and can enable location-independent data storage and retrieval.


Prior art FIG. 1 illustrates a network system 100 including both a host processor 102 and a transport offload engine 104 (i.e. TOE), in accordance with the prior art. As an option, such system 100 may be implemented in the context of the iSCSI protocol. Of course, however, such system 100 may be carried out in any desired protocol context.


In use, once communication across the network 116 is established using a connection or socket, the transport offload engine 104 receives packet data [i.e. iSCSI protocol data units (PDUs), etc.]. Once received, the transport offload engine 104 stores the data contained in the PDUs in a TOE buffer 112, in order to provide time to generate a data available message 117 and send the message to the host processor 102. The foregoing operation of the transport offload engine 104 may be governed by control logic 114 of the transport offload engine 104.


In response to a data available message 117, the host processor 102 generates a data list 106 [i.e. a scatter-gather list (SGL), memory descriptor list (MDL), etc.] that describes the location(s) in application memory 110 where the incoming data is ultimately to be stored. As shown, to accomplish this, the data list 106 may include at least one memory start address where the incoming data in each PDU is to be stored, with each start address followed by the length of a region in the application memory 110.


In use, the host processor 102 generates and associates the data list 106 with a socket (also known as a connection) associated with the received PDUs that prompted the corresponding data available message(s) 117. The incoming data contained in the PDUs is then copied from the TOE buffer 112 to the application memory 110 using the locations described by the data list 106 corresponding to that socket.


Thus, to receive a large number of PDUs via the network 116, the required size of the TOE buffer 112 may become excessively large. Unfortunately, a large TOE buffer 112 can not be implemented in a cost-effective manner on an integrated-circuit transport offload engine 104, since integrating on-board memory on the transport offload engine 104 is costly in terms of silicon die area, for example.


Therefore, there is a general desire to minimize, or even altogether eliminate, memory (i.e. see, for example, TOE buffer 112, etc.) on the transport offload engine 104 for providing a cost effective transport offload engine 104.


There is thus a need for a cost effective technique of managing received PDUs using data lists (i.e. SGLs, MDLs, etc.) in the context of a transport offload engine.


SUMMARY OF THE INVENTION

An Internet small computer system interface (iSCSI) system, method and associated data structure are provided for receiving data in protocol data units. After a protocol data unit is received, a data list is identified that describes how the data contained in the protocol data unit is to be stored (i.e. placed, saved, etc.) in memory (i.e. application memory). Further stored is a state of the data list. To this end, the state of the data list is used in conjunction with the storage of data from a subsequent protocol data unit.


In one embodiment, the data list may include a scatter-gather list (SGL), a memory-descriptor list (MDL), etc. The use of an SGL or MDL is a technique to describe a non-contiguous region of memory using an ordered list of address and length pairs. As a further option, the state of the data list may be stored using a transport offload engine (TOE).


The protocol data unit may include one or more header portions and one or more data portions. Still yet, information may be extracted from the header portion(s) of the protocol data unit. Thus, the data list may be identified based on such information. Optionally, the information may include a tag. The relevant header information is then stored in a Control Block (CB) associated with a socket associated with the protocol data unit. For protocol data units that are received that contain no header portion(s), the stored tag is retrieved from the CB and used to identify the data list to be used to store the incoming data contained in the received protocol data unit. If no information is extracted from the header portion(s) of the protocol data unit, or if the information extracted identifies an invalid data list, at least the data contained in a segment (i.e. fraction) of the protocol data unit (i.e. that part that does not contain a header) may be stored in a host buffer.


In still another embodiment, data in segments of the protocol data unit may be stored using the data list until an end of the data list is detected. If the end of the data list is detected prior to all of the data in the segments of the protocol data unit being stored, the data list may be retired (that is, invalidated or discarded, etc.). Further, the data in the protocol data units that are received which would have used the aforementioned retired data list may be stored in the aforementioned host buffer.


Still yet, the state and/or contents of the data list may be updated after each use of the data list so that subsequent protocol data units that arrive may use the same aforementioned data list.


In use, the state of the data list may indicate a location (i.e. an index, etc.) in the data list, so that the data in a segment of a subsequent protocol data unit may be stored using the same data list. In other words, the data list may be re-used the next time particular information (i.e. the tag) is detected in association with a subsequent protocol data unit. Thus, multiple related protocol data units that share a tag may use the same data list. By this sharing method, various resources may thus optionally be saved such as transport offload engine memory and processor cycles. Moreover, latency may optionally be reduced by this method.





BRIEF DESCRIPTION OF THE DRAWINGS

Prior art FIG. 1 illustrates a system including both a host processor and a transport offload engine, in accordance with the prior art.



FIG. 2 illustrates a network system, in accordance with one embodiment.



FIG. 3 illustrates an exemplary architecture in which one embodiment may be implemented.



FIG. 4 illustrates an exemplary data structure associated with a data list, in accordance with one embodiment.



FIG. 5 illustrates an exemplary method for managing incoming protocol data units communicated via a network, in accordance with one embodiment.



FIG. 6 illustrates an exemplary system for managing incoming protocol data units via a network, in accordance with one embodiment.





DETAILED DESCRIPTION


FIG. 2 illustrates a network system 200, in accordance with one embodiment. As shown, a network 202 is provided. In the context of the present network system 200, the network 202 may take any form including, but not limited to a local area network (LAN), a wide area network (WAN) such as the Internet, etc.


Coupled to the network 202 are a local host 204 and a remote host 206 which are capable of communicating over the network 202. In the context of the present description, such hosts 204, 206 may include a web server, storage device or server, desktop computer, lap-top computer, hand-held computer, printer or any other type of hardware/software. It should be noted that each of the foregoing components as well as any other unillustrated devices may be interconnected by way of one or more networks.



FIG. 3 illustrates an exemplary architecture 300 in which one embodiment may be implemented. In one embodiment, the architecture 300 may represent one of the hosts 204, 206 of FIG. 2. Of course, however, it should be noted that the architecture 300 may be implemented in any desired context.


For example, the architecture 300 may be implemented in the context of a general computer system, a circuit board system, a game console system dedicated for entertainment purposes, a set-top box, a router, a network system, a storage system, an application-specific system, or any other desired system associated with the network 202.


As shown, the architecture 300 includes a plurality of components coupled via a bus 302. Included is at least one processor 304 for processing data. While the processor 304 may take any form, it may, in one embodiment, take the form of a central processing unit (CPU), a host processor, a chipset (i.e. a group of integrated circuits designed to work and sold as a unit for performing related functions, etc.), or any other desired processing device(s) capable of processing data.


Further included is processor system memory 306 which resides in communication with the processor 304 for storing the data. Such processor system memory 306 may take the form of on-board or off-board random access memory (RAM), a hard disk drive, a removable storage drive (i.e., a floppy disk drive, a magnetic tape drive, a compact disk drive, etc.), and/or any other type of desired memory capable of storing data.


In use, programs, or control logic algorithms, may optionally be stored in the processor system memory 306. Such programs, when executed, enable the architecture 300 to perform various functions. Of course, the architecture 300 may simply be hardwired.


Further shown is a transport offload engine 312 in communication with the processor 304 and the network (see, for example, network 202 of FIG. 2). In one embodiment, the transport offload engine 312 may remain in communication with the processor 304 via the bus 302. Of course, however, the transport offload engine 312 may remain in communication with the processor 304 via any mechanism that provides communication therebetween. The transport offload engine 312 may include a transport (i.e. TCP/IP, iSCSI, remote direct memory access (RDMA), etc.) offload engine (TOE), system, or any integrated circuit(s) that is capable of managing the data packets transmitted across the network.


While a single bus 302 is shown to provide communication among the foregoing components, it should be understood that any number of bus(es) (or other communicating mechanisms) may be used to provide communication among the components. Just by way of example, an additional bus may be used to provide communication between the processor 304 and processor system memory 306.


During operation, once communication across the network 116 is established using a connection or socket, the transport offload engine 312 and/or processor 304 receives packets containing protocol data units (PDUs), and uses a data list that describes how the data contained in the protocol data units is to be stored (i.e. placed, saved, etc.) in application memory (see, for example, processor system memory 306). In one embodiment, each packet may include one or more complete protocol data units, and/or a segment thereof (that is, a protocol data unit may be divided into packets or segments of various lengths). Moreover, each protocol data unit may include one or more header portion(s) and one or more data portion(s), both of various lengths. In the context of the present description, however, a protocol data unit may refer to any unit or type of packet using any suitable protocol.


After a protocol data unit is received, information is extracted from the header portion(s) of the protocol data unit that identifies a data list that is used to store the received data in the application memory. If no header portion was received in the protocol data unit, then the information used to identify the appropriate data list is retrieved from a socket control block (CB). The socket control block stores information for each established socket or connection. Further, the state of the data list is stored back in the data list itself after the protocol data unit received has been stored in application memory. While, in one embodiment, this state storage may be carried out using a transport offload engine (see, for example, transport offload engine 312), such state storage may be carried out by any components (i.e. the processor 304, etc.).


To this end, the state of the data list is used in conjunction with the storage of a subsequent protocol data unit, thus improving network communication speed and performance. Specifically, in one embodiment, the data list may be re-used the next time particular information (i.e. a tag, such as an iSCSI initiator transfer tag (ITT), a target transfer tag (TTT), an RDMA steering tag, etc.) is detected in association with a subsequent protocol data unit. Thus, multiple related protocol data units that share a tag may use a single data list. By using this sharing method, various resources may thus optionally be saved such as transport offload engine memory and processor cycles. Moreover, latency (the time required to process a protocol data unit) may optionally be reduced by this method.


More information will now be set forth regarding one exemplary data list structure, method and system by which the data list state is stored and used in the foregoing manner.



FIG. 4 illustrates an exemplary data list structure associated with a data list 400, in accordance with one embodiment. As an option, the data list 400 may be used in the context of the exemplary architecture 300 of FIG. 3. Of course, however, it should be noted that the data list 400 may be implemented in any desired context.


In one embodiment, the data list 400 may include a scatter-gather list (SGL), a memory-descriptor list (MDL), or any other data structure capable of describing how data contained in protocol data units is stored in application memory.


As shown, the data list 400 includes an object with at least one address 402 (of any desired size, e.g. 32 bits or 64 bits, etc.) that identifies the start location or locations in application memory to store the data communicated across the network. Still yet, the data list 400 may include, for each address 402, a length 404 that identifies a region in the application memory. Of course, the data list 400 may include any information that describes how the data contained in protocol data units communicated across the network is to be stored in application memory.


As further shown, the data list 400 may include additional information. In one embodiment, such additional information may take the form of a data list header. Further, the additional information may include a tag 406 (of any desired size, i.e. 32 bits, etc.). In such embodiment, the tag 406 may be kept together with the data list 400.


As will soon become apparent, the tag 406 may be used to determine whether the incoming data in a protocol data unit is to be temporarily stored in a buffer, or to be stored directly in application memory. As an option, the buffer may include a host buffer (i.e. temporary buffer, holding buffer, eddy buffer, anonymous buffer, any buffer associated with a host, etc.). Still yet, the host buffer and the application memory may separately reside in the same memory (see, for example, processor system memory 306 of FIG. 3).


Of course, the aforementioned buffer may be separate from the application memory, in any desired manner. For example, the buffer may reside on the transport offload engine as a TOE buffer. In the context of the present description, “separate” may refer to physically and/or logically separated, and/or situated in the same and/or different physical memories. With this in mind, the buffer will henceforth be referred to as a host buffer or anonymous buffer for simplicity.


To accomplish this, such tag 406 may have portions allocated for being matched to tags of received protocol data units. More information regarding such matching operation will be set forth in greater detail during reference to subsequent figures.


Still yet, a valid field 410 may be included in the data list 400 to indicate whether the data list 400 is valid. To accomplish this, the valid field 410 may include an application memory location. The manner in which such application memory location is used to verify whether the data list is valid will also be set forth hereinafter in greater detail during reference to subsequent figures.


Still yet, a data list length field 412 may be included in the data list 400 to indicate the total space in application memory provided by the data list. This total space information may be used to quickly determine if the incoming data in a protocol data unit is to be stored in application memory using the data list, or whether the data is to be stored in anonymous buffers instead.


Moreover, the data list state 408 may be included in the data list 400 for tracking a state of the data list 400. In one embodiment, the data list state 408 may include an index pointing to a location in the data list 400. As will soon become apparent, such index may be used for identifying the location where incoming data contained in protocol data units is to be stored. While an index is provided herein as an example of a state, it should be noted that the data list state 408 may include any aspect associated with the state of the data list 400.


More information will now be set forth regarding one exemplary method by which the transport offload engine may store and use the data list state as well as the other information associated with the data list 400.



FIG. 5 illustrates an exemplary method 500 for managing incoming protocol data units communicated via a network, in accordance with one embodiment. As an option, the method 500 may be carried out in the context of the exemplary architecture 300 of FIG. 3 using the data list 400 of FIG. 4. Of course, however, it should be noted that the method 500 may be implemented in any desired context. Moreover, while various functions may be attributed to exemplary components (i.e. like those set forth hereinabove), it is important to understand that the various functionality may be carried out by any desired entity.


In use, protocol data units are received using a transport offload engine (see, for example, transport offload engine 312 of FIG. 3). As shown, after a protocol data unit is received, information is extracted from the header portion of the protocol data unit. Note operation 502. As an option, such information may include a tag [i.e. iSCSI initiator transfer tag (ITT), iSCSI target transfer tag (TTT), RDMA steering tag, etc.]. In the case of ITT and TTT tags, such tags may be extracted from an Internet small computer system interface (iSCSI) protocol data unit (PDU) header.


Still yet, a sequence number is calculated. See operation 504. Such sequence number may include any number that identifies a sequence in which the protocol data unit is received. The sequence number may further be stored in the socket control block associated with the socket.


Thereafter, it is determined whether to store the incoming data in the protocol data unit using a host buffer or to store the incoming data directly in application memory using a data list (and, if so, which data list). Such determination is made based on the aforementioned information extracted in operation 502.


Specifically, it is determined what type of protocol data unit was received by examining the extracted information. Note decisions 506508. If the received protocol data unit is of an unknown type the header portion of the protocol data unit is copied to a host buffer. See operation 511. The copying of data to a host buffer or application memory may be accomplished by using a direct memory access (DMA) transfer. Moreover, a status message is sent from the transport offload engine to a processor (see, for example, processor 304 of FIG. 3). Such status message may identify the address of the host buffer where the header portion of the protocol data unit is stored, along with, for example, the length of the portion of protocol data unit stored, and connection information associated with the protocol data unit.


Table #1 illustrates an exemplary status message format. Such format is set forth for illustrative purposes only, and should not be considered as limiting in any manner.














TABLE #1







Ver
SB Length
SB Code
Socket CB Handle
















Host Buffer Address









Data Size










On the other hand, if the type of the received protocol data unit can be determined from the extracted information from decisions 506 or 508, an attempt may be made to store the data in the protocol data unit using a data list [i.e. a scatter-gather list (SGL), memory descriptor list (MDL), etc.]. Further, the extracted information from decisions 506 or 508 associated with the protocol data unit may be in the form of a tag.


In particular, if it is determined in decision 506 that the extracted information indicates that the received protocol data unit is of a first type of protocol data unit, the data list associated with the first type of protocol data unit is retrieved, in operation 510. Moreover, if it is determined in decision 508 that the extracted information indicates that the received protocol data unit is of a second type of protocol data unit, the data list associated with the second type of protocol data unit is retrieved, in operation 512. It should be noted that the data list is identified utilizing a tag extracted from the protocol data unit header as a direct pointer into memory of where the aforementioned data list is located.


Although the preceding description pertains to a technique for processing two different types of received protocol data unit, it should be noted that such exemplary operation is set forth for illustrative purposes only and should not be construed as limiting in any manner. For example, the instant functionality may equally apply to any number of different types of protocol data unit.


Next, in operation 514, the header portion of the protocol data unit is stored in the host buffer. Moreover, a status message similar to that depicted in Table #1 is sent from the transport offload engine to the processor.


It is then determined in decision 516 whether the tag extracted in operation 502 points to a data list that is valid. As an option, this determination may be accomplished by retrieving the data list at a location in application memory indicated by the tag extracted in operation 502. A valid data list may be determined by comparing a tag (see, for example, 406 of FIG. 4) with the tag extracted in operation 502 and also by examining a valid field (see, for example, 410 of FIG. 4) in the data list. If the data list is not valid, the data portion of the protocol data unit is stored in a host buffer. Moreover, a status message similar to that depicted in Table #1 is sent from the transport offload engine to the processor. See operation 517.


If, however, it is determined in decision 516 that the data list is valid, the operation continues as follows. In operation 518, a state of the data list is identified. As an option, the state of the data list may be identified by reviewing the state in the data list (see, for example, data list state 408 of FIG. 4).


The protocol data unit is then stored in application memory (see, for example, processor system memory 306 of FIG. 3) using the state and one or more data list entries in the aforementioned data list. Note operation 520. Specifically, an index associated with the state may be used to identify an entry in the data list where an address (see, for example, 402 of FIG. 4) may be found. To this end, such address in the data list is extracted and stored in the socket control block of the transport offload engine. In use, the address operates to identify a location in the application memory where data in a current segment of the protocol data unit (or the entire protocol data unit) is to be stored. It should be noted that, if a segment of the protocol data unit is received out-of-sequence, data in that segment may be stored in the aforementioned host buffer.


It is then determined whether the end of the data list has been reached in decision 522. If the end has not been reached, then the state in the data list is updated and the state is stored back in the data list. See operation 524. It is then determined if the end of the protocol data unit has been reached. See decision 528. If not, the process resets and is repeated until all of the segments (i.e. packets) of the protocol data unit are stored. If, however, it is determined that the end of the protocol data unit has been reached, a status message is sent from the transport offload engine to the processor. See operation 532.


Table #2 illustrates an exemplary status message format used to indicate that a complete protocol data unit has been received and stored in application memory. Such format is set forth for illustrative purposes only, and should not be considered as limiting in any manner.














TABLE #2







Ver
SB Length
SB Code
Socket CB Handle
















Protocol Data Unit Identifier









Returning now to decision 522, if it is determined that the end of the data list has been reached, the data list is retired (i.e. invalidated or discarded, etc.) in operation 526. This retiring operation may be accomplished using the aforementioned valid field (see, for example, 410 of FIG. 4) in the data list. Further, the data in the remaining portion(s) of the protocol data unit is copied to the aforementioned host buffer and a status message is sent from the transport offload engine to the processor. Note operation 530.


In the specific exemplary context of handling iSCSI protocol headers, the received iSCSI header may be parsed before the incoming protocol data unit containing the iSCSI header is written into a host buffer or application memory. An iSCSI bit in the socket control block for that connection may also be inspected to find out if the protocol data unit needs iSCSI processing. If the iSCSI bit is set, indicating the socket is an iSCSI socket, the following fields may be read from the transport offload engine and passed to an iSCSI interface. See Table #3.











TABLE #3









Cyclic redundancy checking (CRC) seed



2 Lengths (indicating the end of the header and the end



of the protocol data unit)



Fixed interval marker (FIM) mask



FIM offset



Length to next header



Partial double-word (dword) (from previous protocol



data units for CRC computation along with byte enable)










For iSCSI processing, it may be required that the iSCSI header parsing, fixed-interval markers (FIM) removal, and CRC checks are performed at wire speed. Such may further require that a protocol data unit is not copied to the receiver buffer or host buffer until the socket control block lookup is complete.


With respect to handling markers embedded within the protocol data units, markers may be removed by the transport offload engine irrespective of whether the incoming data contained in protocol data units is copied to host buffers or application memory.


In order to enable the host buffers anytime after the connection setup and still write to the correct offset in application memory, a particular tagging scheme may be used. In this scheme, a data list may contain a sequence number or tag starting from which, the transport offload engine may write into an address in application memory contained in a first entry of the data list.


There are two cases in which a data list is retired. Note Table #4.









TABLE #4







1. An iSCSI data-In PDU with S bit set (when the transport offload engine


is receiving data as an initiator)


2. An iSCSI data-out PDU with ‘X’ number of F bits (where X is the


number of R2Ts being serviced by the same data list - when the transport


offload engine is receiving data as a target).









More information will now be set forth regarding one exemplary system with which the transport offload engine may store and use the data list state as well as the other information associated with the data list.



FIG. 6 illustrates an exemplary system 600 for managing incoming protocol data units in a network, in accordance with one embodiment. As an option, the system 600 may be used in the context of the disclosure of the previous figures. Of course, however, it should be noted that the system 600 may be implemented in any desired context. Most importantly, the exemplary system 600 is set forth for illustrative purposes only, and should not be considered as limiting in any manner.


As shown, the system 600 includes both a transport offload engine 602 (i.e. see, for example, transport offload engine 312 of FIG. 3), as well as components 606 of a host (see, for example, host 204 of FIGS. 2 and 3). Unlike the system of prior art FIG. 1, the transport offload engine 602 of the present system 600 does not necessarily include a TOE buffer (this is optional, i.e. less/more buffering capabilities may be included).


Instead, a host buffer 616 in memory (i.e. see, for example, processor system memory 306 of FIG. 3) may be used, as needed, in the manner set forth hereinabove.


A data list 610 [i.e. a scatter-gather list (SGL), etc.] is provided to point to various locations in application memory 614 (i.e. see again processor system memory 306 of FIG. 3) where the protocol data units are stored. The data list 610 is further provided with a stored state 615. Such state 615 may be used in conjunction with the storage of a subsequent protocol data unit for improving network communication management and performance.


Specifically, multiple protocol data units (i.e. PDUs 616) may optionally be stored using a single data list. Further, this capability is optionally provided with less (if any) buffering capabilities on the transport offload engine 602, since the stored data list state is available (along with other information) ahead of time when protocol data units are received.


While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Claims
  • 1. An Internet small computer system interface (iSCSI) method for storing a state of a data list, comprising: receiving a protocol data unit including an iSCSI protocol data unit;identifying a data list describing how data in the protocol data unit is to be stored in memory;storing the data in the protocol data unit in the memory;storing a state of the data list, where the state of the data list is used in conjunction with storage of data in a subsequent protocol data unit; andextracting and storing information from a header portion of the protocol data unit in a control block;wherein the information stored in the control block is utilized for identifying the data list for use in conjunction with the subsequent protocol data unit such that a plurality of related protocol data units are stored using a single data list.
  • 2. The iSCSI method as recited in claim 1, wherein the data list includes a scatter-gather list (SGL).
  • 3. The iSCSI method as recited in claim 1, wherein the data list includes a memory-descriptor list (MDL).
  • 4. The iSCSI method as recited in claim 1, wherein the state is stored using a transport offload engine.
  • 5. The iSCSI method as recited in claim 1, wherein the protocol data unit includes the header portion and a data portion.
  • 6. The iSCSI method as recited in claim 1, wherein the information includes a tag.
  • 7. The iSCSI method as recited in claim 1, wherein the data in at least a segment of the protocol data unit is stored in a buffer if no information is extracted or if the information extracted identifies an invalid data list.
  • 8. The iSCSI method as recited in claim 7, wherein the buffer includes a host buffer.
  • 9. The iSCSI method as recited in claim 7, wherein the buffer includes a transport offload engine buffer.
  • 10. The iSCSI method as recited in claim 1, wherein a valid field is used to determine whether the data list is valid.
  • 11. The iSCSI method as recited in claim 1, wherein the data in segments of the protocol data unit are stored using the data list until an end of the data list is detected.
  • 12. The iSCSI method as recited in claim 11, wherein the data list is retired if the end of the data list is detected prior to the data in all of the segments of the protocol data unit being stored.
  • 13. The iSCSI method as recited in claim 11, wherein the data in the protocol data unit is stored in a buffer if the end of the data list is detected prior to the data in all of the segments of the protocol data unit being stored.
  • 14. The iSCSI method as recited in claim 1, wherein the data in segments of the protocol data unit are stored using the data list until an end of the protocol data unit is detected.
  • 15. The iSCSI method as recited in claim 14, wherein the state of the data list is stored if the end of the protocol data unit is detected.
  • 16. The iSCSI method as recited in claim 1, wherein the state indicates a location in the data list.
  • 17. The iSCSI method as recited in claim 1, wherein if the data in a segment of the protocol data unit is received out-of-sequence, the data in the segment is stored in a buffer.
  • 18. The iSCSI method as recited in claim 1, wherein the memory includes application memory.
  • 19. The iSCSI method as recited in claim 1, wherein the state of the data list is updated after each use of the data list so that the subsequent protocol data unit is capable of using the data list.
  • 20. A method for storing a state of a data list, comprising: receiving an Internet small computer system interface (iSCSI) protocol data unit;identifying a data list describing how data in the protocol data unit is to be stored in memory;storing the data in the protocol data unit in the memory;storing a state of the data list, where the state of the data list is used in conjunction with storage of data in a subsequent protocol data unit; andextracting information from a header portion of the protocol data unit and storing the information in a control block;wherein the information stored in the control block is utilized fox identifying the data list for use in conjunction with the subsequent protocol data unit such that a plurality of related protocol data units are stored using a single data list.
  • 21. A transport offload engine sub-system, comprising: a transport offload engine in communication with a processor and a network, the transport offload engine for identifying a data list describing how data in a received Internet small computer system interface (iSCSI) protocol data unit is to be stored in memory, and storing a state of the data list;wherein the state of the data list is used in conjunction with storage of data in a subsequent protocol data unit;wherein information is extracted from a header portion of the protocol data unit and stored in a control block;wherein the information stored in the control block is utilized for identifying the data list for use in conjunction with the subsequent protocol data unit such that a plurality of related protocol data units are stored using a single data list.
  • 22. A system, comprising: a processor;a transport offload engine in communication with the processor and a network via a bus, the transport offload engine for identifying a data list describing how data in a received Internet small computer system interface (iSCSI) protocol data unit is to be stored in memory, and storing a state of the data list;wherein the state of the data list is used in conjunction with storage of data in a subsequent protocol data unit;wherein information is extracted from a header portion of the protocol data unit and stored in a control block,wherein the information stored in the control block is utilized for identifying the data list for use in conjunction with the subsequent protocol data unit such that a plurality of related protocol data units are stored using a single data list.
  • 23. A data list data structure embodied on a computer readable medium, comprising: a data list object for describing how data in a received Internet small computer system interface (iSCSI) protocol data unit is to be stored in memory;wherein the data list object has stored associated therewith a state of the data list object that is used by a transport offload engine during storage of data in a subsequent protocol data unit;wherein information is extracted from a header portion of the protocol data unit and stored in a control block;wherein the information stored in the control block is utilized for identifying the data list object for use in conjunction with the subsequent protocol data unit such that a plurality of related protocol data units are stored using a single data list object.
  • 24. A method for use in association with a transport offload engine, comprising: receiving an Internet small computer system interface (iSCSI) protocol data unit, the protocol data unit including a header portion and a data portion;extracting information from the header portion of the protocol data unit, the information including a tag;determining whether to store data in the protocol data unit using a buffer or a data list based on the information;if it is determined that the data in the protocol data unit is to be stored using the buffer: storing the header portion of the protocol data unit in the buffer, andsending a status message to a processor; andif it is determined that the data in the protocol data unit is to be stored using the data list: identifying the data list based on the information, the data list describing how the data in the protocol data unit is to be stored in memory,identifying a state of the data list,storing the data in segments of the protocol data unit in the memory based on the state,repeating the storing until all of the data in the segments of the protocol data unit are stored, andif all of the data in the segments of the protocol data unit are stored, storing the state of the data list;wherein the state of the data list is used in conjunction with the storage of data in a subsequent protocol data unit;wherein the information from the header portion of the protocol data unit is stored in a control block;wherein the information stored in the control block is utilized for identifying the data list for use in conjunction with the subsequent protocol data unit such that a plurality of related protocol data units are stored using a single data list.
  • 25. The method as recited in claim 24, wherein the buffer includes a host buffer.
  • 26. The method as recited in claim 24, wherein the buffer includes a transport offload engine buffer.
  • 27. An Internet small computer system interface (iSCSI) method, comprising: receiving a protocol data unit including an iSCSI protocol data unit;storing at least a portion of the protocol data unit in memory;storing a state, where the state is used in conjunction with handling of a subsequent protocol data unit; andextracting information from a header portion of the protocol data unit and storing the information in a control block;wherein the information stored in the control block is utilized for identifying a data list for use in conjunction with the subsequent protocol data unit such that a plurality of related protocol data units are stored using a single data list.
US Referenced Citations (228)
Number Name Date Kind
212889 Bridenthal, Jr. Mar 1879 A
4807111 Cohen et al. Feb 1989 A
4839851 Maki Jun 1989 A
5012489 Burton et al. Apr 1991 A
5056058 Hirata et al. Oct 1991 A
5161193 Lampson et al. Nov 1992 A
5163131 Row et al. Nov 1992 A
5307413 Denzer Apr 1994 A
5426694 Hebert Jun 1995 A
5430727 Callon Jul 1995 A
5440551 Suzuki Aug 1995 A
5455599 Cabral et al. Oct 1995 A
5485460 Schrier et al. Jan 1996 A
5495480 Yoshida Feb 1996 A
5499353 Kadlec et al. Mar 1996 A
5513324 Dolin, Jr. et al. Apr 1996 A
5519704 Farinacci et al. May 1996 A
5544357 Huei Aug 1996 A
5546453 Hebert Aug 1996 A
5566170 Bakke et al. Oct 1996 A
5577105 Baum et al. Nov 1996 A
5577172 Vatland et al. Nov 1996 A
5577237 Lin Nov 1996 A
5581686 Koppolu et al. Dec 1996 A
5596702 Stucka et al. Jan 1997 A
5598410 Stone Jan 1997 A
5619650 Bach et al. Apr 1997 A
5621434 Marsh Apr 1997 A
5625678 Blomfield-Brown Apr 1997 A
5625825 Rostoker et al. Apr 1997 A
5634015 Chang et al. May 1997 A
5636371 Yu Jun 1997 A
5640394 Schrier et al. Jun 1997 A
5650941 Coelho et al. Jul 1997 A
5663951 Danneels et al. Sep 1997 A
5664162 Dye Sep 1997 A
5666362 Chen et al. Sep 1997 A
5675507 Bobo, II Oct 1997 A
5678060 Yokoyama et al. Oct 1997 A
5680605 Torres Oct 1997 A
5687314 Osman et al. Nov 1997 A
5696899 Kalwitz Dec 1997 A
5699350 Kraslavsky Dec 1997 A
5701316 Alferness et al. Dec 1997 A
5727149 Hirata et al. Mar 1998 A
5734852 Zias et al. Mar 1998 A
5734865 Yu Mar 1998 A
5748905 Hauser et al. May 1998 A
5754540 Liu et al. May 1998 A
5754556 Ramseyer et al. May 1998 A
5761281 Baum et al. Jun 1998 A
5778178 Arunachalam Jul 1998 A
5790546 Dobbins et al. Aug 1998 A
5790676 Ganesan et al. Aug 1998 A
5802287 Rostoker et al. Sep 1998 A
5802306 Hunt Sep 1998 A
5805816 Picazo, Jr. et al. Sep 1998 A
5809235 Sharma et al. Sep 1998 A
5815516 Aaker et al. Sep 1998 A
5818935 Maa Oct 1998 A
5826032 Finn et al. Oct 1998 A
5854750 Phillips et al. Dec 1998 A
5870549 Bobo, II Feb 1999 A
5870622 Gulick et al. Feb 1999 A
5872919 Wakeland Feb 1999 A
5877764 Feitelson et al. Mar 1999 A
5894557 Bade et al. Apr 1999 A
5909546 Osborne Jun 1999 A
5918051 Savitzky et al. Jun 1999 A
5920732 Riddle Jul 1999 A
5923892 Levy Jul 1999 A
5935268 Weaver Aug 1999 A
5937169 Connery et al. Aug 1999 A
5941988 Bhagwat et al. Aug 1999 A
5943481 Wakeland Aug 1999 A
5946487 Dangelo Aug 1999 A
5966534 Cooke et al. Oct 1999 A
5968161 Southgate Oct 1999 A
5974518 Nogradi Oct 1999 A
5991299 Radogna et al. Nov 1999 A
5999974 Ratcliff et al. Dec 1999 A
6014699 Ratcliff et al. Jan 2000 A
6034963 Minami et al. Mar 2000 A
6046980 Packer Apr 2000 A
6049857 Watkins Apr 2000 A
6061368 Hitzelberger May 2000 A
6061742 Stewart et al. May 2000 A
6076115 Sambamurthy et al. Jun 2000 A
6078736 Guccione Jun 2000 A
6081846 Hyder et al. Jun 2000 A
6092110 Maria et al. Jul 2000 A
6092229 Boyle et al. Jul 2000 A
6098188 Kalmanek, Jr. et al. Aug 2000 A
6101543 Alden et al. Aug 2000 A
6122670 Bennett et al. Sep 2000 A
6151625 Swales et al. Nov 2000 A
6157955 Narad et al. Dec 2000 A
6172980 Flanders et al. Jan 2001 B1
6172990 Deb et al. Jan 2001 B1
6173333 Jolitz et al. Jan 2001 B1
6182228 Boden Jan 2001 B1
6185619 Joffe et al. Feb 2001 B1
6208651 Van Renesse et al. Mar 2001 B1
6226680 Boucher May 2001 B1
6230193 Arunkumar et al. May 2001 B1
6233626 Swales et al. May 2001 B1
6247060 Boucher Jun 2001 B1
6247068 Kyle Jun 2001 B1
6327625 Wang et al. Dec 2001 B1
6330659 Poff et al. Dec 2001 B1
6334153 Boucher Dec 2001 B2
6341129 Schroeder et al. Jan 2002 B1
6345301 Burns et al. Feb 2002 B1
6347347 Brown et al. Feb 2002 B1
6389479 Boucher May 2002 B1
6389537 Davis et al. May 2002 B1
6393487 Boucher May 2002 B2
6397316 Fesas, Jr. May 2002 B2
6427169 Elzur Jul 2002 B1
6427171 Craft et al. Jul 2002 B1
6427173 Boucher Jul 2002 B1
6430628 Connor Aug 2002 B1
6434620 Boucher et al. Aug 2002 B1
6460080 Shah et al. Oct 2002 B1
6470415 Starr Oct 2002 B1
6530061 Labatte Mar 2003 B1
6591302 Boucher Jul 2003 B2
6609225 Ng Aug 2003 B1
6629141 Elzur et al. Sep 2003 B2
6658480 Boucher Dec 2003 B2
6687758 Craft Feb 2004 B2
6697868 Craft et al. Feb 2004 B2
6735647 Boyd et al. May 2004 B2
6738874 Zsohar May 2004 B2
6751665 Philbrick et al. Jun 2004 B2
6757746 Boucher Jun 2004 B2
6807581 Starr Oct 2004 B1
6845403 Chadalapaka Jan 2005 B2
6918019 Zsohar Jul 2005 B2
6938092 Burns Aug 2005 B2
6941386 Craft et al. Sep 2005 B2
6965941 Boucher Nov 2005 B2
6996070 Starr et al. Feb 2006 B2
7042898 Blightman May 2006 B2
20010021949 Blightman Sep 2001 A1
20010023460 Boucher Sep 2001 A1
20010027496 Boucher Oct 2001 A1
20010036196 Brightman Nov 2001 A1
20010037397 Boucher Nov 2001 A1
20010037406 Philbrick et al. Nov 2001 A1
20010047433 Boucher Nov 2001 A1
20020055993 Shah et al. May 2002 A1
20020085562 Hufferd et al. Jul 2002 A1
20020087732 Boucher Jul 2002 A1
20020091844 Craft Jul 2002 A1
20020095519 Philbrick Jul 2002 A1
20020105972 Richter et al. Aug 2002 A1
20020107903 Richter et al. Aug 2002 A1
20020120899 Gahan et al. Aug 2002 A1
20020147839 Boucher Oct 2002 A1
20020156927 Boucher Oct 2002 A1
20020161919 Boucher Oct 2002 A1
20020163888 Grinfeld Nov 2002 A1
20030005142 Elzur et al. Jan 2003 A1
20030005143 Elzur et al. Jan 2003 A1
20030014544 Pettey Jan 2003 A1
20030016669 Pfister et al. Jan 2003 A1
20030031172 Grinfeld Feb 2003 A1
20030046330 Hayes Mar 2003 A1
20030046418 Raval et al. Mar 2003 A1
20030056009 Mizrachi et al. Mar 2003 A1
20030058870 Mizrachi et al. Mar 2003 A1
20030061505 Sperry et al. Mar 2003 A1
20030066011 Oren Apr 2003 A1
20030079033 Craft Apr 2003 A1
20030084185 Pinkerton May 2003 A1
20030095567 Lo et al. May 2003 A1
20030099254 Richter et al. May 2003 A1
20030115350 Uzrad-Nali et al. Jun 2003 A1
20030115417 Corrigan Jun 2003 A1
20030128704 Mizrachi et al. Jul 2003 A1
20030140124 Burns Jul 2003 A1
20030145101 Mitchell et al. Jul 2003 A1
20030145270 Holt Jul 2003 A1
20030167346 Craft Sep 2003 A1
20030200284 Philbrick Oct 2003 A1
20040003126 Boucher Jan 2004 A1
20040030757 Pandya Feb 2004 A1
20040030770 Pandya Feb 2004 A1
20040030806 Pandya Feb 2004 A1
20040037299 Pandya Feb 2004 A1
20040037319 Pandya Feb 2004 A1
20040054613 Boucher Mar 2004 A1
20040062245 Sharp et al. Apr 2004 A1
20040062246 Boucher Apr 2004 A1
20040064578 Boucher Apr 2004 A1
20040064589 Boucher Apr 2004 A1
20040064590 Starr Apr 2004 A1
20040073703 Boucher Apr 2004 A1
20040078462 Philbrick Apr 2004 A1
20040088262 Boucher May 2004 A1
20040093411 Elzur et al. May 2004 A1
20040100952 Boucher May 2004 A1
20040111535 Boucher Jun 2004 A1
20040117509 Craft Jun 2004 A1
20040148377 Zsohar Jul 2004 A1
20040158640 Philbrick Aug 2004 A1
20040158793 Blightman Aug 2004 A1
20040165588 Pandya Aug 2004 A1
20040210320 Pandya Oct 2004 A1
20040240435 Boucher Dec 2004 A1
20050066046 Chadalapaka Mar 2005 A1
20050071131 Anderson et al. Mar 2005 A1
20050108492 Zsohar May 2005 A1
20050120141 Zur et al. Jun 2005 A1
20050122986 Starr et al. Jun 2005 A1
20050131986 Haagens et al. Jun 2005 A1
20050141561 Craft Jun 2005 A1
20050160139 Boucher Jul 2005 A1
20050165985 Vangal et al. Jul 2005 A1
20050175003 Craft Aug 2005 A1
20050182841 Sharp Aug 2005 A1
20050187939 Krithivas Aug 2005 A1
20050198198 Craft Sep 2005 A1
20050204058 Philbrick Sep 2005 A1
20050278459 Boucher Dec 2005 A1
20060009952 Anderson et al. Jan 2006 A1
20060010238 Craft Jan 2006 A1
Foreign Referenced Citations (32)
Number Date Country
4595297 May 1998 AU
7364898 Nov 1998 AU
4435999 Dec 1999 AU
723724 Sep 2000 AU
0070603 Mar 2001 AU
734115 Jun 2001 AU
0741089 Nov 2001 AU
0228874 May 2002 AU
2265692AA May 1998 CA
2287413AA Nov 1998 CA
2328829AA Dec 1999 CA
2265692 Aug 2001 CA
1237295 Dec 1999 CN
1266512 Sep 2000 CN
1305681 Jul 2001 CN
1460805 Sep 2004 EP
1460818 Sep 2004 EP
447205 Jul 2001 TW
448407 Aug 2001 TW
WO 9821655 May 1998 WO
WO 9850852 Nov 1998 WO
WO 9965219 Dec 1999 WO
WO 0113583 Feb 2001 WO
WO 0128179 Apr 2001 WO
WO 0239302 May 2002 WO
WO 02059757 Aug 2002 WO
WO 02086674 Oct 2002 WO
WO 03021443 Mar 2003 WO
WO 03021447 Mar 2003 WO
WO 03021452 Mar 2003 WO
WO 03079612 Sep 2003 WO
WO 2005057880 Jun 2005 WO