Patent Grant
9626298
This invention relates, in general, to translating addresses in a computing environment, and in particular, to translating an input/output address to a memory address usable in accessing system memory of the environment.
System memory is accessible by read and write requests. These requests may come from various components of a computing environment, including central processing units, as well as adapters. Each request includes an address that is to be used to access system memory. This address, however, typically does not have a one-to-one correspondence with a physical location in system memory. Therefore, address translation is performed.
Address translation is used to translate an address that is provided in one form not directly usable in accessing system memory to another form that is directly usable in accessing a physical location in system memory. For instance, a virtual address included in a request provided by a central processing unit is translated to a real or absolute address in system memory. As a further example, a Peripheral Component Interconnect (PCI) address provided in a request from an adapter may be translated to an absolute address in system memory.
The shortcomings of the prior art are overcome and additional advantages are provided through the provision of a computer system for translating addresses in a computing environment. The computer system comprising, for instance, an adapter; and a hardware unit coupled to the adapter, wherein the hardware unit is configured to perform a method. The method comprising, for instance, obtaining an address from the adapter to be translated, the address comprising a plurality of bits, the plurality of bits including a first portion of bits and a second portion of bits; receiving an address range value that indicates a range of permitted addresses; and converting the address to a memory address usable in accessing memory of the computing environment, the converting ignoring the first portion of bits and using the second portion of bits to obtain address information from one or more levels of address translation tables to perform the converting.
Computer program products and methods relating to one or more aspects of the present invention are also described and may be claimed herein. Further, services relating to one or more aspects of the present invention are also described and may be claimed herein.
Additional features and advantages are realized through the techniques of the present invention. Other embodiments and aspects of the invention are described in detail herein and are considered a part of the claimed invention.
One or more aspects of the present invention are particularly pointed out and distinctly claimed as examples in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
In accordance with an aspect of the present invention, a capability is provided for translating addresses in a computing environment. In one example, the addresses being translated are addresses provided by an adapter (referred to herein as input/output (I/O) addresses), which are to be translated to addresses usable in accessing system memory. To perform the address translation, a number of levels of address translation is used, and the number of levels is based on, for instance, a size of the memory address space assigned to the adapter, a size of one or more address translation tables used in the translation, and/or a size of the page (or other unit of memory) to be accessed.
The address being translated includes a plurality of bits, and in one embodiment, only a portion of those bits are used to index into the address translation tables to obtain the translated address. The other bits are ignored for translation. For instance, the address includes high order bits and low order bits (based on the size of the assigned address space). In this example, the low order bits are used to index into the address translation tables, including the page table, and to index into the page itself. The high order bits (regardless of value; i.e., zero or non-zero) are ignored for translation and are not used to index into the address translation tables. This reduces the number of levels of address translation tables used for translating. (The indication of low order and high order bits is independent of how the bits are numbered.)
In one example, the translation is performed while providing protection suitable for an enterprise class server, such as a System z® server. As an example, a full address (e.g., the entire 64-bit address) is used in accessing memory; however, only a portion of the address is used for translation. Another portion of the address, which is ignored for translation, is used for validation (e.g., a range check), along with at least a portion of the address used for translation. By using only a portion of the address for translation, address translation look-ups are minimized. This is accomplished by performing a number of levels of translation based on, for instance, the size of the DMA address space registered for access by the adapter, rather than the size of the address itself.
One embodiment of a computing environment to incorporate and use one or more aspects of the present invention is described with reference to
In one example, computing environment 100 includes one or more central processing units (CPUs) 102 coupled to a system memory 104 (a.k.a., main memory) via a memory controller 106. To access system memory 104, a central processing unit 102 issues a read or write request that includes an address used to access system memory. The address included in the request is typically not directly usable to access system memory, and therefore, it is translated to an address that is directly usable in accessing system memory. The address is translated via a translation mechanism (XLATE) 108. For example, the address is translated from a virtual address to a real or absolute address using, for instance, dynamic address translation (DAT).
The request, including the translated address, is received by memory controller 106. In one example, memory controller 106 is comprised of hardware and is used to arbitrate for access to the system memory and to maintain the memory's consistency. This arbitration is performed for requests received from CPUs 102, as well as for requests received from one or more adapters 110. Like the central processing units, the adapters issue requests to system memory 104 to gain access to the system memory.
In one example, adapter 110 is a Peripheral Component Interconnect (PCI) or PCI Express (PCIe) adapter that includes one or more PCI functions. A PCI function issues a request that requires access to system memory. The request is routed to an input/output hub 112 (e.g., a PCI hub) via one or more switches (e.g., PCIe switches) 114. In one example, the input/output hub is comprised of hardware, including one or more state machines.
As used herein, the term adapter includes any type of adapter (e.g., storage adapter, network adapter, processing adapter, PCI adapter, cryptographic adapter, other type of input/output adapters, etc.). In one embodiment, an adapter includes one adapter function. However, in other embodiments, an adapter may include a plurality of adapter functions. One or more aspects of the present invention are applicable whether an adapter includes one adapter function or a plurality of adapter functions. Moreover, in the examples presented herein, adapter is used interchangeably with adapter function (e.g., PCI function) unless otherwise noted.
The input/output hub includes, for instance, a root complex 116 that receives the request from a switch. The request includes an input/output address to be translated, and thus, the root complex provides the address to an address translation and protection unit 118. This unit is, for instance, a hardware unit that translates the I/O address to an address directly usable to access system memory 104, as described in further detail below.
The request initiated from the adapter, including the translated address, is provided to memory controller 106 via, for instance, an I/O-to-memory bus 120. The memory controller performs its arbitration and forwards the request with the translated address to the system memory at the appropriate time.
Further details regarding the system memory and the input/output hub are described with reference to
Further, in one example, system memory 104 includes address translation tables 202 used to translate an address from one that is not directly usable to access system memory to one that is directly usable. In one embodiment, there are one or more address translation tables assigned to a DMA address space, and those one or more address translation tables are configured based on, for instance, the size of the address space to which it is assigned, the size of the address translation tables themselves, and/or the size of the page (or other unit of memory).
In one example, there is a hierarchy of address translation tables. For instance, as shown in
In one example, it is an operating system that assigns a DMA address space to a particular adapter. This assignment is performed via a registration process, which causes an initialization (via, e.g., trusted software) of a device table entry 210 for that adapter. The device table entry is located in a device table 211 located in I/O hub 112. For example, device table 211 is located within the address translation and protection unit of the I/O hub.
In one example, device table entry 210 includes a number of fields, such as the following:
In one embodiment, the device table entry to be used in a particular translation is located using a requestor identifier (RID) located in a request issued by a PCI function 220 associated with an adapter (and/or by a portion of the address). The requestor id (e.g., a 16-bit value specifying, for instance, a bus number, device number and function number) is included in the request, as well as the I/O address (e.g., a 64-bit PCIe address) to be used to access system memory. The request, including the RID and I/O address, are provided to, e.g., a contents addressable memory (CAM) 230 via, e.g., a switch 114, which is used to provide an index value. For instance, the CAM includes multiple entries, with each entry corresponding to an index into the device table. Each CAM entry includes the value of a RID. If, for instance, the received RID matches the value contained in an entry in the CAM, the corresponding device table index is used to locate the device table entry. That is, the output of the CAM is used to index into device table 211 to locate device table entry 210. If there is no match, the received packet is discarded with no access to system memory being performed. (In other embodiments, a CAM or other look-up is not needed and the RID is used as the index.)
Subsequently, fields within the device table entry are used to ensure the validity of the address and the configuration of the address translation tables. For example, the inbound address in the request is checked by the hardware of the I/O hub (e.g., the address translation and protection unit) to ensure that it is within the bounds defined by PCI base address 214 and PCI limit 216 stored in the device table entry located using the RID of the request that provided the address. This ensures that the address is within the range previously registered and for which address translation tables are validly configured.
In accordance with an aspect of the present invention, in one embodiment, to translate an I/O address (i.e., an address provided by an adapter or another component of an I/O subsystem) to a system memory address (i.e., an address directly usable to access system memory), initially, a registration process is performed. This registration process registers a particular address space with a specific requestor, such as a specific adapter or adapter function. One example of an overview of this registration process is described with reference to
Initially, an operating system executing within one of the central processing units coupled to system memory determines a size and location of the address space that the adapter is to access, STEP 300. In one example, the size of the address space is determined by the PCI base address and PCI limit set by the operating system. The operating system determines the base and limit using one or more criteria. For instance, if the operating system wishes to have PCI addresses map directly to CPU virtual addresses, then the base and limit are set as such. In a further example, if additional isolation between adapters and/or operating system images is desired, then the addresses being used are selected to provide non-overlapping and disjoint address spaces. The location is also specified by the operating system, and is based, for instance, on the characteristics of the adapter.
Thereafter, one or more address translation tables are created to cover that DMA address space, STEP 302. As examples, the tables can be compatible with CPU address translation tables or a unique format can be provided that is supported by the input/output hub. In one example, the creation includes building the tables and placing the appropriate addresses within the table entries. As an example, one of the translation tables is a 4 k page table having 512 64-bit entries, and each entry includes a 4 k page address compatible with the assigned address space.
Thereafter, the DMA address space is registered for the adapter, STEP 304, as described in further detail with reference to
Initially, in one embodiment, an available device table entry is selected that is to correspond to the requestor ID of the adapter, STEP 310. That is, the requestor ID will be used to locate a device table entry.
Additionally, the PCI base address and the PCI limit are stored in the device table entry, STEP 312. Further, the format of the highest level address translation table is also stored in the device table entry (e.g., format field), STEP 314, as well as the input/output address translation (IOAT) pointer used to point to the highest level address translation table, STEP 316. This completes the registration process.
Responsive to performing registration, a DMA address space and corresponding address translation tables are ready for use, as well as a device table entry. Details regarding processing a request issued by a requestor, such as an adapter, to access system memory are described with reference to
In one embodiment, initially, a DMA request is received at the input/output hub, STEP 400. For instance, a PCI function issues a request that is forwarded to the PCI hub via, for instance, a PCI switch. Using the requestor ID in the request, the appropriate device table entry is located, STEP 402. Thereafter, a determination is made as to whether the device table entry is valid, INQUIRY 404. In one example, validity is determined by checking a validity bit in the entry itself. This bit is set, for instance, in response to execution of an enable function request by the operating system. If enabled, the bit is set to, e.g., one (i.e., valid); otherwise, it remains at zero (i.e., invalid). In a further example, the bit may be set when the registration process is complete.
If the device table entry is invalid, an error is presented, STEP 405. Otherwise, a further determination is made as to whether the PCI address provided in the request is less than the PCI base address stored in the device table entry, INQUIRY 406. If it is, then the address is outside a valid range and an error is provided, STEP 407. However, if the PCI address is greater than or equal to the base address, then another determination is made as to whether the PCI address is greater than the PCI limit value in the device table entry, INQUIRY 408. If the PCI address is greater than the limit, then once again, an error is presented since the address is outside the valid range, STEP 409. However, if the address is within a valid range, then processing continues.
In one example, the format provided in the device table entry is used to determine the PCI address bits in the address to be used for address translation, STEP 410. For instance, if the format indicates the upper level table is a first-level table with 4 k pages, then bits 29:21 of the address are used to index into the first-level table; bits 20:12 are used to index into the page table; and bits 11:0 are used to index into the 4 k page. The bits used depend on how many bits are needed to index into the given size page or table. For instance, for a 4 k page with byte level addressing, 12 bits are used to address 4096 bytes; and for a 4 k page table with 512 entries, 8 bytes each, 9 bits are used to address 512 entries, etc.
Next, the PCI hub fetches the appropriate address translation table entry, STEP 412. For instance, initially, the highest level translation table is located using the IOAT pointer of the device table entry. Then, bits of the address (those after the high order bits used for validity and not translation; e.g., bits 29:21 in the above example) are used to locate the particular entry within that table.
A determination is then made based, for instance, on the format provided in the device table entry, as to whether the located address translation entry has a correct format, INQUIRY 414. For instance, the format in the device table entry is compared with a format indicated in the address translation entry. If equal, then the format in the device table entry is valid. If not, an error is provided, STEP 415; otherwise, processing continues with a determination as to whether this is the last table to be processed, INQUIRY 416. That is, a determination is made as to whether there are other address translation tables needed to obtain the real or absolute address or whether the lowest level table entry has been located. This determination is made based on the provided format and size of the tables already processed. If it is not the last table, then processing continues with STEP 412. Otherwise, the I/O hub continues processing to enable a fetch or store of the data at the translated address, STEP 418. In one example, the I/O hub forwards the translated address to the memory controller, which uses the address to fetch or store data at the DMA location designated by the translated address.
As described above, in accordance with an aspect of the present invention, the number of levels of translation, and therefore, the number of fetches required to perform translation are reduced. This is accomplished by, for instance, ignoring the high order bits of an address during translation and only using the low order bits to traverse the translation tables, which are based, for instance, on the size of the DMA address space assigned to the adapter. The use of a partial address versus the full address is further shown in the following examples.
Referring initially to
In this example, the DMA address space (DMAAS) is 6 M in size, and each table is 4 k bytes having a maximum of 512 8-byte entries (except the 5th level table which has 128 entries based on the size of the address). The address is, for instance, 64 bits: FFFF C000 0009 C600. The beginning of the 5th-level table is pointed to by the IOAT pointer and bits 63:57 of the PCI address are used to index into the 5th-level table to locate the beginning of the 4th-level table; bits 56:48 of the PCI address are used to index into the 4th-level table to locate the beginning of the 3rd-level table; bits 47:39 are used to index into the 3rd-level table to locate the beginning of the 2nd-level table; bits 38:30 are used to index into the 2nd-level table to locate the beginning of the 1st-level table; bits 29:21 are used to index into the 1st-level table to locate the beginning of the page table; bits 20:12 are used to index the page table to locate the beginning of the page; and bits 11:0 are used to locate the entry in the 4 k page. Thus, in this example, all of the address bits are used for translation/access.
This is in contrast to the example in
As shown, 1st-level table 500 includes three entries 502, each providing an address to one of the three page tables 504. The number of page tables needed, and therefore, the number of other level tables, depends, for instance, on the size of the DMA address space, the size of the translation tables, and/or the size of the pages. In this example, the DMA address space is 6 M, and each page table is 4 k, having up to 512 entries. Therefore, each page table can map up to 2 M of memory (4 k×512 entries). Thus, three page tables are needed for the 6 M address space. The 1st-level table is able to hold the three entries, one for each page table, and thus, no further levels of address translation tables are needed, in this example.
In a further embodiment, there may be different formats of address translation tables used for address translation, and there may be variations within the formats. Thus, there are variations in the bits used to index into a particular table or page. Some of these examples are described with reference to
For instance, one format is a CPU DAT compatible format in which the translation tables are compatible with translation tables used for CPU DAT translations. There may be various CPU DAT compatible formats, examples of which are described with reference to
As depicted, as the size of the page increases, the number of levels of translation tables decreases. For instance, for 4 k page 556, a page table is needed, but it is not needed for the 1M page. Other examples and variations are possible.
Another address translation format is an I/O extended address translation format in which extended address translation tables are used. Various examples of I/O extended address translation formats are depicted in
In one particular implementation, to perform the registration of a DMA address space to the adapter, an instruction referred to as a Modify PCI Function Controls (MPFC) instruction, is used. For example, the operating system determines which address translation format it wishes to use, builds the address translation tables for that format, and then issues the MPFC instruction with that format included as an operand of the instruction. In one example, the format and other operands of the instruction are included in a function information block (described below), which is an operand of the instruction. The function information block is then used to update the DTE and, in one embodiment, optionally, a function table entry (FTE) that includes operational parameters of the adapter.
One embodiment of the details related to this instruction, and particularly the registration process, are described with reference to
In one embodiment, Field 1 designates a general register that includes various information. As shown in
In one embodiment, the function handle includes, for instance, an enable indicator indicating whether the handle is enabled, a function number that identifies an adapter function (this is a static identifier and may be used to index into a function table); and an instance number specifying the particular instance of this function handle. There is one function handle for each adapter function, and it is used to locate a function table entry (FTE) within the function table. Each function table entry includes operational parameters and/or other information associated with its adapter function. As one example, a function table entry includes:
In one example, the busy indicator, permanent error state indicator, and recovery initiated indicator are set based on monitoring performed by the firmware. Further, the permission indicator is set, for instance, based on policy; and the BAR information is based on configuration information discovered during a bus walk by the processor (e.g., firmware of the processor). Other fields may be set based on configuration, initialization, and/or events. In other embodiments, the function table entry may include more, less or different information. The information included may depend on the operations supported by or enabled for the adapter function.
Referring to
Further details regarding a function information block (FIB) are described with reference to
The function information block designated in the Modify PCI Function Controls instruction is used to modify a selected device table entry, a function table entry and/or other firmware controls associated with the adapter function designated in the instruction. By modifying the device table entry, function table entry and/or other firmware controls, certain services are provided for the adapter. These services include, for instance, adapter interruptions; address translations; reset error state; reset load/store blocked; set function measurement parameters; and set interception control.
One embodiment of the logic associated with the Modify PCI Function Controls instruction is described with reference to
In one example, the operating system provides the following operands to the instruction (e.g., in one or more registers designated by the instruction): the PCI function handle; the DMA address space identifier; an operation control; and an address of the function information block.
Referring to
Otherwise, a determination is made as to whether one or more of the operands are aligned, INQUIRY 708. For instance, a determination is made as to whether the address of the function information block is on a double word boundary. In one example, this is optional. If the operands are not aligned, then an exception condition is provided, STEP 710. Otherwise, a determination is made as to whether the function information block is accessible, INQUIRY 712. If not, then an exception condition is provided, STEP 714. Otherwise, a determination is made as to whether the handle provided in the operands of the Modify PCI Function Controls instruction is enabled, INQUIRY 716. In one example, this determination is made by checking an enable indicator in the handle. If the handle is not enabled, then an exception condition is provided, STEP 718.
If the handle is enabled, then the handle is used to locate a function table entry, STEP 720. That is, at least a portion of the handle is used as an index into the function table to locate the function table entry corresponding to the adapter function for which operational parameters are to be established.
A determination is made as to whether the function table entry was found, INQUIRY 722. If not, then an exception condition is provided, STEP 724. Otherwise, if the configuration issuing the instruction is a guest, INQUIRY 726, then an exception condition (e.g., interception to host) is provided, STEP 728. This inquiry may be ignored if the configuration is not a guest or other authorizations may be checked, if designated.
A determination is then made as to whether the function is enabled, INQUIRY 730. In one example, this determination is made by checking an enable indicator in the function table entry. If it is not enabled, then an exception condition is provided, STEP 732.
If the function is enabled, then a determination is made as to whether recovery is active, INQUIRY 734. If recovery is active as determined by a recovery indicator in the function table entry, then an exception condition is provided, STEP 736. However, if recovery is not active, then a further determination is made as to whether the function is busy, INQUIRY 738. This determination is made by checking the busy indicator in the function table entry. If the function is busy, then a busy condition is provided, STEP 740. With the busy condition, the instruction can be retried, instead of dropped.
If the function is not busy, then a further determination is made as to whether the function information block format is valid, INQUIRY 742. For instance, the format field of the FIB is checked to determine if this format is supported by the system. If it is invalid, then an exception condition is provided, STEP 744. If the function information block format is valid, then a further determination is made as to whether the operation control specified in the operands of the instruction is valid, INQUIRY 746. That is, is the operation control one of the specified operation controls for this instruction. If it is invalid, then an exception condition is provided, STEP 748. However, if the operation control is valid, then processing continues with the specific operation control being specified.
One operation control that may be specified is a register I/O address translation parameters operation used in controlling address translations for an adapter. With this operation, the PCI function parameters relevant to I/O address translation are set in the DTE, FTE and/or other location from the appropriate parameters of the FIB, which is an operand to the instruction. These parameters include, for instance, the PCI base address; the PCI address limit (a.k.a., PCI limit or limit); the address translation format; the page size; and the I/O address translation pointer, which are operands to this operation. There are also implied operands, including a starting DMA address (SDMA) and an ending DMA address (EDMA), which are stored in a location accessible to the processor executing the instruction.
One embodiment of the logic to establish the operational parameters for I/O address translation is described with reference to
If the size of the address space exceeds the translation capacity, then an exception condition is provided, STEP 810. Otherwise, a further determination is made as to whether the base address is less than the starting DMA address, INQUIRY 812. If so, then an exception condition is provided, STEP 814. Otherwise, another determination is made as to whether the address limit is greater than the ending DMA address, INQUIRY 816. If so, then an exception condition is provided, STEP 818. In one example, the starting DMA address and ending DMA address are based on a system-wide policy.
Thereafter, a determination is made as to whether sufficient resources, if any are needed, are available to perform an I/O address translation, INQUIRY 820. If not, then an exception condition is provided, STEP 822. Otherwise, a further determination is made as to whether the I/O address translation parameters have already been registered in the FTE and DTE, INQUIRY 824. This is determined by checking the values of the parameters in the FTE/DTE. For instance, if the values in the FTE/DTE are zero or another defined value, then registration has not been performed. To locate the FTE, the handle provided in the instruction is used, and to locate the DTE, a device index in the FTE is used.
If the adapter function has already been registered for address translation, then an exception condition is provided, STEP 826. If not, then a determination is made as to whether the DMA address space that is specified is valid (i.e., is it an address space for which a DTE has been enabled), INQUIRY 828. If not, then an exception condition is provided, STEP 830. If all the checks are successful, then the translation parameters are placed in the device table entry and optionally, in the corresponding function table entry (or other designated location), STEP 832. For instance, the PCI function parameters relevant to I/O address translation are copied from the function information block and placed in the DTE/FTE. These parameters include, for instance, the PCI base address, the PCI address limit, the translation format, the page size, and the I/O address translation pointer. This operation enables DMA accesses to the specified DMA address space. It enables I/O address translation for the adapter function.
Another operation control that may be specified by the Modify PCI Function Controls instruction is an unregister I/O address translation parameters operation, an example of which is described with reference to
Referring to
Described in detail above is an efficient mechanism for translating an input/output address provided by an adapter to a system memory address. In one example, the full PCI address (e.g., the entire 64-bit address) is used in accessing memory; however, address translation look-ups are minimized by only using a portion of the address for translation. While use of the full address provides added protection, the use of, for instance, only the lower order bits for translation allows more efficient translation by means of less levels of translation look-up. This allows for operating system flexibility in using addresses that can co-exist with or be the same as operating system virtual addresses. Further, it allows CPU address translation tables to be shared by adapters, while allowing the I/O to reduce the number of tables that need to be scanned. Further, additional protection is provided in allowing different adapters and/or operating systems to use disjoint address space ranges.
In the embodiments described herein, the adapters are PCI adapters. PCI, as used herein, refers to any adapters implemented according to a PCI-based specification as defined by the Peripheral Component Interconnect Special Interest Group (PCI-SIG), including but not limited to, PCI or PCIe. In one particular example, the Peripheral Component Interconnect Express (PCIe) is a component level interconnect standard that defines a bi-directional communication protocol for transactions between I/O adapters and host systems. PCIe communications are encapsulated in packets according to the PCIe standard for transmission on a PCIe bus. Transactions originating at I/O adapters and ending at host systems are referred to as upbound transactions. Transactions originating at host systems and terminating at I/O adapters are referred to as downbound transactions. The PCIe topology is based on point-to-point unidirectional links that are paired (e.g., one upbound link, one downbound link) to form the PCIe bus. The PCIe standard is maintained and published by the PCI-SIG.
Other applications filed on the same day include: U.S. Ser. No. 12/821,171, filed Jun. 23, 2010, entitled “Runtime Determination Of Translation Formats For Adapter Functions,” Craddock et al., (POU920100007US1); U.S. Ser. No. 12/821,172, filed Jun. 23, 2010, entitled “Resizing Address Spaces Concurrent To Accessing The Address Spaces,” Craddock et al., (POU920100009US1); U.S. Ser. No. 12/821,174, filed Jun. 23, 2010, entitled “Multiple Address Spaces Per Adapter,” Craddock et al., (POU920100010US1); U.S. Ser. No. 12/821,175, filed Jun. 23, 2010, entitled “Converting A Message Signaled Interruption Into An I/O Adapter Event Notification,” Craddock et al., (POU920100014US1); U.S. Ser. No. 12/821,177, filed Jun. 23, 2010, entitled “Converting A Message Signaled Interruption Into An I/O Adapter Event Notification To A Guest Operating System,” Brice et al., (POU920100015US1); U.S. Ser. No. 12/821,178, filed Jun. 23, 2010, entitled “Identification Of Types Of Sources Of Adapter Interruptions,” Craddock et al., (POU920100016US1); U.S. Ser. No. 12/821,179, filed Jun. 23, 2010, entitled “Controlling A Rate At Which Adapter Interruption Requests Are Processed,” Belmar et al., (POU920100017US1); U.S. Ser. No. 12/821,181, filed Jun. 23, 2010, entitled “Controlling The Selectively Setting Of Operational Parameters For An Adapter,” Craddock et al., (POU920100018US1); U.S. Ser. No. 12/821,182, filed Jun. 23, 2010, entitled “Load Instruction for Communicating with Adapters,” Craddock et al., (POU920100019US1); U.S. Ser. No. 12/821,184, filed Jun. 23, 2010, entitled “Controlling Access By A Configuration To An Adapter Function,” Craddock et al., (POU920100020US1); U.S. Ser. No. 12/821,185, filed Jun. 23, 2010, entitled “Discovery By Operating System Of Information Relating To Adapter Functions Accessible To The Operating System,” Coneski et al., (POU920100021US1); U.S. Ser. No. 12/821,187, filed Jun. 23, 2010, entitled “Enable/Disable Adapters Of A Computing Environment,” Coneski et al., (POU920100022US1); U.S. Ser. No. 12/821,190, filed Jun. 23, 2010, entitled “Guest Access To Address Spaces Of Adapter,” Craddock et al., (POU920100023US1); U.S. Ser. No. 12/821,191, filed Jun. 23, 2010, entitled “Managing Processing Associated With Hardware Events,” Coneski et al., (POU920100025US1); U.S. Ser. No. 12/821,192, filed Jun. 23, 2010, entitled “Operating System Notification Of Actions To Be Taken Responsive To Adapter Events,” Craddock et al., (POU920100026US1); U.S. Ser. No. 12/821,193, filed Jun. 23, 2010, entitled “Measurement Facility For Adapter Functions,” Brice et al., (POU920100027US1); U.S. Ser. No. 12/821,194, filed Jun. 23, 2010, entitled “Store/Store Block Instructions for Communicating with Adapters,” Craddock et al., (POU920100162US1); U.S. Ser. No. 12/821,224, filed Jun. 21, 2010, entitled “Associating Input/Output Device Requests With Memory Associated With A Logical Partition,” Craddock et al., (POU920100045US1); U.S. Ser. No. 12/821,247, filed Jun. 23, 2010, entitled “Scalable I/O Adapter Function Level Error Detection, Isolation, And Reporting,” Craddock et al., (POU920100044US1); U.S. Ser. No. 12/821,256, filed Jun. 23, 2010, entitled “Switch Failover Control In A Multiprocessor Computer System,” Bayer et al., (POU920100042US1); U.S. Ser. No. 12/821,242, filed Jun. 23, 2010, entitled “A System And Method For Downbound I/O Expansion Request And Response Processing In A PCIe Architecture,” Gregg et al., (POU920100040US1); U.S. Ser. No. 12/821,243, filed Jun. 23, 2010, entitled “Upbound Input/Output Expansion Request And Response Processing In A PCIe Architecture,” Gregg et al., (POU920100039US1); U.S. Ser. No. 12/821,245, filed Jun. 23, 2010, entitled “A System And Method For Routing I/O Expansion Requests And Responses In A PCIe Architecture,” Lais et al. (POU920100038US1); U.S. Ser. No. 12/821,239, filed Jun. 23, 2010, entitled “Input/Output (I/O) Expansion Response Processing In A Peripheral Component Interconnect Express (PCIe) Environment,” Gregg et al., (POU920100037US1); U.S. Ser. No. 12/821,271, filed Jun. 23, 2010, entitled “Memory Error Isolation And Recovery In A Multiprocessor Computer System,” Check et al., (POU920100041US1); and U.S. Ser. No. 12/821,248, filed Jun. 23, 2010, entitled “Connected Input/Output Hub Management,” Bayer et al., (POU920100036US1), each of which is hereby incorporated herein by reference in its entirety.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system”. Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device.
Referring now to
Program code embodied on a computer readable medium may be transmitted using an appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language, such as Java, Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language, assembler or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition to the above, one or more aspects of the present invention may be provided, offered, deployed, managed, serviced, etc. by a service provider who offers management of customer environments. For instance, the service provider can create, maintain, support, etc. computer code and/or a computer infrastructure that performs one or more aspects of the present invention for one or more customers. In return, the service provider may receive payment from the customer under a subscription and/or fee agreement, as examples. Additionally or alternatively, the service provider may receive payment from the sale of advertising content to one or more third parties.
In one aspect of the present invention, an application may be deployed for performing one or more aspects of the present invention. As one example, the deploying of an application comprises providing computer infrastructure operable to perform one or more aspects of the present invention.
As a further aspect of the present invention, a computing infrastructure may be deployed comprising integrating computer readable code into a computing system, in which the code in combination with the computing system is capable of performing one or more aspects of the present invention.
As yet a further aspect of the present invention, a process for integrating computing infrastructure comprising integrating computer readable code into a computer system may be provided. The computer system comprises a computer readable medium, in which the computer medium comprises one or more aspects of the present invention. The code in combination with the computer system is capable of performing one or more aspects of the present invention.
Although various embodiments are described above, these are only examples. For example, computing environments of other architectures can incorporate and use one or more aspects of the present invention. As examples, servers other than System z® servers, such as Power Systems servers or other servers offered by International Business Machines Corporation, or servers of other companies can include, use and/or benefit from one or more aspects of the present invention. Further, although in the example herein, the adapters and PCI hub are considered a part of the server, in other embodiments, they do not have to necessarily be considered a part of the server, but can simply be considered as being coupled to system memory and/or other components of a computing environment. The computing environment need not be a server. Further, although translation tables are described, any data structure can be used and the term table is to include all such data structures. Yet further, although the adapters are PCI based, one or more aspects of the present invention are usable with other adapters or other I/O components. Adapter and PCI adapter are just examples. Moreover, other size address spaces, address tables and/or pages may be used without departing from the spirit of the present invention. Further, the DTE may include more, less or different information. Yet further, other types of addresses may be translated using one or more aspects of the present invention. Many other variations are possible.
Further, other types of computing environments can benefit from one or more aspects of the present invention. As an example, a data processing system suitable for storing and/or executing program code is usable that includes at least two processors coupled directly or indirectly to memory elements through a system bus. The memory elements include, for instance, local memory employed during actual execution of the program code, bulk storage, and cache memory which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.
Input/Output or I/O devices (including, but not limited to, keyboards, displays, pointing devices, DASD, tape, CDs, DVDs, thumb drives and other memory media, etc.) can be coupled to the system either directly or through intervening I/O controllers. Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modems, and Ethernet cards are just a few of the available types of network adapters.
Referring to
As noted, a computer system includes information in local (or main) storage, as well as addressing, protection, and reference and change recording. Some aspects of addressing include the format of addresses, the concept of address spaces, the various types of addresses, and the manner in which one type of address is translated to another type of address. Some of main storage includes permanently assigned storage locations. Main storage provides the system with directly addressable fast-access storage of data. Both data and programs are to be loaded into main storage (from input devices) before they can be processed.
Main storage may include one or more smaller, faster-access buffer storages, sometimes called caches. A cache is typically physically associated with a CPU or an I/O processor. The effects, except on performance, of the physical construction and use of distinct storage media are generally not observable by the program.
Separate caches may be maintained for instructions and for data operands. Information within a cache is maintained in contiguous bytes on an integral boundary called a cache block or cache line (or line, for short). A model may provide an EXTRACT CACHE ATTRIBUTE instruction which returns the size of a cache line in bytes. A model may also provide PREFETCH DATA and PREFETCH DATA RELATIVE LONG instructions which effects the prefetching of storage into the data or instruction cache or the releasing of data from the cache.
Storage is viewed as a long horizontal string of bits. For most operations, accesses to storage proceed in a left-to-right sequence. The string of bits is subdivided into units of eight bits. An eight-bit unit is called a byte, which is the basic building block of all information formats. Each byte location in storage is identified by a unique nonnegative integer, which is the address of that byte location or, simply, the byte address. Adjacent byte locations have consecutive addresses, starting with 0 on the left and proceeding in a left-to-right sequence. Addresses are unsigned binary integers and are 24, 31, or 64 bits.
Information is transmitted between storage and a CPU or a channel subsystem one byte, or a group of bytes, at a time. Unless otherwise specified, in, for instance, the z/Architecture®, a group of bytes in storage is addressed by the leftmost byte of the group. The number of bytes in the group is either implied or explicitly specified by the operation to be performed. When used in a CPU operation, a group of bytes is called a field. Within each group of bytes, in, for instance, the z/Architecture®, bits are numbered in a left-to-right sequence. In the z/Architecture®, the leftmost bits are sometimes referred to as the “high-order” bits and the rightmost bits as the “low-order” bits. Bit numbers are not storage addresses, however. Only bytes can be addressed. To operate on individual bits of a byte in storage, the entire byte is accessed. The bits in a byte are numbered 0 through 7, from left to right (in, e.g., the z/Architecture). The bits in an address may be numbered 8-31 or 40-63 for 24-bit addresses, or 1-31 or 33-63 for 31-bit addresses; they are numbered 0-63 for 64-bit addresses. Within any other fixed-length format of multiple bytes, the bits making up the format are consecutively numbered starting from 0. For purposes of error detection, and in preferably for correction, one or more check bits may be transmitted with each byte or with a group of bytes. Such check bits are generated automatically by the machine and cannot be directly controlled by the program. Storage capacities are expressed in number of bytes. When the length of a storage-operand field is implied by the operation code of an instruction, the field is said to have a fixed length, which can be one, two, four, eight, or sixteen bytes. Larger fields may be implied for some instructions. When the length of a storage-operand field is not implied but is stated explicitly, the field is said to have a variable length. Variable-length operands can vary in length by increments of one byte (or with some instructions, in multiples of two bytes or other multiples). When information is placed in storage, the contents of only those byte locations are replaced that are included in the designated field, even though the width of the physical path to storage may be greater than the length of the field being stored.
Certain units of information are to be on an integral boundary in storage. A boundary is called integral for a unit of information when its storage address is a multiple of the length of the unit in bytes. Special names are given to fields of 2, 4, 8, and 16 bytes on an integral boundary. A halfword is a group of two consecutive bytes on a two-byte boundary and is the basic building block of instructions. A word is a group of four consecutive bytes on a four-byte boundary. A doubleword is a group of eight consecutive bytes on an eight-byte boundary. A quadword is a group of 16 consecutive bytes on a 16-byte boundary. When storage addresses designate halfwords, words, doublewords, and quadwords, the binary representation of the address contains one, two, three, or four rightmost zero bits, respectively. Instructions are to be on two-byte integral boundaries. The storage operands of most instructions do not have boundary-alignment requirements.
On devices that implement separate caches for instructions and data operands, a significant delay may be experienced if the program stores into a cache line from which instructions are subsequently fetched, regardless of whether the store alters the instructions that are subsequently fetched.
In one embodiment, the invention may be practiced by software (sometimes referred to licensed internal code, firmware, micro-code, milli-code, pico-code and the like, any of which would be consistent with the present invention). Referring to
The software program code includes an operating system which controls the function and interaction of the various computer components and one or more application programs. Program code is normally paged from storage media device 5011 to the relatively higher-speed computer storage 5002 where it is available for processing by processor 5001. The techniques and methods for embodying software program code in memory, on physical media, and/or distributing software code via networks are well known and will not be further discussed herein. Program code, when created and stored on a tangible medium (including but not limited to electronic memory modules (RAM), flash memory, Compact Discs (CDs), DVDs, Magnetic Tape and the like is often referred to as a “computer program product”. The computer program product medium is typically readable by a processing circuit preferably in a computer system for execution by the processing circuit.
The system 5021 may communicate with other computers or networks of computers by way of a network adapter capable of communicating 5028 with a network 5029. Example network adapters are communications channels, token ring, Ethernet or modems. Alternatively, the system 5021 may communicate using a wireless interface, such as a CDPD (cellular digital packet data) card. The system 5021 may be associated with such other computers in a Local Area Network (LAN) or a Wide Area Network (WAN), or the system 5021 can be a client in a client/server arrangement with another computer, etc. All of these configurations, as well as the appropriate communications hardware and software, are known in the art.
Still referring to
Referring concurrently to
Alternatively, the programming code may be embodied in the memory 5025, and accessed by the processor 5026 using the processor bus. Such programming code includes an operating system which controls the function and interaction of the various computer components and one or more application programs 5032. Program code is normally paged from storage media 5027 to high-speed memory 5025 where it is available for processing by the processor 5026. The techniques and methods for embodying software programming code in memory, on physical media, and/or distributing software code via networks are well known and will not be further discussed herein. Program code, when created and stored on a tangible medium (including but not limited to electronic memory modules (RAM), flash memory, Compact Discs (CDs), DVDs, Magnetic Tape and the like is often referred to as a “computer program product”. The computer program product medium is typically readable by a processing circuit preferably in a computer system for execution by the processing circuit.
The cache that is most readily available to the processor (normally faster and smaller than other caches of the processor) is the lowest (L1 or level one) cache and main store (main memory) is the highest level cache (L3 if there are 3 levels). The lowest level cache is often divided into an instruction cache (I-Cache) holding machine instructions to be executed and a data cache (D-Cache) holding data operands.
Referring to
A program counter (instruction counter) 5061 keeps track of the address of the current instruction to be executed. A program counter in a z/Architecture® processor is 64 bits and can be truncated to 31 or 24 bits to support prior addressing limits. A program counter is typically embodied in a PSW (program status word) of a computer such that it persists during context switching. Thus, a program in progress, having a program counter value, may be interrupted by, for example, the operating system (context switch from the program environment to the operating system environment). The PSW of the program maintains the program counter value while the program is not active, and the program counter (in the PSW) of the operating system is used while the operating system is executing. Typically, the program counter is incremented by an amount equal to the number of bytes of the current instruction. RISC (Reduced Instruction Set Computing) instructions are typically fixed length while CISC (Complex Instruction Set Computing) instructions are typically variable length. Instructions of the IBM z/Architecture® are CISC instructions having a length of 2, 4 or 6 bytes. The Program counter 5061 is modified by either a context switch operation or a branch taken operation of a branch instruction for example. In a context switch operation, the current program counter value is saved in the program status word along with other state information about the program being executed (such as condition codes), and a new program counter value is loaded pointing to an instruction of a new program module to be executed. A branch taken operation is performed in order to permit the program to make decisions or loop within the program by loading the result of the branch instruction into the program counter 5061.
Typically an instruction fetch unit 5055 is employed to fetch instructions on behalf of the processor 5026. The fetch unit either fetches “next sequential instructions”, target instructions of branch taken instructions, or first instructions of a program following a context switch. Modern Instruction fetch units often employ prefetch techniques to speculatively prefetch instructions based on the likelihood that the prefetched instructions might be used. For example, a fetch unit may fetch 16 bytes of instruction that includes the next sequential instruction and additional bytes of further sequential instructions.
The fetched instructions are then executed by the processor 5026. In an embodiment, the fetched instruction(s) are passed to a dispatch unit 5056 of the fetch unit. The dispatch unit decodes the instruction(s) and forwards information about the decoded instruction(s) to appropriate units 5057, 5058, 5060. An execution unit 5057 will typically receive information about decoded arithmetic instructions from the instruction fetch unit 5055 and will perform arithmetic operations on operands according to the opcode of the instruction. Operands are provided to the execution unit 5057 preferably either from memory 5025, architected registers 5059 or from an immediate field of the instruction being executed. Results of the execution, when stored, are stored either in memory 5025, registers 5059 or in other machine hardware (such as control registers, PSW registers and the like).
A processor 5026 typically has one or more units 5057, 5058, 5060 for executing the function of the instruction. Referring to
An ADD instruction for example would be executed in an execution unit 5057 having arithmetic and logical functionality while a floating point instruction for example would be executed in a floating point execution having specialized floating point capability. Preferably, an execution unit operates on operands identified by an instruction by performing an opcode defined function on the operands. For example, an ADD instruction may be executed by an execution unit 5057 on operands found in two registers 5059 identified by register fields of the instruction.
The execution unit 5057 performs the arithmetic addition on two operands and stores the result in a third operand where the third operand may be a third register or one of the two source registers. The execution unit preferably utilizes an Arithmetic Logic Unit (ALU) 5066 that is capable of performing a variety of logical functions such as Shift, Rotate, And, Or and XOR as well as a variety of algebraic functions including any of add, subtract, multiply, divide. Some ALUs 5066 are designed for scalar operations and some for floating point. Data may be Big Endian (where the least significant byte is at the highest byte address) or Little Endian (where the least significant byte is at the lowest byte address) depending on architecture. The IBM z/Architecture® is Big Endian. Signed fields may be sign and magnitude, 1's complement or 2's complement depending on architecture. A 2's complement number is advantageous in that the ALU does not need to design a subtract capability since either a negative value or a positive value in 2's complement requires only an addition within the ALU. Numbers are commonly described in shorthand, where a 12 bit field defines an address of a 4,096 byte block and is commonly described as a 4 Kbyte (Kilo-byte) block, for example.
Referring to
The execution of a group of instructions can be interrupted for a variety of reasons including a context switch initiated by an operating system, a program exception or error causing a context switch, an I/O interruption signal causing a context switch or multi-threading activity of a plurality of programs (in a multi-threaded environment), for example. Preferably a context switch action saves state information about a currently executing program and then loads state information about another program being invoked. State information may be saved in hardware registers or in memory for example. State information preferably comprises a program counter value pointing to a next instruction to be executed, condition codes, memory translation information and architected register content. A context switch activity can be exercised by hardware circuits, application programs, operating system programs or firmware code (microcode, pico-code or licensed internal code (LIC)) alone or in combination.
A processor accesses operands according to instruction defined methods. The instruction may provide an immediate operand using the value of a portion of the instruction, may provide one or more register fields explicitly pointing to either general purpose registers or special purpose registers (floating point registers for example). The instruction may utilize implied registers identified by an opcode field as operands. The instruction may utilize memory locations for operands. A memory location of an operand may be provided by a register, an immediate field, or a combination of registers and immediate field as exemplified by the z/Architecture® long displacement facility wherein the instruction defines a base register, an index register and an immediate field (displacement field) that are added together to provide the address of the operand in memory for example. Location herein typically implies a location in main memory (main storage) unless otherwise indicated.
Referring to
Preferably addresses that an application program “sees” are often referred to as virtual addresses. Virtual addresses are sometimes referred to as “logical addresses” and “effective addresses”. These virtual addresses are virtual in that they are redirected to physical memory location by one of a variety of dynamic address translation (DAT) technologies including, but not limited to, simply prefixing a virtual address with an offset value, translating the virtual address via one or more translation tables, the translation tables preferably comprising at least a segment table and a page table alone or in combination, preferably, the segment table having an entry pointing to the page table. In the z/Architecture®, a hierarchy of translation is provided including a region first table, a region second table, a region third table, a segment table and an optional page table. The performance of the address translation is often improved by utilizing a translation lookaside buffer (TLB) which comprises entries mapping a virtual address to an associated physical memory location. The entries are created when the DAT translates a virtual address using the translation tables. Subsequent use of the virtual address can then utilize the entry of the fast TLB rather than the slow sequential translation table accesses. TLB content may be managed by a variety of replacement algorithms including LRU (Least Recently used).
In the case where the processor is a processor of a multi-processor system, each processor has responsibility to keep shared resources, such as I/O, caches, TLBs and memory, interlocked for coherency. Typically, “snoop” technologies will be utilized in maintaining cache coherency. In a snoop environment, each cache line may be marked as being in any one of a shared state, an exclusive state, a changed state, an invalid state and the like in order to facilitate sharing.
I/O units 5054 (
Further, other types of computing environments can benefit from one or more aspects of the present invention. As an example, an environment may include an emulator (e.g., software or other emulation mechanisms), in which a particular architecture (including, for instance, instruction execution, architected functions, such as address translation, and architected registers) or a subset thereof is emulated (e.g., on a native computer system having a processor and memory). In such an environment, one or more emulation functions of the emulator can implement one or more aspects of the present invention, even though a computer executing the emulator may have a different architecture than the capabilities being emulated. As one example, in emulation mode, the specific instruction or operation being emulated is decoded, and an appropriate emulation function is built to implement the individual instruction or operation.
In an emulation environment, a host computer includes, for instance, a memory to store instructions and data; an instruction fetch unit to fetch instructions from memory and to optionally, provide local buffering for the fetched instruction; an instruction decode unit to receive the fetched instructions and to determine the type of instructions that have been fetched; and an instruction execution unit to execute the instructions. Execution may include loading data into a register from memory; storing data back to memory from a register; or performing some type of arithmetic or logical operation, as determined by the decode unit. In one example, each unit is implemented in software. For instance, the operations being performed by the units are implemented as one or more subroutines within emulator software.
More particularly, in a mainframe, architected machine instructions are used by programmers, usually today “C” programmers, often by way of a compiler application. These instructions stored in the storage medium may be executed natively in a z/Architecture® IBM® Server, or alternatively in machines executing other architectures. They can be emulated in the existing and in future IBM° mainframe servers and on other machines of IBM° (e.g., Power Systems servers and System x® Servers). They can be executed in machines running Linux on a wide variety of machines using hardware manufactured by IBM®, Intel®, AMD™, and others. Besides execution on that hardware under a z/Architecture®, Linux can be used as well as machines which use emulation by Hercules, UMX, or FSI (Fundamental Software, Inc), where generally execution is in an emulation mode. In emulation mode, emulation software is executed by a native processor to emulate the architecture of an emulated processor.
The native processor typically executes emulation software comprising either firmware or a native operating system to perform emulation of the emulated processor. The emulation software is responsible for fetching and executing instructions of the emulated processor architecture. The emulation software maintains an emulated program counter to keep track of instruction boundaries. The emulation software may fetch one or more emulated machine instructions at a time and convert the one or more emulated machine instructions to a corresponding group of native machine instructions for execution by the native processor. These converted instructions may be cached such that a faster conversion can be accomplished. Notwithstanding, the emulation software is to maintain the architecture rules of the emulated processor architecture so as to assure operating systems and applications written for the emulated processor operate correctly. Furthermore, the emulation software is to provide resources identified by the emulated processor architecture including, but not limited to, control registers, general purpose registers, floating point registers, dynamic address translation function including segment tables and page tables for example, interrupt mechanisms, context switch mechanisms, Time of Day (TOD) clocks and architected interfaces to I/O subsystems such that an operating system or an application program designed to run on the emulated processor, can be run on the native processor having the emulation software.
A specific instruction being emulated is decoded, and a subroutine is called to perform the function of the individual instruction. An emulation software function emulating a function of an emulated processor is implemented, for example, in a “C” subroutine or driver, or some other method of providing a driver for the specific hardware as will be within the skill of those in the art after understanding the description of the preferred embodiment. Various software and hardware emulation patents including, but not limited to U.S. Letters Patent No. 5,551,013, entitled “Multiprocessor for Hardware Emulation”, by Beausoleil et al.; and U.S. Letters Patent No. 6,009,261, entitled “Preprocessing of Stored Target Routines for Emulating Incompatible Instructions on a Target Processor”, by Scalzi et al; and U.S. Letters Patent No. 5,574,873, entitled “Decoding Guest Instruction to Directly Access Emulation Routines that Emulate the Guest Instructions”, by Davidian et al; and U.S. Letters Patent No. 6,308,255, entitled “Symmetrical Multiprocessing Bus and Chipset Used for Coprocessor Support Allowing Non-Native Code to Run in a System”, by Gorishek et al; and U.S. Letters Patent No. 6,463,582, entitled “Dynamic Optimizing Object Code Translator for Architecture Emulation and Dynamic Optimizing Object Code Translation Method”, by Lethin et al; and U.S. Letters Patent No. 5,790,825, entitled “Method for Emulating Guest Instructions on a Host Computer Through Dynamic Recompilation of Host Instructions”, by Eric Traut, each of which is hereby incorporated herein by reference in its entirety; and many others, illustrate a variety of known ways to achieve emulation of an instruction format architected for a different machine for a target machine available to those skilled in the art.
In
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising”, when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below, if any, are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiment with various modifications as are suited to the particular use contemplated.
This application is a continuation of co-pending U.S. Ser. No. 13/672,028, entitled “TRANSLATION OF INPUT/OUTPUT ADDRESSES TO MEMORY ADDRESSES,” filed Nov. 8, 2012, which is a continuation of co-pending U.S. Ser. No. 12/821,170, entitled “TRANSLATION OF INPUT/OUTPUT ADDRESSES TO MEMORY ADDRESSES,” filed Jun. 23, 2010, each of which is hereby incorporated herein by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3976979 | Parkinson et al. | Aug 1976 | A |
| 4028668 | Riikonen | Jun 1977 | A |
| 4323963 | Wu | Apr 1982 | A |
| 5053952 | Koopman, Jr. et al. | Oct 1991 | A |
| 5170472 | Cwiakala et al. | Dec 1992 | A |
| 5265240 | Galbraith et al. | Nov 1993 | A |
| 5282274 | Liu | Jan 1994 | A |
| 5297290 | Masui et al. | Mar 1994 | A |
| 5430856 | Kinoshita | Jul 1995 | A |
| 5465332 | Deloye et al. | Nov 1995 | A |
| 5465355 | Cook et al. | Nov 1995 | A |
| 5535352 | Bridges et al. | Jul 1996 | A |
| 5551013 | Beausoleil et al. | Aug 1996 | A |
| 5574873 | Davidian | Nov 1996 | A |
| 5600805 | Fredericks et al. | Feb 1997 | A |
| 5617554 | Alpert et al. | Apr 1997 | A |
| 5742785 | Stone et al. | Apr 1998 | A |
| 5761448 | Adamson et al. | Jun 1998 | A |
| 5790825 | Traut | Aug 1998 | A |
| 5802590 | Draves | Sep 1998 | A |
| 5802605 | Alpert | Sep 1998 | A |
| 5819053 | Goodrum et al. | Oct 1998 | A |
| 5822616 | Hirooka | Oct 1998 | A |
| 5826084 | Brooks et al. | Oct 1998 | A |
| 5838960 | Harriman, Jr. | Nov 1998 | A |
| 5870598 | White et al. | Feb 1999 | A |
| 5875463 | Crump et al. | Feb 1999 | A |
| 5901312 | Radko | May 1999 | A |
| 5960213 | Wilson | Sep 1999 | A |
| 5974440 | Brooks et al. | Oct 1999 | A |
| 6009261 | Scalzi et al. | Dec 1999 | A |
| 6023736 | Lambeth et al. | Feb 2000 | A |
| 6067595 | Lindenstruth | May 2000 | A |
| 6078970 | Nordstrom et al. | Jun 2000 | A |
| 6079004 | Liedtke | Jun 2000 | A |
| 6205530 | Kang | Mar 2001 | B1 |
| 6308255 | Gorishek, IV et al. | Oct 2001 | B1 |
| 6330647 | Jeddeloh et al. | Dec 2001 | B1 |
| 6330656 | Bealkowski et al. | Dec 2001 | B1 |
| 6349380 | Shahidzadeh et al. | Feb 2002 | B1 |
| 6408347 | Smith et al. | Jun 2002 | B1 |
| 6463582 | Lethin et al. | Oct 2002 | B1 |
| 6493741 | Emer et al. | Dec 2002 | B1 |
| 6519645 | Markos et al. | Feb 2003 | B2 |
| 6529978 | Eide et al. | Mar 2003 | B1 |
| 6557035 | McKnight | Apr 2003 | B1 |
| 6578191 | Boehme et al. | Jun 2003 | B1 |
| 6581130 | Brinkmann, Jr. et al. | Jun 2003 | B1 |
| 6615305 | Olesen et al. | Sep 2003 | B1 |
| 6629175 | Manning et al. | Sep 2003 | B1 |
| 6654818 | Thurber | Nov 2003 | B1 |
| 6658521 | Biran et al. | Dec 2003 | B1 |
| 6704831 | Avery | Mar 2004 | B1 |
| 6715011 | Buckland et al. | Mar 2004 | B1 |
| 6721839 | Bauman et al. | Apr 2004 | B1 |
| 6772097 | Kromenaker et al. | Aug 2004 | B1 |
| 6772264 | Dayan et al. | Aug 2004 | B1 |
| 6792492 | Griffin | Sep 2004 | B1 |
| 6820164 | Holm et al. | Nov 2004 | B2 |
| 6901537 | Dawkins et al. | May 2005 | B2 |
| 6907510 | Bennett et al. | Jun 2005 | B2 |
| 6938138 | Beukema | Aug 2005 | B2 |
| 6963940 | Glassen et al. | Nov 2005 | B1 |
| 6968446 | McGrath | Nov 2005 | B1 |
| 6970992 | Gurumoorthy et al. | Nov 2005 | B2 |
| 6978338 | Wang et al. | Dec 2005 | B2 |
| 6996638 | Brice, Jr. et al. | Feb 2006 | B2 |
| 7065598 | Connor et al. | Jun 2006 | B2 |
| 7107384 | Chen et al. | Sep 2006 | B1 |
| 7127599 | Brice, Jr. et al. | Oct 2006 | B2 |
| 7130938 | Brice, Jr. et al. | Oct 2006 | B2 |
| 7139940 | Arbeitman et al. | Nov 2006 | B2 |
| 7174550 | Brice, Jr. et al. | Feb 2007 | B2 |
| 7177961 | Brice, Jr. et al. | Feb 2007 | B2 |
| 7200704 | Njoku et al. | Apr 2007 | B2 |
| 7209994 | Klaiber et al. | Apr 2007 | B1 |
| 7225287 | Wooten | May 2007 | B2 |
| 7260664 | Arndt et al. | Aug 2007 | B2 |
| 7277968 | Brice, Jr. et al. | Oct 2007 | B2 |
| 7296120 | Corrigan et al. | Nov 2007 | B2 |
| 7302692 | Bae et al. | Nov 2007 | B2 |
| 7334107 | Schoinas et al. | Feb 2008 | B2 |
| 7340582 | Madukkarumukumana | Mar 2008 | B2 |
| 7380041 | Belmar et al. | May 2008 | B2 |
| 7398343 | Marmash et al. | Jul 2008 | B1 |
| 7412488 | Jha et al. | Aug 2008 | B2 |
| 7418572 | Hepkin | Aug 2008 | B2 |
| 7420931 | Nanda et al. | Sep 2008 | B2 |
| 7444493 | Schoinas et al. | Oct 2008 | B2 |
| 7454548 | Belmar et al. | Nov 2008 | B2 |
| 7464191 | Arndt et al. | Dec 2008 | B2 |
| 7464209 | Armstrong et al. | Dec 2008 | B2 |
| 7475183 | Traut et al. | Jan 2009 | B2 |
| 7493425 | Arndt et al. | Feb 2009 | B2 |
| 7496707 | Freking et al. | Feb 2009 | B2 |
| 7502872 | Boyd et al. | Mar 2009 | B2 |
| 7506087 | Ho et al. | Mar 2009 | B2 |
| 7509391 | Chauvel et al. | Mar 2009 | B1 |
| 7529860 | Freimuth et al. | May 2009 | B2 |
| 7530071 | Billau et al. | May 2009 | B2 |
| 7546406 | Armstrong et al. | Jun 2009 | B2 |
| 7546487 | Marisetty et al. | Jun 2009 | B2 |
| 7549090 | Bailey et al. | Jun 2009 | B2 |
| 7552298 | Bestler | Jun 2009 | B2 |
| 7562366 | Pope et al. | Jul 2009 | B2 |
| 7567567 | Muller et al. | Jul 2009 | B2 |
| 7587531 | Brice, Jr. et al. | Sep 2009 | B2 |
| 7600053 | Carlson et al. | Oct 2009 | B2 |
| 7606965 | Njoku et al. | Oct 2009 | B2 |
| 7613847 | Kjos et al. | Nov 2009 | B2 |
| 7617340 | Gregg | Nov 2009 | B2 |
| 7617345 | Clark et al. | Nov 2009 | B2 |
| 7623460 | Miyazaki | Nov 2009 | B2 |
| 7624235 | Wadhawan et al. | Nov 2009 | B2 |
| 7627723 | Buck et al. | Dec 2009 | B1 |
| 7631097 | Moch et al. | Dec 2009 | B2 |
| 7886086 | Sharma et al. | Feb 2011 | B2 |
| 20010021971 | Gibson et al. | Sep 2001 | A1 |
| 20020152334 | Holm et al. | Oct 2002 | A1 |
| 20020161907 | Moon | Oct 2002 | A1 |
| 20030056155 | Austen et al. | Mar 2003 | A1 |
| 20030074541 | Plambeck | Apr 2003 | A1 |
| 20040015622 | Avery | Jan 2004 | A1 |
| 20040025166 | Adlung et al. | Feb 2004 | A1 |
| 20040049600 | Boyd et al. | Mar 2004 | A1 |
| 20040064618 | Farrell et al. | Apr 2004 | A1 |
| 20040073905 | Emer et al. | Apr 2004 | A1 |
| 20040117534 | Parry et al. | Jun 2004 | A1 |
| 20040122988 | Han | Jun 2004 | A1 |
| 20040139304 | Arimilli et al. | Jul 2004 | A1 |
| 20040139305 | Arimilli et al. | Jul 2004 | A1 |
| 20040199700 | Clayton | Oct 2004 | A1 |
| 20040236880 | Barrett | Nov 2004 | A1 |
| 20050033895 | Lueck et al. | Feb 2005 | A1 |
| 20050071472 | Arndt et al. | Mar 2005 | A1 |
| 20050114586 | Brice, Jr. et al. | May 2005 | A1 |
| 20050114623 | Craddock et al. | May 2005 | A1 |
| 20050289271 | Martinez et al. | Dec 2005 | A1 |
| 20060005083 | Genden et al. | Jan 2006 | A1 |
| 20060064618 | Wu et al. | Mar 2006 | A1 |
| 20060101181 | Post et al. | May 2006 | A1 |
| 20060130071 | Martin et al. | Jun 2006 | A1 |
| 20060195617 | Arndt et al. | Aug 2006 | A1 |
| 20060195644 | Arndt et al. | Aug 2006 | A1 |
| 20060230208 | Gregg et al. | Oct 2006 | A1 |
| 20060253619 | Torudbakken et al. | Nov 2006 | A1 |
| 20060281630 | Bailey et al. | Dec 2006 | A1 |
| 20060288130 | Madukkarumukumana | Dec 2006 | A1 |
| 20070028087 | Yu et al. | Feb 2007 | A1 |
| 20070073955 | Murray et al. | Mar 2007 | A1 |
| 20070136554 | Biran et al. | Jun 2007 | A1 |
| 20070168636 | Hummel et al. | Jul 2007 | A1 |
| 20070168643 | Hummel et al. | Jul 2007 | A1 |
| 20070168644 | Hummel et al. | Jul 2007 | A1 |
| 20070168934 | Chandrasekharan et al. | Jul 2007 | A1 |
| 20070186074 | Bradford et al. | Aug 2007 | A1 |
| 20070226386 | Sharp et al. | Sep 2007 | A1 |
| 20070234018 | Feiste | Oct 2007 | A1 |
| 20070245041 | Hua et al. | Oct 2007 | A1 |
| 20070260768 | Bender et al. | Nov 2007 | A1 |
| 20070271559 | Easton et al. | Nov 2007 | A1 |
| 20080091851 | Sierra | Apr 2008 | A1 |
| 20080091868 | Mizrachi et al. | Apr 2008 | A1 |
| 20080091915 | Moertl et al. | Apr 2008 | A1 |
| 20080098197 | Craddock et al. | Apr 2008 | A1 |
| 20080114734 | Suwabe | May 2008 | A1 |
| 20080114906 | Hummel et al. | May 2008 | A1 |
| 20080126648 | Brownlow et al. | May 2008 | A1 |
| 20080126652 | Vembu et al. | May 2008 | A1 |
| 20080148295 | Freimuth et al. | Jun 2008 | A1 |
| 20080168186 | Gregg | Jul 2008 | A1 |
| 20080168208 | Gregg | Jul 2008 | A1 |
| 20080222406 | Tabuchi | Sep 2008 | A1 |
| 20080235425 | Belmar et al. | Sep 2008 | A1 |
| 20090024823 | Ko et al. | Jan 2009 | A1 |
| 20090049220 | Conti et al. | Feb 2009 | A1 |
| 20090070760 | Khatri et al. | Mar 2009 | A1 |
| 20090089780 | Johnson et al. | Apr 2009 | A1 |
| 20090125666 | Freking et al. | May 2009 | A1 |
| 20090144462 | Arndt et al. | Jun 2009 | A1 |
| 20090144731 | Brown et al. | Jun 2009 | A1 |
| 20090157913 | Bellows | Jun 2009 | A1 |
| 20090172211 | Perry et al. | Jul 2009 | A1 |
| 20090182966 | Greiner et al. | Jul 2009 | A1 |
| 20090182969 | Norgaard et al. | Jul 2009 | A1 |
| 20090210646 | Bauman et al. | Aug 2009 | A1 |
| 20090222814 | Astrand | Sep 2009 | A1 |
| 20090240849 | Corneli et al. | Sep 2009 | A1 |
| 20090249039 | Hook et al. | Oct 2009 | A1 |
| 20090276774 | Kinoshita | Nov 2009 | A1 |
| 20090276775 | Brown et al. | Nov 2009 | A1 |
| 20090328035 | Ganguly | Dec 2009 | A1 |
| 20100005234 | Ganga et al. | Jan 2010 | A1 |
| 20110202748 | Jacobi | Aug 2011 | A1 |
| 20110314260 | Greiner | Dec 2011 | A1 |
| 20110314263 | Greiner | Dec 2011 | A1 |
| 20110320637 | Coneski et al. | Dec 2011 | A1 |
| 20110320638 | Coneski et al. | Dec 2011 | A1 |
| 20110320643 | Brice et al. | Dec 2011 | A1 |
| 20110320644 | Craddock et al. | Dec 2011 | A1 |
| 20110320652 | Craddock et al. | Dec 2011 | A1 |
| 20110320653 | Lais | Dec 2011 | A1 |
| 20110320662 | Craddock et al. | Dec 2011 | A1 |
| 20110320663 | Brice et al. | Dec 2011 | A1 |
| 20110320664 | Belmar et al. | Dec 2011 | A1 |
| 20110320666 | Gregg | Dec 2011 | A1 |
| 20110320670 | Bayer | Dec 2011 | A1 |
| 20110320674 | Gregg | Dec 2011 | A1 |
| 20110320675 | Gregg | Dec 2011 | A1 |
| 20110320703 | Craddock | Dec 2011 | A1 |
| 20110320756 | Craddock et al. | Dec 2011 | A1 |
| 20110320757 | Craddock et al. | Dec 2011 | A1 |
| 20110320758 | Craddock et al. | Dec 2011 | A1 |
| 20110320759 | Craddock et al. | Dec 2011 | A1 |
| 20110320764 | Craddock et al. | Dec 2011 | A1 |
| 20110320772 | Craddock et al. | Dec 2011 | A1 |
| 20110320825 | Greiner | Dec 2011 | A1 |
| 20110320860 | Coneski et al. | Dec 2011 | A1 |
| 20110320861 | Bayer | Dec 2011 | A1 |
| 20110320887 | Craddock | Dec 2011 | A1 |
| 20110320892 | Check | Dec 2011 | A1 |
| 20110321060 | Craddock et al. | Dec 2011 | A1 |
| 20110321061 | Craddock et al. | Dec 2011 | A1 |
| 20110321158 | Craddock et al. | Dec 2011 | A1 |
| 20130067194 | Craddock et al. | Mar 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 1487417 | Apr 2004 | CN |
| 1536842 | Oct 2004 | CN |
| 1924842 | Mar 2007 | CN |
| 101031893 | Sep 2007 | CN |
| 101114265 | Jan 2008 | CN |
| 101165664 | Apr 2008 | CN |
| 101359315 | Feb 2009 | CN |
| 101634975 | Jan 2010 | CN |
| 0076921 | Apr 1983 | EP |
| 0552873 | Jul 1993 | EP |
| 902355 | Mar 1999 | EP |
| 0955585 | Nov 1999 | EP |
| 1096376 | Feb 2001 | EP |
| 1489491 | Dec 2004 | EP |
| 359081724 | May 1984 | JP |
| 362079557 | Apr 1987 | JP |
| S6273347 | Apr 1987 | JP |
| H0250744 | Feb 1990 | JP |
| 405053973 | Mar 1993 | JP |
| 5100996 | Apr 1993 | JP |
| H0619798 | Jan 1994 | JP |
| 2000293476 | Oct 2000 | JP |
| 2004248985 | Sep 2004 | JP |
| 2004252591 | Sep 2004 | JP |
| 2005122640 | May 2005 | JP |
| 2005309553 | Nov 2005 | JP |
| 2005353055 | Dec 2005 | JP |
| 2006085400 | Mar 2006 | JP |
| 2008041093 | Feb 2008 | JP |
| 2008305034 | Dec 2008 | JP |
| 2009249108 | Nov 2009 | JP |
| 2011065551 | Mar 2011 | JP |
| WO9600940 | Jun 1995 | WO |
| WO9938074 | Jul 1999 | WO |
| WO 0241157 | May 2002 | WO |
| WO2009087133 | Jul 2009 | WO |
| Entry |
|---|
| Notice of Allowance for U.S. Appl. No. 12/821,187 dated Jun. 13, 2014, 22 pages. |
| Paulsen, Eric; “Local Memory Coaxes Top Speed from SCSI Masters,” Electronic Design, v. 41, Apr. 15, 1993, pp. 76-6+. |
| Ganapathy, Narayanan; “General Purpose Operating System Support for Multiple Page Sizes,” USENIX Annual Technical Conference (No. 98), Jun. 1998, pp. 91-104. |
| Talluri et al., “A New Page Table for 64-bit Address Spaces,” ACM SIGOPS Operating Systems Review, vol. 29, Issue 5 (Dec. 1995), pp. 184-200. |
| “Large Page Support in the Linux Kernel,” http://lwn.net/Articles/6969/, Aug. 2002, p. 1. |
| Crawford, Catherine H. et al., “Accelerating Computing with the Cell Broadband Engine Processor,” May 2008, CF '08, May 5-7, 2008, Ischia, Italy, pp. 3-11. |
| Baumann, Andrew, et al., “The Multikernel: A New OS Architecture for Scalable Multicore Systems,” Oct. 2009, SOSP '09, Oct. 11-14, 2009, Big Sky, Montana, USA, pp. 29-43. |
| Swift, Michael M. et al., “Improving the Reliability of Commodity Operating Systems,” ACM Transactions on Computer Systems, vol. 23, No. 1, Feb. 2005, pp. 77-110. |
| Xu, Min et al., “Towards a VMM-based Usage Control Framework for OS Kernel Integrity Protection,” SACMAT '07, Jun. 20-22, 2007, Sophia Antipolis, France, pp. 71-80. |
| Huang, Wei et al., “A Case for High Performance Computing with Virtual Machines,” ISC '06, Jun. 3 28 30, Carins, Queensland, Australia, pp. 125-134, Jun. 3, 2006. |
| Mysore, Shashidhar et al., “Understanding and Visualizing Full Systems with Data Flow Tomography,” SPOLOS '08, Mar. 1-5, 2008, Seattle, Washington, USA, pp. 211-221. |
| “DMA Engines Bring Multicast to PCI Express Systems,” http://electronicdesign.com, Aug. 13, 2009, 3 pages. |
| “Xen Wiki,” http://wiki.xensource.com/xenwiki/VTdHowTo, 5 pages, Apr. 16, 2010. |
| Vaidyanathan, K., et al., “Exploiting RDMA Operations for Providing Efficient Fine-Grained Resource Monitoring in Cluster-based Servers,” 1-4244-0328—Jun. 2006, 10 pages. |
| “IBM Enhances the IBM eServer zSeries 990 Family of Servers,” Hardware Announcement, Oct. 7, 2003, pp. 1-11. |
| “Intel® Virtualization Technology for Directed I/O,” Intel® Technology Journal, vol. 10, Issue 3, Aug. 10, 2006, pp. 1-16. |
| “I/O Virtualization and AMD's IOMMU,” AMD Developer Central, http://developer.amd.com/documentation/articles/pages/892006101.aspx, Aug. 9, 2006, pp. 1-2. |
| “z/Architecture Principles of Operation,” IBM Publication No. SA22-7832-07, Feb. 2009, pp. 1-1344. |
| “z/VM: Running Guest Operating Systems,” IBM Publication No. SC24-5997-02, Oct. 2001, pp. 1-179. |
| “z/VM: General Information Manual,” IBM Publication No. GC24-5991-05, May 2003, pp. 1-131. |
| Winwood, Simon, et al., “Multiple Page Size Support in the Linux Kernel”, Proceedings of Ottawa Linux Symposium, 2002 (no further date information available), pp. 1-21. |
| “z/Architecture Principles of Operation,” Chapter 17, pp. 17-1-17-30, IBM Publication No. SA22-7832-07, Feb. 2009. |
| “Intel® Itanium® Architecture Software Developer's Manual,” vol. 2, Rev. 2.2, Jan. 2006, pp. 1-653. |
| International Search Report and Written Opinion for PCT/EP2010/067039 dated Feb. 25, 2011, pp. 1-12. |
| International Search Report and Written Opinion for PCT/EP2010/067036 dated Feb. 14, 2011, pp. 1-11. |
| International Search Report and Written Opinion for PCT/EP2010/067030 dated Feb. 7, 2011, pp. 1-13. |
| International Search Report and Written Opinion for PCT/EP2010/067020 dated Apr. 5, 2011, pp. 1-10. |
| International Search Report and Written Opinion for PCT/EP2010/067025 dated Apr. 13, 2011, pp. 1-10. |
| International Search Report and Written Opinion for PCT/EP2010/067024 dated Apr. 27, 2011, pp. 1-9. |
| International Search Report and Written Opinion for PCT/EP2010/067019 dated Apr. 26, 2011, pp. 1-8. |
| International Search Report and Written Opinion for PCT/EP2010/067021 dated Apr. 28, 2011, pp. 1-8. |
| International Search Report and Written Opinion for PCT/EP2010/067043 dated Apr. 21, 2011, pp. 1-9. |
| International Search Report and Written Opinion for PCT/EP2010/067041 dated Apr. 26, 2011, pp. 1-8. |
| International Search Report and Written Opinion for PCT/EP2010/067031 dated Apr. 26, 2011, pp. 1-8. |
| International Search Report and Written Opinion for PCT/EP2010/067034 dated May 18, 2011, pp. 1-8. |
| International Search Report and Written Opinion for PCT/EP2010/067023 dated Jun. 15, 2011, pp. 1-12. |
| International Search Report and Written Opinion for PCT/EP2010/067032 dated May 27, 2011, pp. 1-10. |
| International Search Report and Written Opinion for PCT/EP2010/067038 dated Jun. 15, 2011, pp. 1-10. |
| “Chapter 6: Configuration Space” in PCI-SIG: “PCI Local Bus Specification Revision 3.0”, Feb. 2004, pp. 213-254. |
| Hennet, P. et al., “Programmable Interrupt Vectors in Processors,” IBM Technical Disclosure Bulletin, vol. 25, No. 5, Oct. 1, 1982, pp. 2641-2642. |
| Plambeck et al., “Development and Attributes of z/Architecture,” IBM Journal of Research and Development, IBM Corporation, vol. 46, No. 4/05, Jul. 1, 2002, pp. 367-379. |
| “z/Architecture Principles of Operation, Chapter 3”, Feb. 2008, pp. 1-71. |
| Gehringer, E. F., et al., “Virtual Memory Systems,” CSC-506—Architecture of Parallel Computers Computer Science Department, College of Engineering, North Carolina, Dec. 31, 1999, XP002631523, pp. 1-8. |
| “z/Architecture—Principles of Operation,” IBM Publication No. SA22-7832-05, Sixth Edition, Apr. 2007, Chapter 10, 10-1-10-138. |
| “PCI Local Bus Specification,” Mar. 29, 2002, pp. 1-328. |
| McGee, H.T., “Technique for Resetting a Single Channel Path Under Operator Control in IBM System/370XA,” IBM Technical Disclosure Bulletin, vol. 26, No. 10B, Mar. 1984, p. 1. |
| “Decreased Latency Across PCI Express With I/O Virtualization Via a Hint Interface,” IPCOM000185226D, Jul. 16, 2009, pp. 1-2. |
| Office Action for U.S. Appl. No. 12/821,171 dated Oct. 7, 2011, pp. 1-22. |
| Office Action for U.S. Appl. No. 12/821,182 dated Oct. 13, 2011, pp. 1-20. |
| Office Action for U.S. Appl. No. 12/821,184 dated Oct. 18, 2011, pp. 1-35. |
| Kamil et al., “Discussion #8 Topics: Paging, Multilevel Paging,” Mar. 2004, pp. 1-3. |
| Office Action for U.S. Appl. No. 12/821,172 dated Dec. 12, 2011, pp. 1-29. |
| Office Action for U.S. Appl. No. 12/821,185 dated Dec. 20, 2011, pp. 1-29. |
| Office Action for U.S. Appl. No. 12/821,174 dated Jan. 19, 2012, pp. 1-37. |
| Final Office Action for U.S. Appl. No. 12/821,184 dated Jan. 24, 2012, pp. 1-16. |
| Office Action for U.S. Appl. No. 12/821,193 dated Feb. 24, 2012, pp. 1-45. |
| “PCI Local Bus Specification Revision 3.0,” Aug. 12, 2002, pp. 39, 44, 48-49, 58. |
| Office Action for U.S. Appl. No. 12/821,187 dated Feb. 28, 2012, pp. 1-39. |
| Final Office Action for U.S. Appl. No. 12/821,171 dated Mar. 29, 2012, pp. 1-9. |
| Final Office Action for U.S. Appl. No. 12/821,185 dated Jun. 6, 2012, pp. 1-56. |
| “Atari PCI BIOS and Device Drive Specification 1.13,” Chapters 2, 3, 4 and 6; [online], internet archive dates Dec. 12, 2007 and Feb. 8, 2007; retrieved on May 24, 2012, 13 pages <URL:http://kunden.wvnet.at/fichti/docs/pcibios-2.htm; pcibios-3.htm; pcibios-4.htm, pcibios-6.htm>. |
| “PCI Device Access Under 32-bit PM DOS from Open Watcom,” [online], interne archive date Jul. 19, 2006; retrieved May 26, 2012, 14 pages <URL:http://www.openwatcom.org/index.php/PCI—Device—access—under—32-Bit—PM—DOS>. |
| Device Identification Strings from OSR online; [online], internet archive date Mar. 13, 2005; retrieved May 26, 2012, 3 pages <URL:http//www.osronline.com/ddkx/install/idstrings—8tt3.htm>. |
| Office Action for U.S. Appl. No. 12/821,190 dated Jun. 12, 2012, pp. 1-27. |
| Office Action for U.S. Appl. No. 12/821,174 dated Jun. 15, 2012, pp. 1-28. |
| International Search Report and Written Opinion for PCT/EP2010/067035 dated Mar. 8, 2011, pp. 1-10. |
| Final Office Action for U.S. Appl. No. 12/821,187 dated Jul. 16, 2012, pp. 1-24. |
| Office Action for U.S. Appl. No. 12/821,171 dated Jul. 19, 2012, pp. 1-18. |
| International Search Report and Written Opinion for PCT/EP2010/067029 dated Mar. 2, 2011, pp. 1-12. |
| “IBM 5ystem/390 I/O Call Reporting Process,” IBM Technical Disclosure Bulletin, vol. 36, No. 1, Jan. 1993, pp. 164-169, XP000222812. |
| “Means for Channel Subsystem-Initiated Communication,” IBM Technical Disclosure Bulletin, vol. 33, No. 12, May 1991, p. 169, XP000121623. |
| International Search Report and Written Opinion for PCT/EP2010/067028 dated Mar. 8, 2011, pp. 1-10. |
| International Search Report and Written Opinion for PCT/EP2010/067042 dated Apr. 28, 2011, pp. 1-11. |
| Communication Pursuant to Article 94(3) EPC for Application No. 10 776 350.0-2212 dated Oct. 31, 2012, pp. 1-6. |
| Final Office Action for U.S. Appl. No. 12/821,174 dated Nov. 13, 2012, pp. 1-29. |
| Office Action for U.S. Appl. No. 12/821,170 dated Feb. 1, 2013, pp. 1-28. |
| Office Action for U.S. Appl. No. 13/672,028 dated Feb. 1, 2013, pp. 1-21. |
| Communication Pursuant to Article 94(3) EPC for Application No. 10 784 272.6-1243 dated Feb. 6, 2013, pp. 1-7. |
| Final Office Action for U.S. Appl. No. 12/821,171 dated Mar. 18, 2013, pp. 1-11. |
| Office Action for U.S. Appl. No. 12/821,181 dated Mar. 26, 2013, pp. 1-37. |
| Notice of Allowance for U.S. Appl. No. 12/821,185 dated Apr. 11,2013, pp. 1-16. |
| Notice of Allowance for U.S. Appl. No. 12/821,172 dated Apr. 30, 2013, pp. 1-30. |
| Communication Pursuant to Article 94(3) EPC for Application No. 10 776 345.0-1956, dated May 31, 2013, pp. 1-6. |
| Communication Pursuant to Article 94(3) EPC for Application No. 10 778 994.3-1960, dated Jul. 3, 2013, pp. 1-7. |
| Office Action for U.S. Appl. No. 12/821,190 dated Sep. 4, 2013, pp. 1-6. |
| Office Action for U.S. Appl. No. 12/821,174 dated Nov. 19, 2013, pp. 1-35. |
| Office Action for U.S. Appl. No. 12/821,190 dated Jun. 22, 2015, pp. 1-8. |
| Number | Date | Country | |
|---|---|---|---|
| 20140129796 A1 | May 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13672028 | Nov 2012 | US |
| Child | 14093609 | US | |
| Parent | 12821170 | Jun 2010 | US |
| Child | 13672028 | US |
