Patent Grant
8332526
Many data communication protocols that are still in use today, such as the SMB (Server Message Block) protocol, were developed at a time when computing resources were very different, e.g., network bandwidth was typically limited and memory was very precious. As a result, when used in contemporary networks, such protocols may limit overall performance. For example, because of having been designed when memory was limited, small buffer sizes are used, requiring more round trips to communicate large amounts of data.
Moreover, the existing SMB protocol has other limitations that have become apparent over time. For example, the existing SMB protocol is susceptible to denial of service attacks; the design of the protocol makes it difficult to fight these attacks. Likewise, the method for ensuring packet security is cumbersome. Also, there is no current mechanism for performing quality of service-like operations, in that a trusted client, for example, obtains the same server resources as an untrusted client.
Although various revisions, or dialects, of the SMB protocol have been developed over time, each those dialects are essentially patch-based approaches that tweak various parts to add some additional features. Thus, extensibility is not straightforward. In sum, while still a frequently-used and valuable protocol, existing SMB versions are less than ideal when used with contemporary network resources.
Briefly, various aspects of the present invention are directed towards a data communication protocol, which a client and server use for communication, such as for file sharing. The client sends a negotiation packet to a server that identifies a set of protocol dialects the client understands. The packet is in a format such that without requiring another request, a server incapable of communicating via the second data communication protocol will indicate the first communication protocol should be used. If the server is capable of communicating via the second data communication protocol, it will respond as such. The client will invoke a driver that handles communication with the server via the corresponding protocol indicated by the server. In one example implementation, the second communication protocol is SMB 2.0 or greater.
Other aspects and enhancements of the protocol may include a create command with additional context data attached, and a compound command comprising a plurality of related commands or unrelated commands. Still other aspects and enhancements include a multi-channel command related to requesting data transfer on a separate data channel, a signed capability verification request to ensure that a secure connection is established, and the ability to transfer extended error data from the server in response to a request.
When a server receives a compound request, the server determines whether the compound request contains unrelated commands or related commands. When the compound request contains unrelated commands, each request is handled as a separate request, otherwise, when the compound request contains related commands, each request is handled sequentially. When the related commands including a create/open command, the file handle from the create/open command is used for each subsequent related command at the server, e.g., without needing to wait for the handle back from the client.
Other advantages will become apparent from the following detailed description when taken in conjunction with the drawings.
The present invention is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements and in which:
Exemplary Operating Environment
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to: personal computers, server computers, hand-held or laptop devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, one of variety of network appliance devices, such as print servers or printers themselves, as well as NAS storage devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, and so forth, which perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in local and/or remote computer storage media including memory storage devices.
With reference to
The computer 110 typically includes a variety of computer-readable media. Computer-readable media can be any available media that can be accessed by the computer 110 and includes both volatile and nonvolatile media, and removable and non-removable media. By way of example, and not limitation, computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by the computer 110. Communication media typically embodies computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above should also be included within the scope of computer-readable media.
The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation,
The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media, described above and illustrated in
The computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in
When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160 or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
Data Communication Protocol
Various aspects of the technology described herein are directed towards a data communication protocol, such as a later version (2.x or greater) of the SMB protocol. In one example implementation generally described herein, the SMB protocol is used for file data transfer. However, as can be readily appreciated, the present invention is not limited to file data, let alone any particular implementation or examples described herein. Instead, numerous ways to implement the present invention are feasible, including for use in communication with printers, named data pipes, generic devices and so forth. As such, the present invention is not limited to any of the particular file-based examples used herein, but rather may be used numerous ways that provide benefits and advantages in computing in general.
Other various aspects of the technology described herein are directed towards a new revision of SMB upon which file-server interaction may be built. As will be understood, a more lightweight protocol is provided that supports existing (up-level) functionality, along with being more scalable and easier to update with new features.
Turning to
Network file system commands from an application program 206 are handled by a client redirector component 208, which communicates with a counterpart common network module (SRVNET) 210 to carry out the commands on the file system 212. Before such commands are processed, a communication protocol that the client and server agree upon, generally the most recent version/dialect that both understand, is negotiated.
In general, the client 202 establishes a connection and then negotiates with the server 204 to ultimately set up a session, as generally represented in
In one example implementation, a client SMB engine component 220 provides a packet to a server (e.g., the server 204) that indicates that the client 202 is negotiating at least an SMB 1.0 session. For a client 202 that speaks both the SMB1 dialects and the new SMB2 revision of the protocol, the client may send a traditional SMB1 negotiate packet, but that further contains an indication that this packet is actually requesting SMB 2.x, if available. An SMB2-capable server will detect this request and respond with an SMB2 negotiate response. More particularly, to indicate that the client 202 is capable of SMB 2.x, the SMB 1.0 negotiation packet includes a set of dialect strings, one of which indicates that the client is also capable of SMB 2.x communication.
The client 202 thus sends an initial negotiate that includes the minor revision numbers that the client 202 supports. One current revision is 0 (zero), i.e., SMB 2.0; in the future, a client may claim to support any subset of the dialect revisions.
When the server 204 receives the packet, it will respond based on its capabilities. A server 204 may respond with an SMB 1.0 negotiation response, along with any 1.x dialect information, or if capable of SMB 2.x communication, will respond with an SMB 2.0 negotiation response. A particular SMB dialect revision may also be returned that matches one of the dialect strings, ordinarily the largest numbered version that the server 204 can handle among the dialect versions that the client 202 provided.
To this end, once the server 204 knows which dialect revisions the client 202 speaks, it compares these to the revisions that the server 204 understands, and returns the preferred common dialect revision (which will usually be the highest). For example, if the server supports dialects 1-8, but the client only supports 1, 2 and 4, the server will return 4. This gives the client 202 a clear understanding of which commands it will be able to send to the server 204. To select which dialect to use, the SRVNET module 210 essentially starts a negotiation, handing the packet to each SMB provider 2221-222m that it has, from highest to lowest in order with respect to versions/dialects, until one SMB provider agrees to handle this communication session based on the packet contents. Thereafter, communications on this connection are routed to that provider, in this example the SMB 2.0 provider 222m.
At the client end, the SMB engine component 220 receives the response, and based on the version/dialect information in the response, knows which client SMB component 2241-224n to use to communicate with the server. In this manner, both the client 202 and server 204 agree on which SMB dialect to use for a given session. Note that a client may have multiple SMB components 2241-224n running at the same time, each a different version/dialect, whereby, for example, a client may be communicating with one server over SMB 1.x at the same time the client is communicating with another server over SMB 2.x.
The server 204 also returns other information to the client, including a security mode which tells the client 202 whether the server 204 will require security signatures. Note that previously, security signatures were available, however the first few (e.g., capabilities negotiation) packets were in the clear, whereby an attacker could force a client into a lower-level protocol in which the attacker knows its vulnerabilities.
Secure connect operates by providing another, capabilities verification round-trip that is signed, (regardless of whether signing is enabled or not).
The server 204 may return capabilities bits for the server, e.g., whether the server is DFS (Distributed File System) aware, and whether it is LWIO (Lightweight IO) capable. The client 202 disregards any capability bits it does not understand, which may happen if the server 204 has a newer version than the client's corresponding version. Other information that may be returned in the negotiate exchange includes the server's unique ID, the maximum read/write size the server will accept, a data offset hint for faster write processing, the current system time of the server, and security information used to seed authentication in the case of extended security.
Session setup handles the authentication process for a new session, which may be a multiple round-trip event. The client 202 queries the local security system for a security blob to send over the network, and sends the first session setup, filling in the capabilities, the maximum size fields, and a VcNumber, described below. The server 204 receives this blob and gives it to the security system. If the server 204 determines that more information is needed, it will return its own security blob with the error code STATUS_MORE_PROCESSING_REQUIRED. The client 202 passes this blob back to the local security system, and the process will repeat until a failure occurs or authentication is successful.
The VcNumber tells the server 204 whether there may be other connections established from this same client 202. If this is zero, the server 204 assumes no other connections have been made from this client, and will tear down any such connections it finds (assuming them to be stale). If the VcNumber is one or more, the server 204 will not tear down any existing connections.
The Channel tells the server 204 that this client 202 is attempting to establish another connection with an existing session. The session can be identified by the user/computer pair from which this session setup was received. The channels share the same TreeId/UserId/ProcessId/FileId information. For a channel authentication, the authentication blob may be a challenge-response that is encrypted across the first channel and sent back out across the second channel to allow the client 202 and server 204 to mutually authenticate each other. On a successful response, the server 204 will also notify the client 202 if it has been authenticated as Guest or as a Null user, if either is applicable.
Once a session is set up, the client 202 may perform data transfer using the various commands described below, including create, read, write and close, as well as perform file locking and directory-related operations. As described in the aforementioned “Data Communication Coordination with Sequence Numbers” patent application, when using these commands, the server is able to control the client's use of server resources. Also, the protocol provides a number of efficiency improvements with respect to what information is communicated, and how it is communicated.
As generally represented in
Command IDs and dialect revision numbers are provided for in a new SMB header, set forth below. The header has a USHORT for the command field as opposed to a UCHAR; by using the first byte of this USHORT to denote the dialect, and the latter byte to denote the command, the command table is well defined for existing commands, with a large proportion open for later expansion. In general, the client may maintain a table for each dialect that contains the pointers to the function to issue a given command. For a client with a single dialect supported, the table would be as set forth below:
For caching functionality, more information may be retrieved from the file on Close. As such, a new Close command is provided to support this new functionality. Now the client supports two dialects, and the table is as set forth below:
Note that most of the functionality stayed the same, except for the changed Close command. Also, the client can now talk to Dialect 2 servers and use the new functionality, but for Dialect 1 servers it still uses the old functionality. There are no changes to the communicating with Dialect 1 servers.
As technology evolves, new network hardware becomes available, such as capable of performing relatively much larger reads and writes. For this release, Dialect #3 is provided, whereby the table is enlarged as follows:
A client with such a table can speak the three dialects, and will take advantage of the functionality that is available in each dialect. Some advantages of using this method include that each SMB command can be mapped back to the dialect it was introduced into, because the command is made of (Dialect|Command). This makes it easy to determine when commands were introduced, and what servers support them. If the functionality for a given command is not changed in a new dialect, the code does not change. If the functionality is changed, the down-level interface code does not change, but rather new code is added to support the new functionality.
On the server side, a server dispatch table becomes a double switch between (Dialect) and (Command). This allows for logically separating the new functionality in the code, making it easier to understand and change.
Turning to one aspect of the protocol that provides efficiency, multiple commands may be compounded into a single packet, (or some lesser number of packets). Complex tasks may thus be performed in a manner that reduces the number of round trips between the client 202 and server 204. By way of example, a compound request packet may contain a command to create/open a file, a command to write to the file and a command read from the file. Compounding thus works with related operations, (e.g., having the same file handle) and also provides for unrelated operations to be combined.
An example of compounding related requests is generally represented in
Compounding in SMB2 is simpler than the complex rules that existed in SMB1. To this end, the SMB2_HEADER (detailed below) contains a “NextOffset” that is used to identify the offset of the header of the next command from the header of the current command. Each command has its own SMB2_HEADER, including a separate MessageId. The server response or responses may come as a single compounded response, or as separate responses, as represented in
For unrelated messages, the commands will always be processed as if they were received separately. This allows a redirector or intermediate component to automatically compound packets that are unrelated. A delay may be used to obtain packets to compound, particularly if the delay time is small relative to the round-trip time. Because the server treats them as received separately, the server need not be otherwise modified to unpack such compound unrelated requests. The entity that performed the compounding may have to separate any compound responses, however, since the server may combine otherwise separate responses.
The related mode allows the client to send a series of commands that are to be executed in sequence with the result of one command potentially being used in the next command. Such commands share the same Session/Process/Tree/File ID, they will be executed sequentially, and will stop processing on the first error. If there were other commands to process after the failure, the operations are immediately failed with STATUS_NOT_PROCESSED. An example of how this may be used is to pair a Session Setup with a Tree Connect. If the session fails to be established, the tree connect will never be attempted and will fail with STATUS_NOT_PROCESSED. If the session setup succeeds, the tree connect is done using the SessionId from the session setup command. The same method could be used to do a Create followed by a QueryFileInformation, or even a Create-Read-Close set.
Conditional and implied compounding are also feasible. For example, a conditional compound command may be sent, such as open and also read if the file is less than 64 KB, thus opening and automatically obtaining small files in one round trip, but only opening large files. Implied compounding, such as automatically returning directory enumeration data in response to an open directory request, even if not expressly requested, may also cut down round trips. The benefits and advantages to such enhanced compounding increase in high-latency networks.
Another way in which the protocol facilitates improved efficiency is via multiple channel communication. Between a client and server, a transport connection for commands may be used, with a command that specifies an alternate channel to stream data. For example, a read request may specify the offset and length as well as an alternate channel to read data into; a write request operates similarly.
Streaming data on an alternate channel provides a number of benefits, includes eliminating the need to include and process packet headers. The client can pre-post a buffer and have the data streamed therein, eliminating the need to copy from one buffer to another as in conventional single-channel communication. Fairness is another benefit, in that, for example, one request on the control channel will not have to wait for a large amount of data (e.g., 5 GB) to complete be transmitted before that other request is handled, because the 5 GB will go over the data channel.
As multiple NIC's are becoming more common, the protocol takes advantage of any available network bandwidth. This includes working across multiple connections for the same session, regardless of the transport (or NIC) on which they are established. Specialized hardware may be employed.
Thus, with SMB 2.x, a session is not bound to a connection. Instead, multiple “channels” may be established that exist across different physical connections. Sessions can exist on each of these connections, and the IDs used to refer to files and processes are common across channels. This allows for having a normal channel for doing namespace operations and creates, but using specialized network hardware for reads and writes when available. Still further, small network glitches may not result in lost data, because as long as one channel remains open to a session, the session stays alive. Various implementation details are described herein with reference to the Session Setup command and the Read/Write commands.
By way of example, consider a client that establishes a connection over simple TCP to the server over an enterprise's public network. This is the first connection, so it is always channel 0. Once both sides detect that they have a private network for doing data transfers, (e.g., each has a gigabit card), the client and server may establish a second connection over this card, as channel 1. While the client is browsing some files, the directory queries are being sent over channel 0, while the data is being sent over channel 1. If the client wants to browse into some directories that are encrypted on the server, when the client requests the data, the redirector realizes that the data is sensitive, so it establishes a new channel (channel 2) to the server that has IP Sec (IP security) active on it. When the client requests the sensitive data, it will ask it be sent over channel 2, while normal less-sensitive data could continue to come over channel 1 (as it is faster).
As can be readily appreciated, the opportunity for QoS and security improvements, along with the simple bandwidth gain, provides significant benefits. Note that on a channel read/write, the server/client can lay down the receive buffer before any data is read, so the mechanism can further eliminate the need to copy out of the data movement, which can also improve server/client scalability.
Further, SMB error packets are allowed to be tagged with arbitrary data. Thus, a description of why something failed, which may provide value. Symbolic link evaluation is one example where tagging with arbitrary data provides a client with useful information, as generally represented in
Example Protocol Definition
The new header is a 64-byte structure (e.g., twice the size of one current structure).
Protocol is simply the protocol identifier, to identify the packet. For the existing SMB implementations, this consists of {0xFF, ‘S’, ‘M’, ‘B’ }. For the new protocol this shall be {0xFE, ‘S’, ‘M’, ‘B’ }.
StructureSize identifies the size of the SMB2_HEADER structure, and will be used for minor versioning within the Header itself, if other changes are introduced later on.
Epoch represents the “version count” of a server. This is incremented when a server is cycled (or the server service is stopped and started) to indicate to the client whether the server might have maintained state across a disconnect. This is for future use with persistent handles, and can be considered “Reserved” for the time being.
Status gives the error status for a given operation, as in the existing SMB implementation.
Command identifies the command for the packet, as described herein.
CreditsGranted/CreditsRequested are used by the client on a send to request more credits, and by the server on the response to grant more credits within the new credit management scheme, as described in the related patent application entitled “Data Communication Coordination with Sequence Numbers.”
Flags related to the message include:
#define SMB2_FLAGS_SERVER_TO_REDIR 0x00000001
When present, indicates the message is a response as opposed to a request
#define SMB2_FLAGS_ASYNC_COMMAND 0x00000002
On response, the server returns STATUS_PENDING with this flag set to indicate that we are processing it asynchronously.
#define SMB2_FLAGS_RELATED_OPERATIONS 0x00000004
Set on a client message send of a compounded message to indicate that the operations are related, so the file opened in the Create is used as the FileId for later operations.
#define SMB2_FLAGS_SIGNED 0x00000008
Set when the packet has been signed. The receiver should verify the signature. The key used for signing is based on the session that sent the packet.
#define SMB2_FLAGS_DFS_OPERATION 0x10000000
This is a DFS operation. The server should allow DFS to munge the name. This could be replaced with a create option.
MessageId Identifies a message being sent with its response.
ProcessId describes the client-side identification of the process issuing the command.
SessionId identifies the established session for the command, or 0 if no session is being used.
TreeId Identifies the tree connect for the command, or 0 if no tree connect is being used.
AsyncId: as described in the related patent application entitled “Data Communication Coordination with Sequence Numbers,” message IDs are actually sequence numbers, and the window of available sequence numbers is always set to slide to the right. A command that will run for an extremely long time (such as a named-pipe read or change-notification, or a create that pends on an oplock break, any of which can block indefinitely) may hold up the ability of the window to slide. To work around this issue, the server can optionally respond to any command with STATUS_PENDING and setting the SMB2_FLAGS_ASYNC_COMMAND flag mentioned above and providing a unique identifier in place of the Session/Tree/ProcessId. This means the client can continue sliding the window as if it received a response. At some point later, the true response will come with a matching AsyncId (and CommandId) to satisfy the request. In the event that the client wants to cancel such a command, the client sends a cancel with the flag set and the matching AsyncId.
The security signature is the same as in the previous protocol, except that there is no longer a hidden index number. The index is not necessary with the use of sequence numbers for the MID. (This prevents replayability directly). This allows the use of security signatures without forcing the operations to be sequenced on their way to the transport.
NextCommand is the offset of the next command in the message from the beginning of this header. Messages should be quad-aligned. The use of the SMB2_FLAGS_RELATED_COMMAND allows various abilities for compounding, as described above.
Command Formats
Negotiate
As described above, the client and server exchange negotiate request and response as part of the handshake that helps them determine each other's capabilities.
Session Setup
As described above, Session Setup handles the authentication process for a new session.
Logoff
Logs off an existing session.
This command tears down the session with the SessionId Specified in the header. Open files are closed, and other Existing structures (tree connects, etc.) are torn down. No More operations can be processed for the given SessionId.
Tree Connect
Creates a tree connection to a shared resource on the server machine.
The client issues this command to the server to establish a tree connection. The Path is of the form \\server\share and is filled into the buffer. Inclusion of the server name allows for features like share scoping.
On successful response from the server, the client receives the TreeId in the header along with the ShareFlags and ShareCapabilities. Currently, the share flags indicate to the client what the CSC caching properties are for a share, but more may be added later on. The capabilities tell the client whether the file system backing the share supports either file-level security, timewarp, TxF (transactional file system), or client-side encryption. If a file system supports these properties on some subtrees but not all (such as the case of mount points), it should return that it does support them and simply fail the individual requests to use them in cases where it is not allowed. The client should ignore any flags or capabilities it does not understand.
Tree Disconnect
Tears down an existing TreeConnect.
Once the command is processed, no more operations can be successfully completed on the given TreeId. The TreeId is taken from the header.
Create
Opens a file, printer, or pipe.
The create request is a variable length request to allow creation of files with various attributes other than the traditional well-defined attributes. The standard case (where no extended attributes are present) is straightforward; the client fills in the RootDirectoryFid (for a relative open if desired), the DesiredAccess, FileAttributes, ShareAccess, CreateDisposition, and CreateOptions. They set the desired oplock level, and fill in the SecurityFlags & Impersonation level for QoS. Currently there are no SmbCreateFlags defined but space has been allocated for their use. The client sends this packet to the server, which opens the file and either returns a failure code, or returns Success along with the FileId that identifies the file, the Creation/LastAccess/LastWrite/LastChangeTime, the AllocationSize and EndOfFile information, and the FileAttributes.
That is the normal case that operates in much the same way that the current protocol does. For more advanced cases, consider that the user wants to create a file with extended attributes (EAs). In the previous protocol, there was an entirely different way of handling this, through a Transact call. Now, the client can build up the create request as normal, but also add a CreateContext to the end of the create request. The request would have the name “ExtA” and the Data would contain the EAs to set on the file. When the server receives this, it would parse out the EA data and issue it with the create. Create contexts can also be returned on the create response to provide additional information. For the first iteration, the names will be of length 4 so we can format them as a long and switch on them. The current list of CreateContext's is as follows:
A client sends a Close to close an instance of a file that was opened previously. Once a close is processed, no file operations are allowed on the previous FID.
For the Close command, the client specifies the FileId of the file being closed, along with the LastWriteTime (in SystemTime format). This allows the client to set the last time a cached write was performed on the file as the last written time on the file. The client can also send zero for the LastWriteTime to indicate that they do not wish to specify one. The structure also allots room for Close flags which are currently undefined, but may be used at a later point.
Flush
A flush command informs the server to flush out all cached data on a given file.
Upon successful response from the server, the client is guaranteed that all cached data has been flushed to its backing persistent store. The client specifies the FileId of the file it wishes to flush. A flush on a pipe will not return until all data is consumed from that pipe, which may take a while.
Read
Reads data from an open file.
Read is pretty self explanatory. The client specifies the file (via FileId), the offset, and the length of the read, and the server returns the data. There are a couple other things the client can specify. The MinCount tells the server the minimum amount it will read from a file for a successful return. If the read comes up short, the server will simply return a failure instead of returning the entire data buffer. The client can also recommend Padding for better processing. This is the offset into the read response packet where the server should put the data. This allows the client to lay down the read response buffers in a more efficient way when it receives the information off the transports. The remaining field indicates to the server how much the entire read will be for if this is only a section of the read. Thus, if the client is going to read 8 k in 1 k chunks, it would issue a read for 1 k with Remaining=7 k. This allows the server the option to optimize by reading the entire 8 k in one operation and buffering the data back to the client.
On the server response, it indicates how much data it is returning (in the DataLength field) along with the DataRemaining that was specified in the read command.
If the channel specified in the command is not the channel that the command came in on, than the user is asking for a channel read. This means that if I request a read on channel 0 with “channel=1” and “Length=0, Remaining=64 k”, the server will respond with “DataLength=0, DataRemaining=64 k” and the next 64 k bytes that come across Channel 1 will be the data. The client is responsible for synchronizing this to make sure no data responses are outstanding on channel 1 when this command is issued. A client could also issue (on channel 0) “read Channel=1, DataLength=1 k, Remaining=7 k”, such that the response would contain the first 1 k of data and the rest of the data (the last 7 k) would be streamed across channel 1.
Write
Writes data to an open file.
The client fills in the file (identified by the FileId), the offset, and the length for the write, and attached the data. It is recommended that the data be padded as returned in the original negotiate response to help server performance. The client can also indicate how much more data it will write to the server to allow the server to optimize. On the response, the server indicates how much was written, and returns the amount it is still expecting.
If the channel specified in the write is not the channel the command came in on, than the client is asking to stream the data on another channel. An example would be a write received on channel 0 with “Channel=1, Length=0, Remaining=64 k”. The client is asking to stream a 64 k write on Channel 1. The server would respond with “Count=0, Remaining=64 k” to allow the write. The response will include and AsyncId for a second response that will come after the data is sent on the channel and ack'd. Then the next 64 k bytes streamed on Channel 1 would be the data. (No header). Upon completion, the server will send a SMB2_RESP_WRITE on channel 0 to indicate the success/failure of the operation and use the AsyncId information to send a second reply, unless the specific channel allows for inherent acknowledgement in which case it will occur on the channel itself.
BREAK_OPLOCK
Used to request and acknowledge the release of opportunistic locks taken on a file.
When another user requests access to a file that a client holds an opportunistic lock on in a fashion that requires breaking the existing lock, SRV will send an SMB2_RESP_BREAK_OPLOCK to the client. The client is then expected to send a REQ_BREAK_OPLOCK for the given file to release their oplock, and SRV will respond again to acknowledge this.
Lock
Used to request byte-range locks, and also used to request oppurtunistic locks (and inform the client when one is broken).
Syntax for the LOCK request is similar to the SMB1 Lock request. The client specifies the FileId, and one or more SMB_LOCK structures indicating the offset and length they wish to lock. All of these LOCK structures must be either locks or unlocks. However, you can mix shared and exclusive lock requests in a single batched lock operation. The most common use for lock batching would be claiming a series of locks as part of a batch oplock break, and is most useful when you are assured that all the locks will succeed.
A successful return indicates to the client that they attained (or released) the requested byte range locks. On the failure case, the byte range locks were not granted.
Echo
Echo is used by a client to determine whether a server is still up at a given point in time. Upon receipt of this command, the server will simply turn it around and return success.
The server responds to the packet to indicate it is working properly. Used to allow the client to “ping” the server.
Cancel
Used by the client to request the cancellation of a sent operation.
A cancel has no response, but should result in the command itself either being completed successfully, or failing with STATUS_CANCELLED, and it should happen as soon as possible. The operation being sent is identified because it will share the MessageId of the cancel command. This is the one case where a MessageId sent to the server may already have been used previously. If a response came with an AsyncId, that should be present in the header, and will be used to locate the command on the server.
Ioctl
Ioctl is used to issue a Device Control or a File System Control command across the network.
An IOCTL is used for issuing a generic file system or device control command across the network. It packs the input and output buffers based on the METHOD of the control code and sends them across the network. The server side than repackages them and issues the FSCTL/IOCTL against the file object. The results are likewise packed up and returned to the user with the status code. The set of allowable FSCTL/IOCTL codes can be limited by both SRV or the underlying file systems. (Not all are necessarily valid remotely.)
For buffered or direct requests, only Input is valid on request and Output is sent on response. For neither requests, both Input and Output are sent both ways.
Query Directory
Allows the client to query directory enumerations on an open directory handle across the network.
The QueryDirectory call matches existing NT semantics very closely. The caller provides the InfoClass, the FileId for the directory open, the filename portion (that specifies either the wildcard/file search params or the resume name for an existing search) and any valid SL_flags associated with the call, and SRV will return a buffer up to OutputBufferLength.
There is also a new flag (SMB2_REOPEN) that can be included in the QueryDirectory flags structure. This flag is a stronger version of the SL_RESTART_SCAN flag. The latter only allows restarting scans where the search specified hasn't changed. (i.e. restart a *.* or a t* search.) The latter tells the server to restart a scan where the search specified has changed. To use this flag, the caller must guarantee exclusive use across the call, and no outstanding operations (such as change notifies). The server takes the appropriate steps to perform this operation, which may involve closing and reopening the underlying directory handle on the server side. This is transparent to the client.
Change Notify
This potentially long-running operation allows a client to register for change notifications on a directory.
The caller sends the FileId for the directory along with a CompletionFilter specifying which changes the caller is interested in. They also can send the SL_WATCH_TREE flag to indicate a recursive notify operation. This operation will almost always invoke the “async” behavior since it can pend for an infinite amount of time. Also note that any further change notify requests on the same handle will pend waiting for the first to complete, just as in local file system behavior.
Query Info
Allows the client to query information from the remote system. Currently this can be used to query file information, file-system information, security information, or quota information.
The client specifies in the InfoType the SMB2—0_INFO_* options to indicate whether this is a request for file information, file system information, security information, or quota information. The FileId denotes the file in question (for file info or security information.) The volume the file resides on is used for file system info or quota requests.
The sub-information level is filled into FileInfoClass, and is dependent on the type of information being queried. For file information queries it will be a FILE_INFORMATION_CLASS, where as for file system information it will be a FS_INFORMATION_CLASS. For quota and security, it will be 0.
The input buffer is currently only used for Quota requests, as they take the SMB2_QUERY_QUOTA_INFO structure on input to determine what is being asked for. For the other requests it will be empty.
OutputBufferLength specifies the maximum amount of data to return to the user.
Set Info
Allows the client to set information on the remote system. Currently this can be used to set file information, file-system information, security information, or quota information.
The type of information being set and the specific class are set in the Flags and FileInfoClass fields as described for QUERY_INFO. The input buffer provided is the information being set, and the FileId identifies the file.
For SetSecurity calls, the SecurityInformation field denotes the info being set. (i.e. OWNER_SECURITY_INFORMATION, etc.)
Conclusion
While the invention is susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the invention to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention.
The present application claims priority to U.S. provisional patent application Ser. No. 60/685,008, filed May 25, 2005, and herein incorporated by reference. The present application is related to copending United States patent application entitled “Data Communication Coordination with Sequence Numbers” Ser. No. 11/182,989, filed concurrently herewith, assigned to the assignee of the present invention, and hereby incorporated by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4399504 | Obermarck | Aug 1983 | A |
| 4780821 | Crossley | Oct 1988 | A |
| 4791566 | Sudama | Dec 1988 | A |
| 4825354 | Agrawal | Apr 1989 | A |
| 4887204 | Johnson | Dec 1989 | A |
| 4891785 | Donohoo | Jan 1990 | A |
| 4914570 | Peacock | Apr 1990 | A |
| 5008853 | Bly | Apr 1991 | A |
| 5109519 | Zimmet | Apr 1992 | A |
| 5113519 | Johnson | May 1992 | A |
| 5202971 | Henson | Apr 1993 | A |
| 5218696 | Baird et al. | Jun 1993 | A |
| 5261051 | Masden et al. | Nov 1993 | A |
| 5265261 | Rubin et al. | Nov 1993 | A |
| 5313646 | Hendricks et al. | May 1994 | A |
| 5349642 | Kingdon | Sep 1994 | A |
| 5375207 | Blakely et al. | Dec 1994 | A |
| 5410697 | Baird | Apr 1995 | A |
| 5437013 | Rubin et al. | Jul 1995 | A |
| 5452447 | Nelson | Sep 1995 | A |
| 5491752 | Kaufman et al. | Feb 1996 | A |
| 5493728 | Solton | Feb 1996 | A |
| 5513314 | Kandasamy | Apr 1996 | A |
| 5522042 | Fee et al. | May 1996 | A |
| 5535375 | Eshel et al. | Jul 1996 | A |
| 5560008 | Johnson et al. | Sep 1996 | A |
| 5588117 | Karp et al. | Dec 1996 | A |
| 5628005 | Hurvig | May 1997 | A |
| 5764887 | Kells et al. | Jun 1998 | A |
| 5826027 | Pedersen et al. | Oct 1998 | A |
| 5931913 | Meriwether et al. | Aug 1999 | A |
| 5933602 | Grover | Aug 1999 | A |
| 5978802 | Hurvig | Nov 1999 | A |
| 6085247 | Parsons et al. | Jul 2000 | A |
| 6092199 | Dutcher | Jul 2000 | A |
| 6125122 | Favichia et al. | Sep 2000 | A |
| 6131125 | Rostoker et al. | Oct 2000 | A |
| 6208952 | Goertzel et al. | Mar 2001 | B1 |
| 6219799 | Kandasamy | Apr 2001 | B1 |
| 6247139 | Walker et al. | Jun 2001 | B1 |
| 6324581 | Xu et al. | Nov 2001 | B1 |
| 6349250 | Hart et al. | Feb 2002 | B1 |
| 6349350 | Hathorn et al. | Feb 2002 | B1 |
| 6401123 | Shields et al. | Jun 2002 | B1 |
| 6430691 | Di Santo et al. | Aug 2002 | B1 |
| 6438691 | Mao | Aug 2002 | B1 |
| 6452903 | Peck et al. | Sep 2002 | B1 |
| 6453354 | Jiang et al. | Sep 2002 | B1 |
| 6640226 | Shringeri et al. | Oct 2003 | B1 |
| 6658476 | Van | Dec 2003 | B1 |
| 6829473 | Raman et al. | Dec 2004 | B2 |
| 6910082 | Marcotte | Jun 2005 | B1 |
| 6928577 | Moser et al. | Aug 2005 | B2 |
| 7020651 | Ripley | Mar 2006 | B2 |
| 7103007 | Natarajan et al. | Sep 2006 | B2 |
| 7111035 | McClellan et al. | Sep 2006 | B2 |
| 7111060 | Araujo et al. | Sep 2006 | B2 |
| 7197535 | Salesky et al. | Mar 2007 | B2 |
| 7243132 | Choi | Jul 2007 | B2 |
| 7318102 | Krause et al. | Jan 2008 | B1 |
| 7330910 | Young et al. | Feb 2008 | B2 |
| 7339885 | Ahrens et al. | Mar 2008 | B2 |
| 7380080 | Hughes | May 2008 | B2 |
| 7380155 | Fung et al. | May 2008 | B2 |
| 7386889 | Shay | Jun 2008 | B2 |
| 7421502 | Czap et al. | Sep 2008 | B2 |
| 7434087 | Singh | Oct 2008 | B1 |
| 7444536 | Jairath | Oct 2008 | B1 |
| 7453879 | Lo | Nov 2008 | B1 |
| 7457722 | Shain et al. | Nov 2008 | B1 |
| 7509407 | Miller et al. | Mar 2009 | B2 |
| 7539722 | Mohamed et al. | May 2009 | B2 |
| 7664991 | Gunda et al. | Feb 2010 | B1 |
| 7702745 | Lin et al. | Apr 2010 | B2 |
| 20020019874 | Borr | Feb 2002 | A1 |
| 20020083130 | Shimada et al. | Jun 2002 | A1 |
| 20020152315 | Kagan et al. | Oct 2002 | A1 |
| 20020161980 | Nishikawa | Oct 2002 | A1 |
| 20030056069 | Cabrera et al. | Mar 2003 | A1 |
| 20030058277 | Bowman-amuah | Mar 2003 | A1 |
| 20030093678 | Bowe et al. | May 2003 | A1 |
| 20030112754 | Ramani et al. | Jun 2003 | A1 |
| 20030115341 | Sinha et al. | Jun 2003 | A1 |
| 20030126195 | Reynolds et al. | Jul 2003 | A1 |
| 20030140129 | Livnat et al. | Jul 2003 | A1 |
| 20030169859 | Strathmeyer et al. | Sep 2003 | A1 |
| 20030182282 | Ripley | Sep 2003 | A1 |
| 20040003210 | Duale et al. | Jan 2004 | A1 |
| 20040003241 | Sengodan et al. | Jan 2004 | A1 |
| 20040018829 | Raman et al. | Jan 2004 | A1 |
| 20040032876 | Garg et al. | Feb 2004 | A1 |
| 20040103342 | Moser et al. | May 2004 | A1 |
| 20040136325 | Dobric et al. | Jul 2004 | A1 |
| 20040160909 | Sheynblat | Aug 2004 | A1 |
| 20040215794 | Lauer | Oct 2004 | A1 |
| 20040260748 | Springer, Sr. et al. | Dec 2004 | A1 |
| 20040267932 | Voellm et al. | Dec 2004 | A1 |
| 20040268118 | Bazan Bejarano | Dec 2004 | A1 |
| 20050010670 | Greschler et al. | Jan 2005 | A1 |
| 20050015511 | Izmailov et al. | Jan 2005 | A1 |
| 20050015747 | Zatloukal et al. | Jan 2005 | A1 |
| 20050021832 | Bennett et al. | Jan 2005 | A1 |
| 20050041686 | Roy et al. | Feb 2005 | A1 |
| 20050055345 | Ripley | Mar 2005 | A1 |
| 20050060442 | Beverly et al. | Mar 2005 | A1 |
| 20050091212 | Mohamed et al. | Apr 2005 | A1 |
| 20050102537 | Zheng | May 2005 | A1 |
| 20050111030 | Berkema et al. | May 2005 | A1 |
| 20050114670 | Bowe et al. | May 2005 | A1 |
| 20050125378 | Kawada | Jun 2005 | A1 |
| 20050129045 | Machulsky et al. | Jun 2005 | A1 |
| 20050131832 | Fransdonk | Jun 2005 | A1 |
| 20050132077 | Biran et al. | Jun 2005 | A1 |
| 20050138528 | Ameigeiras et al. | Jun 2005 | A1 |
| 20050149817 | Biran et al. | Jul 2005 | A1 |
| 20050177635 | Schmidt et al. | Aug 2005 | A1 |
| 20050182850 | Kohno | Aug 2005 | A1 |
| 20050198113 | Mohamed et al. | Sep 2005 | A1 |
| 20050198247 | Perry et al. | Sep 2005 | A1 |
| 20050223014 | Sharma et al. | Oct 2005 | A1 |
| 20050246803 | Spencer | Nov 2005 | A1 |
| 20050248803 | Ohara | Nov 2005 | A1 |
| 20050251448 | Gropper | Nov 2005 | A1 |
| 20050257022 | Hughes | Nov 2005 | A1 |
| 20050258022 | Horton et al. | Nov 2005 | A1 |
| 20050262084 | Tomita | Nov 2005 | A1 |
| 20050262103 | Stakutis et al. | Nov 2005 | A1 |
| 20060031519 | Helliwell et al. | Feb 2006 | A1 |
| 20060041698 | Han et al. | Feb 2006 | A1 |
| 20060047818 | Kruglick et al. | Mar 2006 | A1 |
| 20060080443 | Kruglick et al. | Apr 2006 | A1 |
| 20060085328 | Cohen et al. | Apr 2006 | A1 |
| 20060095382 | Mahlbacher | May 2006 | A1 |
| 20060130107 | Gonder et al. | Jun 2006 | A1 |
| 20060168262 | Frazer | Jul 2006 | A1 |
| 20060206705 | Khosravi | Sep 2006 | A1 |
| 20060271692 | Kruse et al. | Nov 2006 | A1 |
| 20060281525 | Borissov | Dec 2006 | A1 |
| 20070171793 | Mesut et al. | Jul 2007 | A1 |
| 20080151885 | Horn et al. | Jun 2008 | A1 |
| 20080172397 | Maeda et al. | Jul 2008 | A1 |
| 20090077097 | Lacapra et al. | Mar 2009 | A1 |
| 20090138615 | Cristallo et al. | May 2009 | A1 |
| 20090172085 | Arthursson | Jul 2009 | A1 |
| 20090319661 | Shiozawa et al. | Dec 2009 | A1 |
| 20090327798 | D'Amato et al. | Dec 2009 | A1 |
| 20100185704 | George et al. | Jul 2010 | A1 |
| 20120151249 | Swan et al. | Jun 2012 | A1 |
| Number | Date | Country |
|---|---|---|
| 1 259 045 | Nov 2002 | EP |
| 1 259 045 | Nov 2002 | EP |
| 1 727 056 | Nov 2006 | EP |
| 60-019341 | Jan 1985 | JP |
| 62-297927 | Dec 1987 | JP |
| 63-205747 | Aug 1988 | JP |
| 63-256165 | Oct 1988 | JP |
| 64-061148 | Aug 1989 | JP |
| 02-101847 | Apr 1990 | JP |
| 03-048558 | Mar 1991 | JP |
| 03-074745 | Mar 1991 | JP |
| 03-245939 | Sep 1991 | JP |
| 04-172039 | Jun 1992 | JP |
| 04-229746 | Aug 1992 | JP |
| 05-089048 | Apr 1993 | JP |
| 05-143488 | Jun 1993 | JP |
| 06-075890 | Mar 1994 | JP |
| 63-061148 | Mar 1998 | JP |
| 10-313342 | Nov 1998 | JP |
| 11-055314 | Feb 1999 | JP |
| 2001-094613 | Apr 2001 | JP |
| 2003-016766 | Jan 2003 | JP |
| 2003-032727 | Feb 2003 | JP |
| 2003-069610 | Mar 2003 | JP |
| 2003-281091 | Mar 2003 | JP |
| 2003-125022 | Apr 2003 | JP |
| 2004-005427 | Jan 2004 | JP |
| 2004-139385 | May 2004 | JP |
| 2004-229143 | Aug 2004 | JP |
| 2005-322016 | Nov 2005 | JP |
| 2007-49755 | Feb 2007 | JP |
| 3967758 | Jun 2007 | JP |
| 10-1994-0001700 | Mar 1994 | KR |
| KS 10-0860152 | Sep 2008 | KR |
| 03096646 | Nov 2003 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20060271697 A1 | Nov 2006 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60685008 | May 2005 | US |
