The present invention relates to computing systems.
A computer network, often simply referred to as a network, is a group of interconnected computers and devices that facilitates communication among users and allows users to share resources. Adapters are typically used during network communication. Continuous efforts are being made to improve network communication.
The various embodiments of the present system and methods have several features, no single one of which is solely responsible for their desirable attributes. Without limiting the scope of the present embodiments as expressed by the claims that follow, their more prominent features now will be discussed briefly. After considering this discussion, and particularly after reading the section entitled “Detailed Description” one will understand how the features of the present embodiments provide various advantages.
In one embodiment, a machine implemented method is provided. The method includes receiving a request having an address and a unique identifier from an application from among a plurality of processor-executable applications; comparing the retrieved address and the unique identifier with information maintained by a data structure associating unique identifiers assigned to a plurality of constructs with unique addresses assigned to the plurality of application; and processing the request if the retrieved address and the unique identifier matches the information maintained by the data structure.
In another embodiment, a machine implemented method is provided. The method includes assigning an address to each of a plurality of processor executable applications; assigning a unique identifier to each construct generated by the plurality of applications; maintaining a data structure associating the address with the unique identifier assigned to each construct; receiving a request having an address and a unique identifier from an application from among the plurality of applications; retrieving the address and the unique identifier from the request; comparing the retrieved address and the unique identifier with information maintained by the data structure; and processing the request if the retrieved address and the unique identifier matches with information of the data structure.
In yet another embodiment, a system is provided. The system includes a computing system executing a plurality of applications, where each application is assigned an address by an adapter operationally coupled to the computing system. The adapter assigns a unique identifier to each construct generated by the plurality of applications; maintains a data structure associating the address with the unique identifier assigned to each construct; receives a request having an address and a unique identifier from an application from among the plurality of applications; retrieves the address and the unique identifier from the request; compares the retrieved address and the unique identifier with information maintained by the data structure; and processes the request if the retrieved address and the unique identifier matches with information of the data structure.
This brief summary has been provided so that the nature of the disclosure may be understood quickly. A more complete understanding of the disclosure can be obtained by reference to the following detailed description of the embodiments thereof concerning the attached drawings.
The various present embodiments relating to selectable initialization for adapters now will be discussed in detail with an emphasis on highlighting the advantageous features. These novel and non-obvious embodiments are depicted in the accompanying drawings, which are for illustrative purposes only. These drawings include the following figures, in which like numerals indicate like parts:
The following detailed description describes the present embodiments with reference to the drawings. In the drawings, reference numbers label elements of the present embodiments. These reference numbers are reproduced below in connection with the discussion of the corresponding drawing features.
As a preliminary note, any of the embodiments described with reference to the figures may be implemented using software, firmware, hardware (e.g., fixed logic circuitry), manual processing, or a combination of these implementations. The terms “logic”, “module”, “component”, “system”, and “functionality”, as used herein, generally represent software, firmware, hardware, or a combination of these elements. For instance, in the case of a software implementation, the terms “logic”, “module”, “component”, “system”, and “functionality” represent program code that performs specified tasks when executed on a processing device or devices (e.g., CPU or CPUs). The program code can be stored in one or more computer readable memory devices.
More generally, the illustrated separation of logic, modules, components, systems, and functionality into distinct units may reflect an actual physical grouping and allocation of software, firmware, and/or hardware, or can correspond to a conceptual allocation of different tasks performed by a single software program, firmware program, and/or hardware unit. The illustrated logic, modules, components, systems, and functionality may be located at a single site (e.g., as implemented by a processing device), or may be distributed over a plurality of locations.
The term “machine-readable media” and the like refers to any kind of medium for retaining information in any form, including various kinds of storage devices (magnetic, optical, static, etc.). Machine-readable media also encompasses transitory forms for representing information, including various hardwired and/or wireless links for transmitting the information from one point to another.
The embodiments disclosed herein, may be implemented as a computer process (method), a computing system, or as an article of manufacture, such as a computer program product or computer-readable media. The computer program product may be computer storage media, readable by a computer device, and encoding a computer program of instructions for executing a computer process. The computer program product may also be a propagated signal on a carrier, readable by a computing system, and encoding a computer program of instructions for executing a computer process.
An adapter interface 22 facilitates the ability of the computing system 12 to interface with the adapter 14, as described below. The computing system 12 also includes other devices and interfaces 24, which may include a display device interface, a keyboard interface, a pointing device interface, etc. The details of these components are not germane to the inventive embodiments.
The computing system 12 may further include a storage device 26, which may be for example a hard disk, a CD-ROM, a non-volatile memory device (flash or memory stick) or any other device. Storage 26 may store operating system program files, application program files, and other files. Some of these files are stored on storage 26 using an installation program. For example, the processor 18 may execute computer-executable process steps of an installation program so that the processor 18 can properly execute the application program.
Memory 28 also interfaces to the computer bus 20 to provide the processor 18 with access to memory storage. Memory 28 may include random access main memory (RAM). When executing stored computer-executable process steps from storage 26, the processor 18 may store and execute the process steps out of RAM. Read only memory (ROM, not shown) may also be used to store invariant instruction sequences, such as start-up instruction sequences or basic input/output system (BIOS) sequences for operation of a keyboard (not shown).
With continued reference to
The adapter 14 interfaces with the computing system 12 via the link 30 and a host interface 32. In one embodiment, the host interface 32 may be a Peripheral Component Interconnect (PCI) Express interface coupled to a PCI Express link (for example, link 30). The adapter 14 may also include a processor that executes firmware instructions out of memory 36 to control overall adapter 14 operations. Memory 36 may also include the process steps, according to one embodiment.
The adapter 14 may also include storage 37, which may be for example non-volatile memory, such as flash memory, or any other device. The storage 37 may store executable instructions and operating parameters that can be used for controlling adapter operations.
The adapter 14 includes a network module 42 that interfaces with network 16 via a network interface 52 and link 50 for handling network traffic. In one embodiment, the network interface 42 includes logic and circuitry for handling network packets, for example, Ethernet or any other type of network packets. The network module 42 may include memory buffers (not shown) to temporarily store information received from other network devices 54 and transmitted to other network devices 54.
The adapter 14 may also include a storage module 46 for handling storage traffic to and from storage devices 56. The storage module 46 may further include memory buffers (not shown) to temporarily store information received from the storage devices 56 and transmitted by the adapter 14 to the storage devices 56. In one embodiment, the storage module 46 is configured to process storage traffic according to the Fibre Channel storage protocol, or any other protocol.
The adapter 14 also includes a network interface 52 that interfaces with a link 50 via one or more ports (not shown). The network interface 52 includes logic and circuitry to receive information via the link 52 and pass it to either the network module 42 or the storage module 46.
In one embodiment, an application 62 is executed for performing a task, for example, generating a request for sending information to another device. Application 62 may use the untrusted driver 64b for certain operations for efficiency purposes because application 62 does not have to operate within an operating system 60 context. Application 62 uses the trusted driver 64a for making certain system calls via operating system 60.
In one embodiment, application 62 may initiate an operation request on behalf of a construct. The request may be sent to adapter 14 via the untrusted adapter driver 64b. The term construct as used herein may mean an object or structure that is maintained by computing system 12/adapter 14 (including firmware 66) for performing a certain task. For example, a construct may be maintained for sending or receiving information to/from another device, for arming or disarming interrupts, event notifications and others.
Typically, to provide isolation, adapter 14 will have access to a dedicated register 75a-75n and 77a-77n for each construct 74a-74n and 76a-76n (or a dedicated adapter register is assigned to each application 62a-62n). An address 71a-71n and 73a-73n is assigned to each construct 74a-74n and 76a-76n to access the dedicated registers. When a request for a particular construct is sent by an application via link 30 and received by host interface 32, based on the address, the assigned register 75a-75n/77a-77n is accessed and a command is placed at a storage location from among 79a-79n and 87a-87n. Adapter 14 retrieves the command from the storage location and then processes the command.
The use of dedicated registers for each construct or for each application, as shown in
Adapter 14 also includes a processor executable construct handle module 72 (may also be referred to as module 72) for generating a unique handle (or identifier) for each construct 74a-74n/76a-76n. In one embodiment, when applications 62a-62n create the plurality of constructs 74a-74n/76a-76n, then module 72 assigns the unique handle for the construct and provides the unique handle to the application. The unique handle is associated with an interconnect address 83-83n/85a-85n and may be stored as a data structure 72a (may also be referred to as mapping data structure) at a memory location, for example, 36 and/or 37. The data structure 72a is used by adapter 14 to securely process application requests, as described below in more detail.
Referring back to
In block S304, a unique handle 78a is generated for the construct 74a, and an interconnect address 78b is associated with the construct. The unique handle 78a is generated by module 72 and returned to the application 62a. Adapter 14 maintains the data structure 72a that associates the unique handle 78a with the address 78b at a memory location, according to one embodiment.
In block S306, application 62a sends a request 78 (
In block S308, adapter 14 retrieves an outstanding command from command storage location 70, for example, entry 70a. Adapter 14 retrieves the unique handle 78a and the address from request 78. The retrieved handle is used to lookup data structure 72a. If the retrieved address and handle match with information stored at mapping data structure 72a, then the command 78d from request 78 is processed in block S310A. If the retrieved handle and address do not match with information at data structure 72a, then the request 78 is ignored in block S310b.
The embodiments disclosed herein allow adapter 14 to isolate requests for different constructs of different applications without having to use dedicated registers for each application. If a malicious application attempts to send a request on behalf of a construct it does not own, adapter 14 ignores the request because the request will not include the appropriate unique handle and the assigned address that is maintained by adapter 14.
Although the present disclosure has been described with reference to specific embodiments, these embodiments are illustrative only and not limiting. Many other applications and embodiments of the present invention will be apparent in light of this disclosure and the following claims. References throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Therefore, it is emphasized and should be appreciated that two or more references to “an embodiment” or “one embodiment” or “an alternative embodiment” in various portions of this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures or characteristics being referred to may be combined as suitable in one or more embodiments of the invention, as will be recognized by those of ordinary skill in the art.
Number | Name | Date | Kind |
---|---|---|---|
4168469 | Parikh et al. | Sep 1979 | A |
5724510 | Arndt et al. | Mar 1998 | A |
6073178 | Wong et al. | Jun 2000 | A |
6178505 | Schneider et al. | Jan 2001 | B1 |
6317754 | Peng | Nov 2001 | B1 |
6457053 | Satagopan et al. | Sep 2002 | B1 |
6678283 | Teplitsky | Jan 2004 | B1 |
6735619 | Sawada | May 2004 | B1 |
6757746 | Boucher et al. | Jun 2004 | B2 |
6785728 | Schneider et al. | Aug 2004 | B1 |
6804700 | Terek et al. | Oct 2004 | B1 |
6920485 | Russell | Jul 2005 | B2 |
6965988 | Hansmann et al. | Nov 2005 | B1 |
7260648 | Tingley et al. | Aug 2007 | B2 |
7409472 | Iwatani et al. | Aug 2008 | B2 |
7603130 | Anantha | Oct 2009 | B2 |
7865752 | Brabenac | Jan 2011 | B2 |
8019837 | Kannan et al. | Sep 2011 | B2 |
8068503 | Desai et al. | Nov 2011 | B2 |
8089896 | Tokunaga et al. | Jan 2012 | B2 |
8095577 | Faibish et al. | Jan 2012 | B1 |
8166175 | Schmieder et al. | Apr 2012 | B2 |
8171295 | Munetoh et al. | May 2012 | B2 |
8271663 | Jayadevan et al. | Sep 2012 | B2 |
8463910 | Hatasaki et al. | Jun 2013 | B2 |
8654680 | Subramanian et al. | Feb 2014 | B2 |
20010003192 | Ramsay et al. | Jun 2001 | A1 |
20020124108 | Terrell et al. | Sep 2002 | A1 |
20040030787 | Jandel et al. | Feb 2004 | A1 |
20040083299 | Dietz et al. | Apr 2004 | A1 |
20040093317 | Swan | May 2004 | A1 |
20040179508 | Thubert et al. | Sep 2004 | A1 |
20040243727 | Chung | Dec 2004 | A1 |
20040259531 | Wood et al. | Dec 2004 | A1 |
20050021702 | Rangarajan et al. | Jan 2005 | A1 |
20050071472 | Arndt et al. | Mar 2005 | A1 |
20050073982 | Corneille et al. | Apr 2005 | A1 |
20050078681 | Sanuki et al. | Apr 2005 | A1 |
20050080920 | Bender et al. | Apr 2005 | A1 |
20050086264 | Masuda | Apr 2005 | A1 |
20050086462 | Vorbach | Apr 2005 | A1 |
20050129040 | Kiel et al. | Jun 2005 | A1 |
20050138242 | Pope et al. | Jun 2005 | A1 |
20060077971 | Fowler | Apr 2006 | A1 |
20060114899 | Toumura et al. | Jun 2006 | A1 |
20060187922 | Sumiyoshi et al. | Aug 2006 | A1 |
20060212537 | Hans et al. | Sep 2006 | A1 |
20070133041 | Tredoux et al. | Jun 2007 | A1 |
20070203943 | Adlung et al. | Aug 2007 | A1 |
20070232323 | Spriestersbach | Oct 2007 | A1 |
20080005432 | Kagawa | Jan 2008 | A1 |
20080040322 | Rucker et al. | Feb 2008 | A1 |
20080059607 | Schneider | Mar 2008 | A1 |
20080183893 | Boden | Jul 2008 | A1 |
20080215524 | Fuchs et al. | Sep 2008 | A1 |
20080298274 | Takashige et al. | Dec 2008 | A1 |
20090300066 | Guo et al. | Dec 2009 | A1 |
20100023582 | Pedersen et al. | Jan 2010 | A1 |
20100046517 | Chida | Feb 2010 | A1 |
20100049861 | Cleghorn et al. | Feb 2010 | A1 |
20100054260 | Pandey et al. | Mar 2010 | A1 |
20100128605 | Chavan et al. | May 2010 | A1 |
20100185868 | Grecia | Jul 2010 | A1 |
20100217847 | Cook et al. | Aug 2010 | A1 |
20100237984 | Zenaty | Sep 2010 | A1 |
20100267368 | Masputra | Oct 2010 | A1 |
20100306829 | Nishio | Dec 2010 | A1 |
20110058573 | Balakavi et al. | Mar 2011 | A1 |
20110107156 | Miyata et al. | May 2011 | A1 |
20110141512 | Coleman et al. | Jun 2011 | A1 |
20110225226 | Archer et al. | Sep 2011 | A1 |
20110225297 | Archer et al. | Sep 2011 | A1 |
20110277019 | Pritchard, Jr. | Nov 2011 | A1 |
20110320600 | Froeding et al. | Dec 2011 | A1 |
20110320759 | Craddock et al. | Dec 2011 | A1 |
20120042054 | Kotha et al. | Feb 2012 | A1 |
20120042095 | Kotha et al. | Feb 2012 | A1 |
20120159552 | Zhou et al. | Jun 2012 | A1 |
20120185846 | Recio et al. | Jul 2012 | A1 |
Number | Date | Country |
---|---|---|
2381652 | Oct 2011 | EP |