WO2011160726A1 - Extending the number of general purpose registers available to instructions - Google Patents

Extending the number of general purpose registers available to instructions Download PDF

Info

Publication number
WO2011160726A1
WO2011160726A1 PCT/EP2010/067048 EP2010067048W WO2011160726A1 WO 2011160726 A1 WO2011160726 A1 WO 2011160726A1 EP 2010067048 W EP2010067048 W EP 2010067048W WO 2011160726 A1 WO2011160726 A1 WO 2011160726A1
Authority
WO
WIPO (PCT)
Prior art keywords
instruction
bit
instructions
bits
operand
Prior art date
Application number
PCT/EP2010/067048
Other languages
French (fr)
Inventor
Dan Greiner
Marcel Mitran
Timothy Slegel
Original Assignee
International Business Machines Corporation
Ibm United Kingdom Limited
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corporation, Ibm United Kingdom Limited filed Critical International Business Machines Corporation
Priority to CA2786049A priority Critical patent/CA2786049C/en
Priority to MX2012014533A priority patent/MX2012014533A/en
Priority to AU2010355817A priority patent/AU2010355817B2/en
Priority to RU2012149004/08A priority patent/RU2562430C2/en
Priority to SG2012087284A priority patent/SG186078A1/en
Priority to EP10776353A priority patent/EP2430521A1/en
Publication of WO2011160726A1 publication Critical patent/WO2011160726A1/en
Priority to IL223587A priority patent/IL223587A/en
Priority to ZA2012/09644A priority patent/ZA201209644B/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30098—Register arrangements
    • G06F9/3012—Organisation of register space, e.g. banked or distributed register file
    • G06F9/30138—Extension of register space, e.g. register cache
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/34—Addressing or accessing the instruction operand or the result ; Formation of operand address; Addressing modes
    • G06F9/342—Extension of operand address space
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30098—Register arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30098—Register arrangements
    • G06F9/30105—Register structure
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30098—Register arrangements
    • G06F9/3012—Organisation of register space, e.g. banked or distributed register file
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
    • G06F9/3016—Decoding the operand specifier, e.g. specifier format
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
    • G06F9/3016—Decoding the operand specifier, e.g. specifier format
    • G06F9/30167—Decoding the operand specifier, e.g. specifier format of immediate specifier, e.g. constants
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30181—Instruction operation extension or modification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30181—Instruction operation extension or modification
    • G06F9/30189—Instruction operation extension or modification according to execution mode, e.g. mode flag
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/32—Address formation of the next instruction, e.g. by incrementing the instruction counter
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/32—Address formation of the next instruction, e.g. by incrementing the instruction counter
    • G06F9/322—Address formation of the next instruction, e.g. by incrementing the instruction counter for non-sequential address
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/32—Address formation of the next instruction, e.g. by incrementing the instruction counter
    • G06F9/322—Address formation of the next instruction, e.g. by incrementing the instruction counter for non-sequential address
    • G06F9/323—Address formation of the next instruction, e.g. by incrementing the instruction counter for non-sequential address for indirect branch instructions

Definitions

  • the present invention is related to computer systems and more particularly to computer system processor instruction functionality.
  • IBM ⁇ is a registered trademark of International Business Machines
  • IBM has created through the work of many highly talented engineers beginning with machines known as the IBM® System 360 in the 1960s to the present, a special architecture which, because of its essential nature to a computing system, became known as "'the mainf ame” whose principles of operatio state the architecture of the machine by describing the instructions which may be executed upon the "mainframe” implementation of the instructions which had been invented by IBM inventors and a dopted , because of their signi ficant contribution to impro ving the state of the computing machine represented by "the mainframe ' ', as significant contributions by inclusion in IBM's Principles of Operation as stated over the years.
  • the representati e ost Computer 50 comprises one or more CPUs 1 in communication with main store (Computer Memory 2) as well as I/O interfaces to storage devices 11 and networks 10 for communicating with other computers or SANs and the like.
  • the CPU 1 is compliant with an architecture having an architected instruction set and architected flmctionaiity.
  • the CPU 1 may have Dynamic Address Translation (DAT) 3 for transforming program addresses (virtual addresses) into real address of memory.
  • DAT Dynamic Address Translation
  • a DAT typically includes a Translation Lookaside Buffer (TLB) 7 for caching translations so that later accesses to the block of computer memory 2 do not require the delay of address translation.
  • TLB Translation Lookaside Buffer
  • a cache 9 is employed between Computer Memory 2 and the Processor 1 , The cache 9 may be hierarchical having a large cache available to more than one CPU and smaller, faster (lower level) caches between the large cache and each CPU. In some implementations the lower level caches are split to provide separate low level caches for instruction fetching and data accesses.
  • an instruction is fetched from memory 2 by an instruction fetch unit 4 via a cache 9. The instruction is decoded in an instruction decode unit (6) and dispatched (with other instructions in some embodiments) to instruction execution units 8.
  • execution units 8 typically several execution units 8 are employed, for example an arithmetic execution unit, a floating point execution unit and a branch instruction execution unit.
  • the instruction is executed by the execution unit, accessing operands from instruction specified registers or memory as needed. If an operand is to be accessed (loaded or stored) from memory 2, a load store unit 5 typically handles the access under control of the instruction being executed. Instructions may be executed in hardware circuits or in internal microcode (firmware) or by a combination of both.
  • an example of an emulated Host Computer system 21 is provided that emulates a Host computer system 50 of a Host architecture.
  • the Host processor (CPU) 1 is an emu lated Host processor (or virtual Host processor) and comprises an emulation processor 27 having a different native instruction set architecture than tha t of the processor I of the Host Computer 50.
  • the emula ted Host Compu ter system 21 has memory 22 accessible to the emulation processor 27.
  • the Memory 27 is partitioned into a. Host Computer Memory 2 portion and an Emulation Routines 23 portion.
  • the Host Computer Memory 2 is available to programs of the emulated Host Computer 21 according to Host Computer Architecture.
  • the emulation Processor 27 executes native instructions of an architected instruction set of an architecture other than that of the emulated processor 1, the native instructions obtained from Emulation Routines memory 23, and may access a Host instruction for execution from a program in Host Computer Memory 2 by employing one or more instructions) obtained in a Sequence & Access/Decode routine which may decode the Host instruction ⁇ ) accessed to determine a native instruction execution routine for emulating the function of the Host instruction accessed.
  • Architected Facilities Routines including such facilities as General Purpose Registers, Control Registers, Dynamic Address Translation and I/O Subsystem support and processor cache for example.
  • the Emulation Routines may also take advantage of function available in the emulation Processor 27 (such as general registers and dynamic translation of virtual addresses) to improve performance of the Emulatio Routines.
  • Special Hardware and Off- Load Engines may also be provided to assist the processor 27 in emulating the function of the Host Computer 50.
  • 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. pSeries ⁇ Servers and xSeries® Servers). They can be executed in machines running Liimx on a wide variety of machines using hardware manufactured by I BM®, Intel®, AMDTM, Sun Microsystems and others. Besides execution on that hardware under a ⁇ Architecture®, Linux can be used as well as machines which use emulation as described at http://www.turboherc les.com,
  • emulation software is executed by a native processor to emulate the architecture of an emulated processor.
  • the native processor 27 typically executes emulation software 23 comprising either firmware or a native operating system to perform emulation of the emulated processor.
  • the emulation software 23 is responsible for fetching and executing instructions of the emulated processor architecture.
  • the emulation software 23 maintains an emulated program counter to keep track of instruction boundaries.
  • the emulation software 23 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 27. These converted instructions may be cached such that a faster conversion can be accomplished.
  • the emulation software must maintain the architecture rules of the emulated processor architecture so as to assure operating systems and applications written for the emulated processor operate correctly.
  • the emulation software must provide resources identified by the emulated processor 1 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 am on the emulated processor, can be am on the native processor having the emulation software.
  • resources identified by the emulated processor 1 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 am on the emulated processor, can be am on the native processor having the emulation software.
  • a specific instruction being emulated is decoded, and a subroutine called to perform the function of the indi vidual instruction.
  • An emulation software function 23 emulating a function of an emulated processor 1 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 em.ulati.on patents including, but not limited to US 5551013 for a "Multiprocessor for hardware emulation" of Beausoleii et ai., and US6009261 :
  • the present invention provides extended precision in SIMD arithmetic operations in a processor having a register file and an accumulator.
  • a first set of data elements and a second set of data elements are loaded into first and second vector registers, respectively. Each data element comprises N bits.
  • an arithmetic instruction is fetched from memory. The arithmetic instruction is decoded. Then, the first vector register and the second vector register are read from the register file.
  • the present invention executes the arithmetic instruction on corresponding data elements in the first and second vector registers. The resulting element of the execution is then written into the accumulator. Then, the resulting element is transformed into an N-bit width element and written into a third register for further operation or storage in memory.
  • the transformation of the resulting element can include, for example, rounding, clamping, and/or shifting the element.
  • an effective number of General Purpose Registers (GPRs) available to instructions of a program is extended in a computer having a first umber of large GPRs, each instruction comprising an opcode a d o e or more GPR fields for specifying corresponding GPRs, each large GPR comprising a first portion and a second portion, said large GPRs comprising first small GPRs consisting of first portions and second small GPRs consisting of second portions, wherein responsive to the computer being in a small GPR mode, performing a) and b) are performed, a) instructions of a first set of instructions are executed, the first set of instructions for accessing said first small GPRs, the execution comprising generating memory addresses for accessing memory operands based o said first small GPRs or accessing first small GPR operands, wherein the first small GPRs consist of said first portions; and b) instructions of a second set of instructions are executed, the second set of instructions for accessing said
  • the small GPR mode comprises being in one of a. 24 bit addressing .mode or a 31 bit addressing mode.
  • the first portion is 32 bits
  • the second portion is 32 bits
  • the third portion is 64 bits.
  • executio of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consisting of an ADD of two operands function or a. COMPARE of two operands function.
  • execution of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consists of a LOAD of an operand from memory -function or a STORE of an operand to memory function.
  • execution of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function is a ROTATE THEN INSERT
  • SELECTED BITS function comprising: rotating a source operand by an instruction specified amount; and inserting a selected portion of the rotated source operand in a selected portion of a target o perand.
  • an. Operating System is supported operating in Large GPR mode wherein the Large GPRs are saved and restored during context switches for Applications running in Small GPR mode.
  • an Operating System operates in Large GPR mode wherein the Large GPRs are saved and restored during context switches for Applications running in Small GPR mode.
  • an Operating System operates in Large GPR mode wherein the Large
  • GPRs are saved and restored during context switches for Applications running in Small GPR mode.
  • FIG. 1 A is a diagram depicting an example Host computer system
  • FIG. I B is a diagram depicting an example emulation Host computer system
  • FIG. 1.C Is a. diagram depicting an example computer system
  • FIG. 2 is a diagram depicting an example computer network
  • FIG. 3 is a diagram depicting an elements of a computer system
  • FIGs. 4A-4C depict detailed elements of a computer system
  • FIGs. 5A-5F depict machine instruction format of a computer system
  • FIG. 6 depicts an example Large GPR
  • FIGs. 7A-7B presents an example High- Word embodiment flow
  • FIG. 8 depicts a example context switch flow.
  • An embodiment may be practiced by software (sometimes referred to Licensed Internal (“ode, Firmware, Micro-code, Mil Si-code, Pico-code and the like, any of which would be consistent with the embodiments).
  • software program code is typically accessed by the processor also known as a CPU (Central Processing Unit) 1 of the system 50 from long-term storage media 11, such as a CD-ROM drive, tape drive or hard drive.
  • the software program code may be embodied on any of a. variety of known media, .for use with a data processing system, such as a diskette, hard drive, or CD-ROM.
  • the code may be distributed on such media, or may be distributed to users from the computer memory 2 or storage of one computer system, over a network 10 to other computer systems for use by users of such other systems.
  • the program code may be embodied in the memory 2, and accessed by the processor 1 using the processor bus.
  • Such 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 dense storage media 11 to high-speed memory 2 where it is available for processing by the processor 1.
  • 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,
  • FIG. I C illustrates a representative workstation or server hardware system.
  • the system 100 of FIG. IC comprises representative computer system 101, such as a personal computer, a workstation or a server, including optional peripheral devices.
  • the workstation 101 includes one or more processors 106 and a bus employed to connect and enable communication between the processors) 106 and the other components of the system 101 in accordance with known techniques.
  • the bus connects the processor 106 to memory 105 and long-term storage .107 which can include a hard drive (including any of magnetic media, CD, DVD and Flash Memory for example) or a tape drive for example.
  • the system 101 might also include a user interface adapter, which connects the microprocessor 106 via the bus to one or more interface devices, such as a keyboard .104, mouse 103, a Printer/scanner 110 and/or other interface devices, which can be any user interface device, such as a touch sensitive screen, digitized entry pad, etc.
  • the bus also connects a display device 102, such as an LCD screen, or monitor, to the microprocessor 106 via a display adapter.
  • the system 101 may communicate with other computers or networks of computers by way of a network adapter capable of communicating 108 with a network 109.
  • Example network adapters are communications channels, token ring, Ethernet or modems.
  • the workstation 101 may communicate using a wireless interface, such as a CDPD (cellular digital packet data) card.
  • CDPD cellular digital packet data
  • the workstation. 1.01 may be associated with such other computers in a Local Area Network (LAN) or a Wide Area Network (WAN), or the workstation 101 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,
  • FIG. 2 illustrates a data processing network 200 in which embodiments may be practiced.
  • the data processing network 200 may include a plurality of individual networks, such as a wireless network and a wired network, each of which may include a plurality of individual workstations 101 201 202 203 204. Additionally, as those skilled in. the art will appreciate, one or more LANs may be included, where a LAN may comprise a plurality of intelligent workstations coupled to a host processor.
  • the networks may also include mainframe computers or servers, such as a gateway computer (client server 206) or application server (remote server 208 which may access a data repository and may also be accessed directly from a workstation 205).
  • a gateway computer 206 serves as a point of entry into each network 207. A gateway is needed when connecting one networking protocol to another.
  • the gateway 206 may be preferably coupled to another network (the Internet 207 for example) by means of a communications link.
  • the gateway 206 may also be directly coupled to one or more workstations 10.1 20.1 202 203 204 using a communications link.
  • the gateway computer may be implemented utilizing an IBM eServerTM zSeries® z9® Server available from IBM Corp.
  • Software programming code is typically accessed by the processor 1.06 of the system 101 from long-term storage media 107, such as a CD-ROM drive or hard drive.
  • the software programming code may be embodied on any of a variety of known media for use with a data processing system, such as a diskette, hard drive, or CD-ROM.
  • the code may be distributed on such media, or may be distributed to users 210 211 from the memory or storage of one computer system, over a network to other computer systems for use by users of such other systems.
  • the programming code 1 1 1 may be embodied in the memory 105, and accessed by the processor 106 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 112.
  • Program code is normally paged from dense storage media 107 to high-speed memory 105 where it is available for processing by the processor 106.
  • 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 is the lowest (1,1 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 (l-Cache) holding machine instructions to be executed and a data cache (D-Cache) holding data operands.
  • FIG. 3 an exemplary processor embodiment, is depicted for processor 106.
  • the cache 303 is a high speed buffer holding cache lines of memory data that are likely to be used. Typical cache lines are 64, 128 or 256 bytes of memory data. Separate Caches are often employed for caching instructions than for caching data. Cache coherence (synchronization of copies of lines in Memory and the Caches) is often provided by various "Snoop" algorithms well known in the art.
  • Main storage 105 of a processor system is often referred to as a cache.
  • main storage 105 In a processor system having 4 levels of cache 303 main storage 105 is sometimes referred to as the level 5 (L5) cache since it is typically faster and only holds a portion of the non-volatile storage (DASD, Tape etc) that is available to a computer system.
  • Main storage 105 "caches" pages of data paged in and out of the main storage 105 by the Operating system.
  • a program counter (instruction counter) 311 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 typical iy embodied in a PSW (program, status word) of a computer such that it persists during context switching.
  • PSW program, status word
  • a program in progress having a program counter value
  • the PS W of the program maintains the program counter value while the program, is not active, and the progra counter (in the PS W) of the operating system is used while the operating system is executing.
  • the Program, counter is incremented by an amount equal to the number of bytes of the current instruction.
  • RISC Reduced instruction Set Computing
  • CISC Complex Instruction Set Computing
  • Instructions of the IBM z/ Architecture are CISC ' instructions having a length of 2, 4 or 6 bytes.
  • the Program counter 311 is modified by either a context switch operation or a Branch taken operation of a Branch instruction for example.
  • a context switch operation the current program counter value is saved in a Program Status Word (PSW) along with other slate 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 resu lt of the Branch Instruction into the Pro gram Counter 311.
  • an instruction Fetch Unit 305 is employed to fetch instructions on behalf of the processor 106.
  • 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 106.
  • the fetched instruction(s) are passed to a dispatch unit 306 of the fetch unit .
  • the dispatc unit decodes the instruction(s) and forwards information about the decoded instruetion(s) to appropriate units 307 308 310.
  • An execution unit 307 will typically receive information about decoded arithmetic instructions from the instruction fetch unit 305 and will perform arithmetic operations on operands according to the opcode of the instruction. Operands are provided to the execution unit 307 preferably either from memory 105, architected registers
  • Results of the execution when stored, are stored either in memory 105, registers 309 or in other machine hardware (such as control registers, PS W registers and the like).
  • a processor 106 typical ly has one or more execution units 307 308 310 for executing the function of the instruction.
  • an execution unit 307 may communicate with architected general registers 309, a decode/dispatch unit 306 a load store unit 310 and other '401 processor units by way of interfacing logic 407.
  • An Execution unit 307 may employ several register circuits 403 404 405 to hold information that the arithmetic logic unit (ALU) 402 will operate on.
  • the ALU performs arithmetic operations such as add, subtract, multiply and divide as well as logical function such as and, or and exciusive-or (xor), rotate and shift.
  • the ALU supports specialized operations that are design dependent.
  • circuits may provide other architected facilities 408 including condition codes and recovery support logic for example.
  • the result of an ALU operation is held in an output register circuit 406 which can forward the result to a variety of other processing functions.
  • processor units There are many arrangements of processor units, the present description is only intended to provide a representative understanding of one embodiment.
  • An ADD instruction for example would be executed in an execution unit 307 having arithmetic and logical functionality while a Floating Point instruction for example wou ld be executed in a Floating Point Execution having specialized Floating Point capability.
  • an execution unit operates on operands identified by an instruction by performing an opcode defined function on the operands.
  • an ADD instruction may be executed by an execution unit 307 on operands found in two registers 309 identified by- register fields of the instruction.
  • the execution unit 307 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) '402 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.
  • ALU Arithmetic Logic Unit
  • Some ALUs 402 are designed for scalar operations and some for floating point. Data may he 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.
  • 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 and 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.
  • Trimodal addressing refers to the ability to switch between the 24-bit, 31-bit, and 64-bit addressing modes. This switching can be done by means of:
  • R2 general register is one. If bit 63 is zero, the instructions set the 24-bit or 31 -bit addressing mode if bit 32 of the register is zero or one, respectively. • The new instruction SET ADDRESSING MODE (SAM24, SAM3.1 , and SAM 64). The instruction sets the 24-bit,. 3 1 -bit, or 64-bit addressing mode as determined by the operation code.
  • Trimodal addressing affects the general instructions only in the manner in which logical storage addresses are handled, except as follows.
  • BRANCH AND SAVE AND SET MODE and BRANCH AND SET MODE place a one in bit position 63 of general register J in the 64-bit addressing mode, in the 24-bit or 31 -bit mode, BRANCH AND SAVE AND SET "' MODE sets bit 63 to zero, and BRA CH AND SET MODE leaves it unchanged.
  • Bits 0- 1 of general registers are changed by two types of instructions.
  • the first type is a modal instruction (see the preceding section) when the instruction is executed in the 64-bit addressing mode.
  • the second type is an instruction having, independent of the addressing mode, either a 64-bit result operand in a single general register or a 128-bit result operand in an even-odd general-register pair. Most of the instructions of the second type are indicated by a "(3,” either alone or in "GF,” m their mnemonics. All of the instructions of the second type are sometimes referred to as "G-type" instructions. If a program is not executed in the
  • Branch instruction information for executing a branch instruction is typically sent to a branch unit 308 which ofte employs a branch prediction algorithm such as a branch history table 432 to predict the outcome of the branch before other conditional operations are complete.
  • the target of the current branch instruction will be fetched and speculatively executed before the conditional operations are complete.
  • the speculatively executed branch instructions are either completed or discarded based on the conditions of the conditional operation and the speculated outcome.
  • a typical branch instruction may test condition codes and branch to a target address if the condition codes meet the branch requirement of the branch instruction, a target address may be calculated based on several numbers including ones found in register fields or an immediate field of the instruction for example.
  • the branch unit 308 may employ an ALU 426 having a plurality of input register circuits 427 428 429 and an output register circuit 430.
  • the branch unit 308 may communicate with general registers 309, decode dispatch unit 306 or other circuits 425 for example.
  • 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.
  • 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- pro vide 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
  • 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.
  • a processor accesses storage using a Load/Store unit 3 10.
  • the Load/Store unit 310 may per.fb.rrn a Load operation by obtaining the address of the target operand in memory 303 and loading the operand in a register 309 or another memory 303 location, or may per.fb.rrn.
  • the Load/Store unit 310 may be speculative and may access memory in a sequence that is out-of-order relative to instruction sequence, however the Load/Store unit 310 must maintain the appearance to programs that instructions were executed in order.
  • a load/store unit 310 may communicate with general registers 309, decode/dispatch unit 306, Cache/Memory interface 303 or other elements 455 and comprises various register circuits, ALUs 458 and control logic 463 to calculate storage addresses and to provide pipeline sequencing to keep operations in-order. Some operations may be out of order but the Load/Store unit provides functionality to make the out of order operations to appear to the program as having been performed in order as is wel l known in the art..
  • 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) 3 12 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.
  • DAT Dynamic Address Translation
  • 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.
  • TLB Translation Look-aside Buffer
  • LRU Least Recently used
  • each processor has responsibility to keep shared resources such as I/O, caches, TLBs and Memory interlocked for coherency.
  • shared resources such as I/O, caches, TLBs and Memory interlocked for coherency.
  • snoop technologies will be utilized in maintaining cache coherency.
  • each cache line may be marked as being in any one of a shared state, an exclusi ve state, a changed state, an invalid state and the like in order to facilitate sharing.
  • I/O units 304 provide the processor with means for attaching to peripheral devices including Tape, Disc, Printers, Displays, and networks for example. I/O units are often presented to the computer program by software Drivers. In Mainframes such as the z/Series from IBM, Channel Adapters and Open System Adapters are I/O units of the Mainframe that provide the communications between the operating system and peripheral devices.
  • Mainframes such as the z/Series from IBM
  • Channel Adapters and Open System Adapters are I/O units of the Mainframe that provide the communications between the operating system and peripheral devices.
  • a computer system includes information in 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 must 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 C ACHE 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 horizonta l 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, 3.1 , 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.
  • 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.
  • a group of bytes is called a field.
  • bits are numbered in a leii-to- right sequence. 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 ears be addressed.
  • the bits in a byte are numbered 0 through 7, from left to right.
  • the bits in an address may be numbered 8-3.1 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.
  • the bits making up the format are consecutively numbered starting from 0.
  • one or more check bits may be transmitted with each byte or with a group of bytes. Such check bits are generated automatical ly by the machine and cannot be directly controlled by the program. Storage capacities are expressed in number of bytes.
  • the field 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.
  • 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. 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 physica l path to storage may be greater than the length of the field being stored.
  • a boundary is called integral for a unit of information when its storage address is a multiple of the length of the unit m 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 do bleword 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.
  • operation of the CPU is controlled by instructions in storage that are executed sequentially, one at a time, left to right in an ascending sequence of storage addresses.
  • a change in the sequential operation may be caused by branching, LOAD PSW, interruptions, SIGNAL PROCESSOR orders, or manual intervention.
  • an instruction comprises two major parts:
  • Instruction formats of the zJ Architecture are shown in F!Gs, 5A-5F.
  • An instruction can simply pro vide an Opcode 501 , or an opcode and a variety of fields including immediate operands or register specifiers for locating operands in registers or in memory.
  • the Opcode can indicate to the hardware that implied resources (operands etc.) are to be used such as one or more specific general purpose registers (GPRs).
  • Operands can be grouped in three classes: operands located in registers, immediate operands, and operands in storage. Operands ma ⁇ be either explicitly or implicitly designated.
  • Register operands can be located in general, floating- point, access, or control registers, with the type of register identified by the op code.
  • the register containing the operand is specified by identifying the register in a four-bit field, called the R. field, in the instruction.
  • an operand is located in an implicitly designated register, the register being implied by the op code, immediate operands are contained within the instruction, and the 8-bit, 16-bit, or 32-bit field containing the immediate operand is called the ] field.
  • Operands in storage may have an implied length; be specified by a bit mask; be specified by a four-bit or eight-bit length specification, called the L field, In the instruction; or have a length specified by the contents of a general register.
  • the addresses of operands in storage are specified by means of a format that uses the contents of a general register as part ofthe address. This makes it possible to:
  • the address used to refer to storage either is contained in a register designated by the R field in the instruction or is calculated from a base address, index, and displacement, specified by the B, X, and D fields, respectively, in the instruction.
  • a B or R field may designate an access register in addition to being used to specify an address.
  • operands are preferably designated as first and second operands and, in some cases, third and fourth operands. In general, two operands participate In an instruction execution, and the result replaces the first operand.
  • An instruction is one, two, or three haifwords in length and must be located in storage on a halfword boundary. Referring to FIGs.
  • each instruction is in one of 25 basic formats: E 501 , ⁇ 502, RI 503 504, RJE 505 551 552 553 554, RIL 506 507, RIS 555, RR 510, RRE 511, RRF 512 513 514, RRS, RS 516 517, RSI 520, RSI, 521 , RSY 522 523, RX 524, RXE 525, RXF 526, RXY 527, S 530, SI 531 , SI L 556, SIY 532, SS 533 534 535 536 537, SSE 541 and SSF 542, with three variations of RRF, two of RI, RIL, RS, and RSY, five of RJ E and SS.
  • the .fb.rm.at names Indicate, in general terms, the classes of operands which, participate in the operation and some details about fields:
  • RIS denotes a register-and-immediate operation and a storage operation.
  • RRS denotes a register-and-register operation and a storage operation.
  • SIL denotes a storage-and- immediate operation, with a 16-bit immediate field.
  • tlie first byte of an instruction contains tlie op code.
  • the first two bytes of an instruction contain the op code, except that for some instructions in the S format, the op code is in only the first byte.
  • the op code is in the first byte and bit positions 12- 15 of an instruction.
  • the op code is in the first byte and the sixth byte of an instruction.
  • the first two bits of the first or only byte of the op code specify the length and format of the instruction, as follows:
  • the contents of the register designated by the R.l . field are called the first operand.
  • the register containing the first operand is sometimes referred to as the "first operand location," and sometimes as "register Rl".
  • the R2 field designates the register containing the second operand, and the R2 field may designate the same register as Rl .
  • the use of the R3 field depends on the instruction.
  • the R3 field may instead be an M3 field specifying a mask.
  • the R fieid designates a general or access register in the general instructions, a general register in the control instructions, and a floating-point register or a general register in the floating-point instructions.
  • the register operand is i bit positions 32-63 of the 64-bit register or occupies the entire register, depending on the instruction.
  • the contents of the eight-bit immediate- data field, the I field of the instruction are directly used as the operand.
  • the contents of the eight-bit immediate- data field, the 12 field of the instruction are used directly as the second operand.
  • the Bl and D 1 fields specify the first operand, which is one byte in length.
  • the operation is the same except that DH.1 and DEI fields are used instead of a Dl fieid.
  • the contents of the 12 field are used as an unsigned binary integer or a logical value, and the Rl field specifies the first operand, which is 64 bits in length.
  • the contents of the 16- bit 12 field are used as a signed binary integer designating a number of halfwords. This number, when added to the address of the branch instruction, specifies the branch address.
  • the 12 field is 32 bits and is used in. the same way.
  • the contents of the 16-bit 12 field are used as a signed binary integer designating a number of halfwords. This number, when added to the address of the branc instruction, specifies the branc address.
  • the 12 field is 32 bits and is used in the same way.
  • the contents of the 16-bit 14 field are used as a signed binary integer designating a number of halfwords that are added to the address of the instruction to form the branch address.
  • the contents of the general register designated by the Bl field are added to the contents of the Dl field to form the first -operand address.
  • the contents of the general register designated by the B2 field are added to the contents of the D2 field or DH2 and DL2 fields to form the second-operand address.
  • the contents of the general registers designated by the X2 and B2 fields are added to the contents of the D2 field or DH2 and DL2 fields to form the second-operand address.
  • the contents of the general register designated by the B4 field are added to the contents of the D4 field to form the fourth-operand address.
  • L specifies the number of additional operand bytes to the right of the byte designated by the first-operand address. Therefore, the length in bytes of the first operand is 1-256, corresponding to a length code in L of 0-255. Storage results replace the first operand and are never stored outside the field specified by the address and length. In this format, the second operand has the same length as the first operand.
  • LI specifies the number of additional operand bytes to the right of the byte designated by the first -operand address. Therefore, the length in bytes of the first operand is 1 -16, corresponding to a length code in LI of 0-15.
  • L2 specifies the number of additional operand bytes to the right of the location designated by the second-operand address Results replace the first operand and are never stored outside the field specified by the address and length, if the first operand is longer than the second, the second operand is extended on the left with zeros up to the length of the ftrst operand. This extension does not modify the second operand in storage.
  • the contents of the general register specified by the Rl. field are a 32-bit unsigned value called the true length.
  • the operands are both of a length called the effective length.
  • the effective length is equal to the true length or 256, whichever is less.
  • the instructions set the condition code to facilitate programming a loop to move the total number of bytes specified by the true length.
  • the SS format with two R fields is also used to a range of registers and two storage operands for the LOAD MU LTIPLE DISJOINT instruction and to specify one or two registers and one or two storage operands for the PERFORM: LOCKED OPERATION instruction.
  • a zero in any of the Bl, B2, X2, or B4 fields indicates the absence of the corresponding address component. For the absent component, a zero is used informing the intermediate sum, regardless of the contents of general register 0, A displa cement of zero has no specia l significance.
  • Bits 1 and 32 of the current PSW are the addressing- mode bits. Bit 31 is the extended- addressing mode bit, and bit 32 is the basic-addressiiig-mode bit.
  • bits 3.1 and 32 of the current PSW both are zeros, the CPU is in the 24-bit addressing mode, and 2 -bit instruction and operand effective addresses are generated.
  • bit 1 of the current PSW is zero and bit 32 is one, the CPU is in the 31-bit addressing mode, and 31 -bit instruction and operand effective addresses are generated.
  • bits 31 and 32 of the current PSW are both one, the CPU is in the 64-bit addressing mode, and 64-bit instruction and operand effective addresses are generated. Execution of instructions by the CPU involves generation of the addresses of instructions and operands.
  • An. operand address that refers to storage is derived from a intermediate value, which either is contained in a register designated by an R field in the instruction or is calculated from the sum of three binary numbers: base address, index, and displacement.
  • the base address (B) is a 64-bit number contained in a general register specified by the program in a four bit field, called the B field, in the instruction.
  • Base addresses can be used as a means of independently addressing each program, and data area. In array type calculations, it can designate the location of an array, and, in record-type processing, it can identify the record.
  • the base address provides for addressing the entire storage.
  • the base address may also be used for indexing.
  • the index (X) is a 64-bit number contained in a general register designated by the program in a four -bit field, called the X field, in the instruction. It is included only in the address specified by the RX ⁇ , RXE-, and RX ' V -format instructions.
  • the RX-, K L-, RXF-, and RXY- format instructions permit double indexing; that is, the index can be used to provide the address of an element, within an array.
  • the displacement (D) is a 12-bit or 20-bit. number contained in a field, called the D field, in the instruction.
  • a 12-bit displacement is unsigned and provides for relative addressing of up to 4,095 bytes beyond the location designated by the base address.
  • a 20-bit displacement is signed and provides for relative addressing of up to 524,287 bytes beyond the base address location or of up to 524,288 bytes before it.
  • the displacement can be used to specify one of many items associated with an element.
  • the displacement can be used to identify items within a record,
  • a 12-bit displacement is in bit positions 20-31 of instructions of certain formats. In instructions of some formats, a second 12-bit displacement also is in the instruction, in bit positions 36-47.
  • a 20-bit displacement is in instructions of only the RSY, RXY, or SIY format, in these instructions, the D field consists of a DL (low) field in bit positions 20-31 and of a DH (high) field in bit positions 32-39.
  • the numeric value of the displacement is formed by appending the contents of the DH field on the left of the contents of the DL field.
  • the numeric value of the displacement is formed by appending eight zero bits on the left of the contents of the DL field, and the contents of the DH field are ignored.
  • the base address and index are treated as 6 -bit binary integers.
  • a 12-bit displacement is treated as a 12-bit unsigned binary integer, and 52 zero bits are appended on the left.
  • a 20-bit displacement is treated as a 20-bit signed binary integer, and 44 bits equal to the sign bit are appended on the left.
  • the three are added as 64- bit binary numbers, ignoring overflow.
  • the sum is always 64 bits long and is used as an intermediate value to form the generated address.
  • the bits of the intermediate value are numbered 0-63.
  • a zero in any of the B 1 , B2, X2, or B4 fields indicates the absence of the corres onding address component. For the absent component, a zero is used in forming the intermediate sum, regardless of the contents of general register 0.
  • a displacement of zero has no special significance.
  • An instruction can designate the same general register both for address computation and as the location of an operand. Address computation is completed before registers, if any, are changed by the operation.
  • the generated operand address designates the leftmost byte of an operand in storage.
  • the generated operand address is always 64 bits long, and the bits are numbered 0-63. The manner in which the generated address is obtained from the intermediate value depends on the current addressing mode. In the 24-bit addressing mode, bits 0-39 of the intermediate value are ignored, bits 0-39 of the generated address are forced to be zeros, and bits 40-63 of the intermediate value beeome bits 40-63 of the generated address.
  • bits 0-32 of the intermediate value are ignored, bits 0-32 of the generated address are forced to be zero, and bits 33-63 of the i termediate value become bits 33-63 of the generated address.
  • bits 0-63 of the intermediate value become bits 0-63 of the generated address.
  • Negative values may be used in index and base-address registers. Bits 0-32 of these values are ignored in the 31 -bit addressing mode, and bits 0-39 are ignored in the 24-bit addressing mode.
  • the address of the next instruction to be executed when the branch is taken is called the branch address.
  • the instruction format may be RR, REE, RX, RXY. RS. RSY, kSL RI, RJE, or R L.
  • the branch address is specified by a base address, a displacement, and, in the RX and RXY * formats, an index.
  • the generation of the intermediate value follows the same rules as for the generation of the operand-address intermediate value.
  • the contents of the general register designated by the R.2 field are used as the intermediate value from which the branch address is formed.
  • a value of zero in the R2. field causes the instruction to be executed without branching.
  • the relative-branch instructions are in the RSI, RI, RIE, and RI L. formats.
  • the contents of the 12 field are treated as a 16-bit signed binary integer designating a number of haifwords.
  • the contents of the ⁇ 2 field are treated as a 32-bit signed binary integer designating a number of haifwords.
  • the branch address is the number of haifwords designated by the 12 field added to the address of the relative- branch instruction.
  • the 64-bit intermediate value for a relative branch instruction in the RSI, RI, RIE, or RJ format is the sum of two addends, with overflow from bit position 0 ignored.
  • the first addend is the conten ts of the 12 field with one zero bit appended on the right and 47 bits equal to the sign bit of the contents appended on the left, except that for COMPARE AND BRANCH RELATIVE, COMPARE IMMEDIATE AND BRANCH RELATI VE, CO PA L LOGICA L AND BRANCH RELATIVE] and COMPAR E
  • the first addend is the contents of the 14 field, with bits appended as described above for the 12 fie id.
  • the first addend is the contents of the 12 field with one zero bit appended on the right and 31 bits equal to the sign bit of the contents appended o the left.
  • the second addend is the 64-bit address of the branch instruction.
  • the address of the branch instruction is the instruction address in the PSW before that address is updated to address the next sequential instruction, or it is the address of the target of the EXECUTE instruction if EXECUTE is used.
  • the address of the branch instruction is the target address with 40 or 33 zeros, respectively, appended on the left.
  • the branch address is always 64 bits long, with the bits numbered 0-63.
  • the branch address replaces bits 64- ⁇ 27 of the current PSW.
  • the manner in which the branch address is obtained from the intermediate value depends on the addressing mode. For those branch instructions which change the addressing mode, the new addressing mode is used. In the 24- bit addressing mode, bits 0-39 of the Intermediate value are ignored, bits 0-39 of the branch address are made zeros, and bits 40-63 of the intermediate value become bits 40-63 of the branch address.
  • bits 0-32 of the intermediate value are ignored, bits 0-32 of the branch address are made zeros, and bits 33-63 of the intermediate value become bits 33-63 of the branch address.
  • bits 0-63 of the intermediate value become bits 0-63 of the branc h address.
  • branching depends on satisfying a specified condition. When the condition is not satisfied, the branch is not taken, normal sequential instruction execution continues, and the branch address is not used .
  • bits 0-63 of the branch address replace bits 64-127 of the current PSW.
  • the branch address is not used to access storage as part of the branch operation.
  • a specification exception due to an odd branch address and access exceptions due to fetching of the instruction at the branch location are not recognized as part of the branch operation but instead are recognized as exceptions associated with the execution of the instruction at the branch location.
  • a branch instruction such as BRANCH AND SAVE, can designate the same general register for branch address computation and as the location of an operand. Branch-address computation is completed before the remainder of the operation is performed .
  • the program-status word (PSW), described in. Chapter 4 "Control” contains information required for proper program execution.
  • the PSW is used to control instruction sequencing and to hold and indicate the status of the CPU in relation to the program currently being executed. ' Hie active or controlling PSW is called the current PSW.
  • Branch instructions perform the functions of decision making, loop control, and subroutine linkage.
  • a branch instruction affects instruction sequencing by introducing a new instruction address into the current PSW.
  • the relative-branch instructions with a 16-bit 12 field allow branching to a location at an offset of up to plus 64 - 2 bytes or minus 64 bytes relative to the location of the branch instruction, without the use of a base register.
  • the relative-branch instructions with a 32-bit 12 field allow branching to a location at an offset of up to plus 4G - 2 bytes or minus 4G bytes relative to the location of the branch instruction, without the use of a base register.
  • BRANCH ON CONDITION BRANCH RELATIVE ON CONDITION
  • BRANCH RELATIVE ON CONDITION LONG instructions inspect a condition code that reflects the result of a majority of the arithmetic, logical, and I/O operations.
  • the condition code which consists of two bits, provides for four possible condition-code settings: 0, 1, 2, and 3.
  • condition code reflects such, conditions as zero, nonzero, first operand high, equal, overflow, and subchannel busy. Once set, the condition code remains unchanged until modified by an instruction that causes a different condition code to be set. Loop control can be performed by the use of BRANCH ON CONDITION, BRANCH RELATIVE ON CONDITION, and BRANCH RELATIVE ON CONDITION LONG to test the outcome of address arithmetic and counting operations.
  • BRANCH ON COUNT BRANCH ON INDEX HIGH
  • a d BRANCH ON INDEX LOW OR EQUAL are provided, and relative-branch equivalents of these instructions are also provided. These branches, being specialized, provide increased performance for these tasks.
  • BRANCH AND SAVE applies also to BRANCH RELATIVE AND SAVE and BRANCH RELATIVE AND SAVE LONG.
  • Both of these Instructions permit not only the Introduction of a new instruction address but also the preservation of a return address and associated information.
  • the return address is the address of the instruction following the branch instruction in storage, except that it is the address of the instruction following an EXECUTE instruction that has the branch instruction as its target.
  • both instructions place the return address in bit positions 40- 63 of general register Rl and leave bits 0-31 of that register unchanged.
  • BRANCH AND LINK places the instruction-length code for the instruction and also the condition code and program mask from the current PSW in bit positions 32-39 of general register Rl
  • BRANCH AND SAVE places zeros in those bit positions.
  • both instructions place the return address in bit positions 33- 63 and a one in bit position 32 of general register R 1 , and they leave bits 0-31 of the register unchanged.
  • both instructions place the return address in bit positions 0- 63 of general register Rl .
  • both instructions generate the branch address under the control of the current addressing mode.
  • the Instructions place bits 0-63 of the branch address in bit positions 64-127 of the PSW.
  • both instructions do not perform branching if the 1 2 field of the instruction is zero.
  • BRANCH AND SAVE places the basic addressing- mode bit, bit 32 of the PSW, in bit position 32 of ge eral register Rl.
  • BRANCH AND LINK does so in the 1 -bit addressing mode.
  • the instructions BRANC H AND SAVE AND SET MODE and BRANCH AND SET MODE are for use when a change of the addressing mode is required during linkage. These instructions have R l and R2 fields. The operations of the instructions are summarized as follows:
  • BRANCH AND SAVE AND SET MODE sets the contents of general register Rl the same as BRANCH AND SAVE.
  • the instruction places the extended-addressing-mode bit, bit 31 of the PSW, in bit position 63 of the register.
  • BRANCH AND SET MODE if Rl is nonzero, performs as follows. In the 24- or 31 -bit mode, it places bit 32 of the PSW in bit position 32 of general register Rl, and it leaves bits 0-31 and 33-63 of the register unchanged. Note that bit 63 of the register should be zero if the register contains an instruction address. In the 64-bit mode, the instruction places bit 31 of the PSW (a one) in bit position 63 of general register RL and it leaves bits 0-62 of the register unchanged.
  • both instructions set the addressing mode and perform branching as follows. Bit 63 of general register R2 is placed in bit position 31 of the PSW. If bit 63 is zero, bit 32 of the register is placed in bit position 32 of the PSW. If bit 63 is one, PSW bit 32 is set to one. Then the branch address is generated from the contents of the register, except with bit 63 of the register treated as a zero, under the control of the new addressing mode. The instructions place bits 0-63 of the branch address in bit positions 64-127 of the PSW. Bit 63 of general register R2 remains unchanged and, therefore, may be one upon entry to the called program. If R2 is the same as Rl, the results in the designated general register are as specified for the R 1 register.
  • the interruption mechanism permits the CPU to change its state as a result of conditions externa! to the configuration, within the configuration, or within the CPU itself.
  • mterniption conditions are grouped into six classes: external input/output, machine check, program, restart, and supervisor call.
  • An interruption consists in storing the current PSW as an old PSW, storing information identifying the cause of the interruption, and fetching a new PSW. Processing resumes as specified by the new PSW.
  • the old PSW stored on an interruption normally contains the address of the instruction that would have been executed next had the interruption not occurred, thus permitting resumption of the interrupted program.
  • the information stored also contains a code that identifies the length of the last-executed instruction, thus permitting the progra to respond to the cause of the interruption, in the case of some program conditions for which the normal response is re- execution of the instruction causing the interruption, the instruction address directly identifies the instruction last executed.
  • an interruption can occur only when the CPU is in the operating state. The restart interruption can occur with the CPU in either the stopped or operating state.
  • Any access exception is recognized as part of the execution of the instruction with which the exception is associated.
  • An access exception is not recognized when the CPU attempts to prefetch from an unavailable location or detects some other access-exception condition, but a branch instruction or an interruption changes the instruction sequence such that the instruction is not executed. Every instruction can cause an access exception to be recognized because of instruction fetch. Additionally, access exceptions associated with instruction execu tion may occur because of an access to an operand in storage. An access exception due to fetching an instruction is indicated when the first instruction halfword cannot be fetched without encountering the exception.
  • access exceptions may be indicated for additional halfwords according to the instruction length specified by the first two bits of the instruction ; however, when the operation can be performed without accessing the second or third halfwords of the instruction, it is unpredictable whether the access exception is indicated for the unused part.
  • access exceptions are recognized for the entire operand even if the operation could be completed without the use of the inaccessible part of the operand.
  • the value of a store-type operand is de fin ed to be unpredictable, it is unpredictable whether an access exception is indicated.
  • the word "access" is included in the list of program exceptions in the description of the instruction. This entry also indicates which operand can cause the exception to be recognized and whether the exception is recognized on a fetch or store access to that operand location. Access exceptions are recognized only for the portion of the operand as defined for each particular instruction.
  • An operation exception is recognized when the CPU attempts to execute an instruction with an invalid operation code.
  • the operation code may be unassigned, or the instruction with that operation code may not be installed on the CPU.
  • the operation is suppressed.
  • the instruction-length code is 1, 2, or 3.
  • the operation exception is indicated by a program interruption code of 0001 hex (or 0081 hex if a concurrent PER event is indicated).
  • Some models may offer instructions not described in this publication, such as those provided for assists or as part of special or custom features. Consequently, operation codes not described in t is publication do not necessarily cause an operation exception to be recognized. Furthermore, these instructions may cause modes of operation to be set up or may otherwise alter the ma chine so as to affect the execution of subsequent instructions. To avoid causing such an operation, an instruction with an operation code not described in this publication should be executed only when the specific function associated with the operation code is desired. A specification exception is recognized when any of the following is true:
  • a one is introduced into an unassigned bit position of the PSW (that is, any of bit positions 0, 2-4, 24-30, or 33-63). This is handled as an early PSW specification exception.
  • the PSW is invalid in any of the following ways: a. Bit 3.1 of the PSW is one and bit 32 is zero, b. Bits 31 and 32 of the PSW are zero, indicating the 24-bit addressing mode, and bits 64-103 of the PSW are not all zeros, e. Bit 31 of the PSW is zero and bit 32 is one, indicating the 31 -bit addressing mode, and bits 64-96 of the PSW are not all zeros. This is handled as an early PSW specification exception.
  • the PSW contains an odd instruction address.
  • An operand address does not designate an integral boundary in an instruction requiring such integral-boundary designation.
  • An odd-numbered general register is designated by an R field of an instruction that requires an even-numbered register designation.
  • a floating-point register other than 0, 1 , 4, 5, 8, 9, 12, or 13 is designated for an extended operand.
  • the multiplier or divisor in decimal arithmetic exceeds 15 digits and sign.
  • the length of the first-operand field is less than or equal to the length of the second- operand field in decimal multiplication or division.
  • AUTHENTICATION CODE is attempted, and the second operand length is not a multiple of the data block size of the designated function. This specification-exception condition does not apply to the query functions. 13. Execution of COMPARE AND FORM CODEWORD is attempted, and genera! registers 1 , 2, and 3 do not initially contain even values.
  • the function code is 1 , and the first operand is not designated on a. doubieword boundary.
  • the second operand is not designated on an integral boundary corresponding to the size of the store value.
  • the R2. field designates an odd-numbered register or general register 0.
  • bit 32 of general register 0 is zero, and one or more fields in bits 33- 63 are invalid or designate an uninstalled function.
  • Bits 32-54 of general register 0 are not al l zeros.
  • Bits 57-63 of general register 0 specify an unassigned or uninstalled function code. 53. Execution of PRDGRAM TRANSFER or PRDGRAM TRANSFER WITH INSTANCE is attempted, and all of the following are true:
  • Bits 31 and 32 are both zero and bits 64-103 are not all zeros.
  • Bits 3 1 and 32 are zero and one, respectively, and bits 64-96 are not all zeros.
  • - Bits 31 and 32 are one and zero, respectively.
  • Bits 36-55 of ge eral register 0 and bits 32- 47 of general register 1 are ot all zeros.
  • the ILC When the exception is recognized because of an early PSW specification exception (causes 1-3) and the exception lias been introduced by LOAD PSW, LOAD PSW EXTENDED, PROGRAM RETURN, or an interruption, the ILC is 0.
  • the exception is introduced by SET ADDRESSING MODE (SAM24, SAM31 )
  • the ILC is 1 , or it is 2 if SET ADDRESSING MODE was the target of EXECUTE.
  • the ILC When the exception is introduced by SET SYSTEM MASK or by STORE THEN OR SYSTEM MASK, the ILC is 2.
  • Program interruptions are used to report exceptions and events which occur during execution of the program.
  • a program interruption causes the old PSW to be stored at real locations 336-351 and a new PSW to be fetched from real locations 464-479.
  • the cause of the interruption is identified by the interruption code.
  • the interruption code is placed at real locations 142-143, the instruction-length code is placed in bit positions 5 and 6 of the byte at real location 141 with the rest of the bi ts se to zeros, and zeros are stored at rea l location 140. For some causes, additional information identifying the reason for the interruption is stored at real locations 144-183.
  • the con tents of the breaking-even t-address register are placed in real storage locations 272-279. Except for PER events and the erypto-operatioii exception. the condition causing the interruption is indicated by a coded value placed in the rightmost seven bit positions of the Interruption code. Only one condition at a time can be indicated. Bits 0-7 of the interruption code are set to zeros. PER events are indicated by setting bit 8 of the interruption code to one. When this is the only condition, bits 0-7 and 9-15 are also set to zeros.
  • bit 8 When a PER event is indicated concurrently with another program interruption condition, bit 8 is one, and bits 0-7 and 9-15 are set as for the other condition.
  • the crypto- operation exception is indicated by an interruption code of 0119 hex, or 0199 hex if a PER event is also indicated.
  • a progra interruptio can occur only when that mask bit is one.
  • the program mask in the PS W controls tour of the exceptions
  • the ⁇ masks in the FPC register control the IEEE exceptions
  • bit 33 in control register 0 controls whether SET SYSTEM MASK causes a special- operation exception
  • bits 48-63 in control register 8 control interruptions due to monitor events
  • a hierarchy of masks control interruptions due to PER. events.
  • Some of the conditions indicated as program exceptions may be recognized also by the channel subsystem, in which case the exception is indicated in the subchannel-status word or extended-status word.
  • a data-exception code (DXC) is stored at location 147, and zeros are stored at locations 144-146.
  • the DXC distinguishes between the various types of data-exception conditions.
  • the AFP -register (additional floatingpoint register) control bit, bit 45 of control register 0, is one, the DXC is also placed in the DXC field of the floating-point-control (FPC) register.
  • the DXC field in the FPC register remains unchanged when any other program exception is reported.
  • the DXC is an 8-bit code indicating the specific cause of a data exception.
  • DXC 2 and 3 are mutually exclusive and are of higher priority than any other DXC. Thus, for example.
  • DXC 2 (BFP instruction) takes precedence over any ⁇ exception; and DXC 3 (DFP instruction) takes precedence over any IEEE exception or simulated IEEE exception.
  • DXC 3 (DFP mstruction) and DXC 1 (AFP register) exist, DXC 3 is reported.
  • DXC 3 is reported.
  • An addressing exception is recognized when the CPU attempts to reference a main-storage location that is not available in the configuration.
  • a main-storage location is not available in the configuration when the location is not installed, when the storage unit is not in the configuration, or when power is off in the storage unit.
  • An address designating a storage location that is not available in the configuration is referred to as invalid.
  • the operation is suppressed when the address of the mstruction is invalid.
  • the operation is suppressed when the address of the target instruction of EXECUTE is invalid .
  • the unit of operation is suppressed when an addressing exception is enco untered in accessing a table or table entry.
  • the tables and table entries to which the rule applies are the dispatchable-unit- eoutrol table, the primary ASN second- table entry, and entries in the access list, region first table, region second table, region third table, segment table, page table, linkage table, linkage- first table, linkage-second table, entry table, ASN first table, ASN second table, authority table, linkage stack, and trace table. Addressing exceptions result in suppression when they are encountered for references to the region first table, region second table, region third table, segment table, and page table, in both implicit references for dynamic address translation and references associated with the execution of LOAD PAGE-TABLE-ENTRY ADDRESS, LOAD REAL ADDRESS, STORE REAL ADDRESS, and TEST
  • addressing exceptions for accesses to the dispatcha ble-unit control table, primary ASN-second- table entry, access list, ASN second table, or authority table result in suppression when they are encountered in access-register translation done either implicitly or as part of LOAD PAGE-TABLE-ENTRY ADDRESS, LOAD REAL ADD ESS, STOR E REAL ADDRESS, TEST ACCESS, or TEST PROTECTION. Except for some specific Instructions whose execution is suppressed, the operation is terminated for an operand address that can be translated but designates an unavailable location. For termination, changes may occur only to result fields.
  • the term "'result field" includes the condition code, registers, and any storage locations thai are provided and that are designated to be changed by the instruction.
  • Embodime ts not limited to the z/ Architecture or to the description provided thereof. Embodiments can be advantageously applied to other computer
  • GRs general registers
  • IBM z/ Architecture and its predecessor architectures (dating back to the original System 360 circa 1964) provide 16 general registers (GRs) for each central processing unit (CPU).
  • GRs may be used by processors (central processing unit (CPU)) instructions as follows:
  • usher architectures such as the x86 from Intel® for example, provide
  • Program design (as simple as modular programming) helped to minimize base-register overutifization.
  • Compilers have used techniques such as register "coloring" to manage the dynamic reassignment of registers.
  • Base register usage can be reduced with the following:
  • Newer arithmetic and logical instructions with immediate constants (within the instruction).
  • Newer instructions with relative-immediate operand addresses
  • bit positions of registers are numbered in ascending order from left to right (Big Endian).
  • bit 0 the leftmost bit
  • bit 63 the rightmost bit
  • the leftmost 32 bits of such a register are called the high word
  • the rightmost 32 bits of the register are called the low word where a word is 32 bits.
  • a new suite of general instructions (that is. instructions available to an application program) is introduced to exploit the high word (the most-significant 32 bits) of a 64-bit general register when the CPU is in 32 bit mode.
  • the program can employ the new instructions to access the hidden (previously unavailable) high words of the GPR in addition to the old instructions which continue to be restricted to the low words.
  • a program written to an architecture having 16 or 32 bit registers may be run on a newer version of the architecture supporting 64 bit registers.
  • the program written for, say, a 32 bit mode is only aware of 32 bit registers, and typically 32 or fewer logical address bits.
  • An Operating System (OS) 801 in a 64 bit architected computer system may support programs written for 64 bit mode 803 as well as programs written for 32 bit mode 802.
  • a context switch operation 804 in such a machine will save 805 the 64 bit registers as well as the Program Status Word (PSW) when switching between programs and/or the operating system, independent of whether the Application program 802 803 was in 32 or 64 bit mode.
  • PSW Program Status Word
  • a 32 bit program running in 32 bit mode on a 64 bit machine under control of a 64 bit operating system will have its registers saved and restored during certain context switches.
  • the computer system and operating system may actually save and restore 805 ail 64 bits of the general registers during the context switch, even though the program subject to the context switch is running in a 32 bit mode.
  • the program sees only half of the registers, only 32 bits of the 64 bits of each register.
  • the other 32 bits of the impleme ted registers is "hidden" from the 32 bit program.
  • the 32 bits of the known registers may be used for addressing, and even though the computer system supports 64 bits of addressing, the OS can manage via Dynamic Address Translation, such that only 32 bits of address are manipulated by the 32 bit program in 32 bit mode.
  • the 32 bit mode may be thought of as a
  • Sow-word mode since the program is only utilizing the low r word (32 bit word) of a. double word (64 bit) register.
  • An Application Program operates under control of the OS, and invokes the OS in order to have the OS perform certain functions. This "invoking" is performed by the context switch 804 that saves state of the application program and loads state 805 of the OS to be performed, where the OS begins execution at the address provided by the context switch. The OS can then invoke one of the application programs by a context switch 804 to permit the application program to run.
  • a time-slice of operation and a context switch 804 is used to "interrupt" the active program after an elapsed time in order to permit the OS to dispatch another application program for another time-slice.
  • the availability of the High- Word facility may be controlled by a bit or a field in the machine that must be set to enable the High-Word facility.
  • the 32 bit program can take advantage of the "hidden” part of the register by executing new "high-word facility” instructions.
  • Other new "hi h.- word facility” instructions may be provided that provide new function to instructions using low-word registers.
  • RISBLG provides a low-word analog to the high-word RISBHG instruction.
  • RISBHG and RISBLG provide great flexibility in implementing a number of pseudo-instructions (with assistance from the assembler program).
  • processor architectures employ General Purpose Registers (GPRs), available to the Instruction Set of the archi ecture.
  • GPRs General Purpose Registers
  • a program can take advantage of data being in the GPRs, which may be implemented in high speed memory such as embedded latches on a chip, for faster performance than having the data in slower main store, which is often implemented by complex dynamic address translation mechanisms.
  • some architectures such as x86 having 64 GPRs, the size of each GPR has been increased evolutionary from 8 bits to 16 bits, 32 bits and currently 64 bits.
  • GPR GPR.
  • a machine may ha ve 16 GPRs, each GPR consisting of 64 bits (bits 0-63) but may ran an application program written for 32 bit registers in 32 bit mode.
  • the 32 bits may be the low order 32 bits of the GPR. (bits 32-63), where the high order 32 bits ( bits 0-31 ) are not available (hidden) in a 32 bit mode of operation.
  • the application program has no way of utilizing the high order 32 bits of the
  • the application program in an example, may have been written for a 32 bit machine of a prior generation of the machine having only 32 bit registers and addressing 24 or 32 bits of logical addresses to memory.
  • the 32 bit mode enables the example 32 bit application program to run on a newer machine having an architecture supporting 64 bits of GPR s, having a. 64 bit Opera ting System (OS) and supporting 64 bit applicaiion programs in 64 bit mode.
  • OS Opera ting System
  • a set of 32 bit "hidden GPRs ' " may be provided that are invisible to application programs.
  • a "High-Word Facility mode" is provided that enables a subset of instructions to access the hidden or High Order GPRs, while the remaining set of instructions have access to the architected or Low Order GPR.s.
  • the subset of instructions may only access the High Order GPRs in one implementation, but in another implementation, the subset of instructions may define GPR field as being directed to the High Order GPRs and another GPR field as being directed to the low order GPRs.
  • applications executing in "High- Word Facility mode” can co-exist with applications not executing in "High- Word Facility mode".
  • the applications not in High- Word Facility mode may be 32 bit GPR. applications or 64 bit GPR applications.
  • GPRs of a machine are utilized having 64 bits with applications written for
  • High- Word Facility mode hidden registers may utilize only a designated portion of the hidden GPRs, such that, in the 32 bit application program of the previous example, the hidden registers available in High- Word Facility mode for some instructions may be the low order 8 or 1 6 bits of the high order 32 bits of the 64 bit GPRs, while other hidden registers may be the high order 8 or 1 6 bits of the high order 32 bits of the 65 bit GPRs for example.
  • the high-word facility effectively provides sixteen additional 32-bit registers (high word registers) by utilizing previously unavailable high order bits 0-31 of the sixteen 64-bit general registers ( bits 0-63).
  • the High-Word facility may enable the folio wing instructions with mnemonics indicating the function (AHHHR for ADD HIGH for example):
  • the second operand When the instruction is executed by the computer system, the second operand is added to the third operand, and the sum is placed at the first-operand location.
  • the operands and the sum are treated as 32-bit signed binary integers.
  • the first and second operands are in bits 0-31 of general registers R.I and R2, respectively; bits 32-63 of general register Rl are unchanged, and bits 32-63 of general register 1 2 are ignored.
  • the third operand is in bits 0-3 lof general register R3; bits 32-63 of the register are ignored.
  • AHHLR OpCode the third operand is in bits 32-63 of general register R3; bits 0- 1 of the register are ignored.
  • condition code 3 is set. If the fixed-point-overflow mask is one, a program interruption for fixed-point overflow occurs.
  • the second operand is added to the first operand, and the sum is placed at the first -operand location.
  • the operands and the sum are treated as 32-bitsigned binary integers.
  • the first operand is in bttsO-31 of general register Rl; bits 32-63 of the register are unchanged.
  • the result is obtained by allowing any carry into the sigxt ⁇ b.it position, and ignoring any carry out of the sign- bit position, and condition code 3 is set.
  • I f the fixed-point-overflow mask is one. a program interruption for fixed-point overflow occurs.
  • the second operand When the instruction is executed by the computer system, the second operand is added to the third operand, and the sum is placed at the first-operand location.
  • the operands and the sum are treated as 32-bifunsigned binary integers.
  • the first and second operands are in bits 0-31 of general registers R.i and R2, respectively; bits 32-63 of genera l register R i are unchanged, and bits 32-63 of general register R2 are ignored.
  • ALHHH OpCode the third operand is in bits0-31 of general register R3; bits 32-63 of the register are ignored.
  • ⁇ I if I LK OpCode the third operand is in bits32-63 of general register R3; bits 0-31 of the register are ignored.
  • the second operand When the instruction is executed by the computer system, the second operand is added to the first operand, and the sum is placed at the first-operand location.
  • the first operand and the sum are treated as 32-bitunsigned binary integers.
  • the second operand is treated as a 32- bit signed binary integer.
  • the first operand is in bits 0-31 of general register Rl ; bits32-63 of the register are unchanged.
  • BRANCH RELATIVE ON COUNT (BRCT OpCode)
  • the first operand and result are treated as 32-bit binary integers in bits 32-63 of general register Rl, with overflow ignored; bits 0-31 of the register are unchanged.
  • BRCTH OpCode BRCTH OpCode
  • the first operand and result are treated as 32-bitbinary integers in bits 0-31 of general register Rl, with overflow ignored; bits 32-63 of the register are unchanged.
  • BRANCH RELATIVE ON COUNT (BRCTG OpCode)
  • the first operand and result are treated as64-bit binary integers, with overflow ignored.
  • the first operand and result can be considered as either signed or unsigned binary integers since the result of a binary subtraction is the same in both cases.
  • COMPARE HIGH RRE, RXY format
  • COMPARE IMMEDIATE HIGH RIL format
  • the first operand is compared with the second operand, and the result is indicated in the condition code.
  • the operands are treated as 32-bit signed binary in tegers.
  • the first operand is in bit positions 0-31 of general register R 1 ; bit positions 32-63 of the register are ignored.
  • COMPARE HIGH CHHR OpCode
  • the second operand is in bit positions 0-31 of general register 2; bit positions 32- 63 of the register are ignored.
  • COMPARE HIGH CHLR OpCode
  • the second operand is in bit positions 32-63 of general register R2; bit positionsQ-31 of the register are ignored.
  • COMPARE LOGICAL HIGH (RRE, RXY format)
  • COMPARE LOGICAL IMMEDIATE HIGH (RIL format)
  • the first operand is compared with the second operand, and the result is indicated in the condition code.
  • the operands are treated as 32-bit unsigned binary integers.
  • the first operand is in bit positions 0-3.1 of general register III; bit positions 32-63 of the register are ignored.
  • the second operand When the instruction is executed by the computer system, the second operand is sign extended and placed at the first-operand location.
  • the second operand is one byte in length and is treated as an eight-bit signed binary integer.
  • the first operand is treated as a 32-bit signed binary integer in bits 0-31 of general register Rl; bits 32-63of the register are unchanged.
  • the displacement is treated as a 20-bit signed binary integer.
  • the second operand When the instruction is executed by the computer system, the second operand is sign extended and placed at the first-operand location.
  • the second operand is two bytes in length and is treated as an 16-bit signed binary integer.
  • the first operand is treated as a 32-bit signed binary integer in bits 0-3 1 of general register R 1; bits 32-63of the register are unchanged.
  • the displacement is treated as a 20-bit signed binary integer.
  • the second operand When the instruction is executed by the computer system, the second operand is placed unchanged at the first operand location.
  • the second operand is 32 bits, and the first operand is in bits 0-31 of general register Rl;bits 32-63 of the register are unchanged .
  • the displacement is treated as a 20-bit signed binary integer.
  • Condition Code The code remains unchanged.
  • the one-byte second operand is placed in bit positions24-31 of general register Rl, and zeros are placed in bit positions 0-23 of general register Rl; bit positions 32-63 of general register Rl are unchanged.
  • the displacement is treated as a 20-bit signed binary integer.
  • the two-byte second operand is placed in bit positions 16-31 of general register Rl, and zeros are placed in bit positions 0-15 of general register Rl; bit positions 32-63 of general register Rl are unchanged.
  • the displacement is treated as a 20-bit signed binary integer.
  • ROTATE THEN INSERT SELECTED BITS HIGH HIE format
  • ROTATE THEN INSERT SELECTED BITS LOW RIE format
  • the 64-bit second operand is rotated left by the number of bits specified in the fifth operand. Each bit shifted out of the leftmost bit position of the operand reenters in the rightmost bit position of the operand. The selected bits of the rotated second operand replace the contents of the corresponding bit positions of the first operand.
  • the first operand is in bits 0-31 of general register Rl,and bits 32-63 of the register are unchanged.
  • bits 3-7 of the 13 and 14 fields (bits 19-23 and 27-31 of the instruction, respectively), with a binary zero appended on the left of each, form six-bit unsigned binary integers specifying the starting and ending bit positions (inclusive) of the selected range of bits in the first operand and in the second operand after rotation.
  • the ending bit position is less than the starting bit position, the range of selected bits wraps around from bit 31 to bit 0.
  • the starting and ending bit positions of the selected range of bits are always between 0 and 31.
  • bits 3-7 of the 13 and 14 fields form six-bit unsigned binary integers specifying the starting and ending bit positions (inclusive) of the selected range of bits in the first operand and in the second operand after rotation.
  • the ending bit position is less than the starting bit position, the range of selected bits wraps around from bit 63 to bit 32.
  • the starting and ending bit positions of the selected range of bits are always between 32 and 63.Bits 2-7 of the 15 field (bits 34-39 of the instruction) contain an unsigned binary integer specifying the number of bits that the second operand is rotated to the left.
  • Bit 0 of the 14 field contains the zero-remaining- bits control (Z).
  • the Z bit control show the remaining bits of the first operand are set(that is, those bits, if any, that are outside of the specified range). When the Z bit is zero, the remaining bits of the first operand are unchanged. When the Z bit is one, the remaining bits of the first operand are set to zeros.
  • the immediate fields just described are as follows: Bits 0-2 of the 13 field and bits 1-2 of the 14 field (bits 16- 19 and 25-26 of the instruction) are reserved and should contain zeros; otherwise, the program may not operate compatibly in the future. Bits 0-1 of the 15 field (bits 32-33 of the instruction) are ignored.
  • Condition Code The code remains unchanged
  • bits 2-7 of the 15 field are defined to contain an u signed binary integer specifying the number of bits that the second operand is rotated to the left, a negative value may be coded which effectively specifies a rotate-right amount.
  • the first operand is always used in its un-rotated form.
  • the value contained in the register is first rotated, and then the selected bits of the rotated value are inserted into the corresponding bits of the un-rotated register contents.
  • the 15 operand containing the rotate amount is considered to be optional.
  • a rotate amount of zero is implied.
  • the 14 field contains both the zero-remaining- bits control (in bit 0) and the ending hit position value(m bits 2-7). For example, to insert bits 40-43 of register 7 into the
  • the programmer might code:
  • the ⁇ '80' represents the zero-rernainmg-bits control which is added to the ending-bit position to form the 14 field.
  • the high-level assembler (HLASM) provides alternative mnemonics for the zero -remaining bits versions of RJSBHG and RJSBLG in the form of RJSBHGZ and R ISBLHZ, respectively.
  • the "Z" suffix to the mnemonic indicates that the specifiedM field is ORed with a value of X'80' when generating the object code.
  • An equivalent to the example shown above using the Z-suffixed mnemonic is as follows:
  • R!SBHG and RJSBLG may be realized by setting the zero-remaining-bits control to one (or using the Z mnemonic suffix).
  • Bits 24-31 of general register Rl are placed unchanged at the second-operand location.
  • the second operand is one byte in length.
  • the displacement is treated as a 20-bit signed binary integer.
  • bits 16-31 of general register Rl are placed unchanged at the second-operand location.
  • the second operand is two bytes in length.
  • the displacement is treated as a 20-bit signed binary integer.
  • the first operand When the instruction is executed by the computer system, the first operand is placed unchanged at the second operand location.
  • the first operand is in bits 0-31 of general register Rl, and the second operand is 32bits in storage.
  • the displacement is treated as a 20- bit signed binary integer.
  • the third operand is subtracted from the second operand, and the difference is placed at the first operand location.
  • the operands and the difference are treated as 32-bit signed binary integers.
  • the first and second operands are in bits 0-31 of general registers Rl and R2, respectively; bits 32-63of general register Rl are unchanged, and bits 32-63of general register R2 are ignored.
  • SHHHR OpCode the third operand is in bits 0-31 of general register R3;bits 32-63 of the register are ignored.
  • SHHLR OpCode the third operand is in bits 32-63 of general registerR3; bits 0-31 of the register are ignored.
  • condition code 3 is set. If the fixed-point-overflow mask is one, a program interruption for fixed-point overflow occurs.
  • the third operand is subtracted from the second operand, and the difference is placed at the first operand location.
  • the operands and the difference are treated as 32-bit unsigned binary integers.
  • the first and second operands are in bits 0-31 of general registers Rl and R2, respectively; bits 32-63of general register Rl are unchanged, and bits 32-63of general register R2 are ignored.
  • the third operand is in bits 0-31 of general register R3;bits 32-63 of the register are ignored.
  • SLHHLR OpCode the third operand is in bits 32-63 of general registerR3; bits 0-31 of the register are ignored.
  • GPR General Purpose Register
  • the effective number of General Purpose Registers (GPRs) available to instructions of a program may be extended in a computer ha ving a first number (16 ) of large GPRs, each instruction comprising an opcode and one or more GPR fields for specifying corresponding GPRs, each large GPR consisting of a first portion (31 -63 ) and a second portion (0- 1 ).
  • a computer in fetches instructions for execution comprising instructions from either First Set 701, a Second Set 702 or a Third Set 710.
  • the First Set only accessing a first portion of any GPR
  • the Second Set accessing a second portion of any GPR
  • the Third Set accessing the whole GPR, including the first portion and the second portion.
  • the computer is in a small GPR mode, for example, and is executing instructions of the first set of instructions 707 for accessing first portions, the execution comprising 708 generating memory addresses for accessing memory operands based on said small GPRs or accessing small GPR operands, wherein each of said small GPRs consists of said first portion 707.
  • 703 the computer is in a small GPR.
  • the computer may generate 70 ) an operation exception responsive to executing instructions of the second set of instructions.
  • the execution of the instruction of the second instruction set may- perform 751 a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consisting of an ADD of two operands function, a COMPARE of two operands function or an OR of two operands function 752.
  • the execution of the instruction of the second instruction set may perform a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consists of a LOAD and operand from memory function or a STORE an operand to memory function 753.
  • the execution of the instruction of the second instruction set may perform a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function is a ROTATE THEN INSERT SELECTED BITS function comprising rotating a source operand by an instruction specified amount, then inserting a selected portion of the rotated source operand in a selected portion of a target operand 704.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Executing Machine-Instructions (AREA)

Abstract

A computer employs a set of General Purpose Registers (GPRs). Each GPR comprises a plurality of portions. Programs such as an Operating System and Applications operating in a Large GPR mode, access the full GPR, however programs such as Applications operating in Small GPR mode, only have access to a portion at a time. Instruction Opcodes, in Small GPR mode, may determine which portion is accessed.

Description

FIELD OF THE INVENTION
The present invention is related to computer systems and more particularly to computer system processor instruction functionality.
BACKGROUND
Trademarks: IBM© is a registered trademark of International Business Machines
Corporation, Armonk, New York, U.S.A. S/390, Z900, z990 and zlO and other product names may he regi stered trademarks or product names of International Business M ach ines Corporation or other companies.
IBM has created through the work of many highly talented engineers beginning with machines known as the IBM® System 360 in the 1960s to the present, a special architecture which, because of its essential nature to a computing system, became known as "'the mainf ame" whose principles of operatio state the architecture of the machine by describing the instructions which may be executed upon the "mainframe" implementation of the instructions which had been invented by IBM inventors and a dopted , because of their signi ficant contribution to impro ving the state of the computing machine represented by "the mainframe'', as significant contributions by inclusion in IBM's Principles of Operation as stated over the years. The Eighth Edition of the IBM® z/ Architecture© Principles of Operation which was published February, 2009 has become the standard published reference as SA22-7832-07 and is incorporated in IBM 's zIQ® mainframe servers including the IBM System z 10® Enterprise Class servers.
Referring to FIG. 1A, representative components of a Host Computer system 50 are portrayed. Other arrangements of components may also be employed in a computer system, which are well known in the art. The representati e ost Computer 50 comprises one or more CPUs 1 in communication with main store (Computer Memory 2) as well as I/O interfaces to storage devices 11 and networks 10 for communicating with other computers or SANs and the like. The CPU 1 is compliant with an architecture having an architected instruction set and architected flmctionaiity. The CPU 1 may have Dynamic Address Translation (DAT) 3 for transforming program addresses (virtual addresses) into real address of memory. A DAT typically includes a Translation Lookaside Buffer (TLB) 7 for caching translations so that later accesses to the block of computer memory 2 do not require the delay of address translation. Typically a cache 9 is employed between Computer Memory 2 and the Processor 1 , The cache 9 may be hierarchical having a large cache available to more than one CPU and smaller, faster (lower level) caches between the large cache and each CPU. In some implementations the lower level caches are split to provide separate low level caches for instruction fetching and data accesses. In an embodiment, an instruction is fetched from memory 2 by an instruction fetch unit 4 via a cache 9. The instruction is decoded in an instruction decode unit (6) and dispatched (with other instructions in some embodiments) to instruction execution units 8. Typically several execution units 8 are employed, for example an arithmetic execution unit, a floating point execution unit and a branch instruction execution unit. The instruction is executed by the execution unit, accessing operands from instruction specified registers or memory as needed. If an operand is to be accessed (loaded or stored) from memory 2, a load store unit 5 typically handles the access under control of the instruction being executed. Instructions may be executed in hardware circuits or in internal microcode (firmware) or by a combination of both.
In FIG. 113, an example of an emulated Host Computer system 21 is provided that emulates a Host computer system 50 of a Host architecture. In the emulated Host Computer system 21, the Host processor (CPU) 1 is an emu lated Host processor (or virtual Host processor) and comprises an emulation processor 27 having a different native instruction set architecture than tha t of the processor I of the Host Computer 50. The emula ted Host Compu ter system 21 has memory 22 accessible to the emulation processor 27. In the example embodiment, the Memory 27 is partitioned into a. Host Computer Memory 2 portion and an Emulation Routines 23 portion. The Host Computer Memory 2 is available to programs of the emulated Host Computer 21 according to Host Computer Architecture. The emulation Processor 27 executes native instructions of an architected instruction set of an architecture other than that of the emulated processor 1, the native instructions obtained from Emulation Routines memory 23, and may access a Host instruction for execution from a program in Host Computer Memory 2 by employing one or more instructions) obtained in a Sequence & Access/Decode routine which may decode the Host instruction^) accessed to determine a native instruction execution routine for emulating the function of the Host instruction accessed. Other facilities that are defined for the Host Computer System 50 architecture may be emulated by Architected Facilities Routines, including such facilities as General Purpose Registers, Control Registers, Dynamic Address Translation and I/O Subsystem support and processor cache for example. The Emulation Routines may also take advantage of function available in the emulation Processor 27 (such as general registers and dynamic translation of virtual addresses) to improve performance of the Emulatio Routines. Special Hardware and Off- Load Engines may also be provided to assist the processor 27 in emulating the function of the Host Computer 50.
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. pSeries© Servers and xSeries® Servers). They can be executed in machines running Liimx on a wide variety of machines using hardware manufactured by I BM®, Intel®, AMD™, Sun Microsystems and others. Besides execution on that hardware under a ^Architecture®, Linux can be used as well as machines which use emulation as described at http://www.turboherc les.com,
http://www.hercules-390.org and http://www.funsoft.com In emulation mode, emulation software is executed by a native processor to emulate the architecture of an emulated processor.
The native processor 27 typically executes emulation software 23 comprising either firmware or a native operating system to perform emulation of the emulated processor. The emulation software 23 is responsible for fetching and executing instructions of the emulated processor architecture. The emulation software 23 maintains an emulated program counter to keep track of instruction boundaries. The emulation software 23 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 27. These converted instructions may be cached such that a faster conversion can be accomplished. Not withstanding, the emulation software must 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 must provide resources identified by the emulated processor 1 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 am on the emulated processor, can be am on the native processor having the emulation software.
A specific instruction being emulated is decoded, and a subroutine called to perform the function of the indi vidual instruction. An emulation software function 23 emulating a function of an emulated processor 1 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 em.ulati.on patents including, but not limited to US 5551013 for a "Multiprocessor for hardware emulation" of Beausoleii et ai., and US6009261 :
Preprocessing of stored target routines for emulating incompatible instructions on a target processor" of Scalzi et al; and US5574873: Decoding guest instruction to directly access emulation routines that emulate the guest instructions, of Davidian et al; US6308255:
Symmetrical multiprocessing bus and chipset used for coprocessor support allowing non- native code to run in a system, of Gorishek et al; and US6463582: Dynamic optimizing object code translator for architecture emulation and dynamic optimizing object code translation method of Lethin et al; and US5790825: Method for emulating guest instructions on a host computer through dynamic recompilation of host instructions of Eric Traut. These references illustrate a variety ofknown ways to achieve emulation of an instruction format architected for a different machine for a target machine available to those skilled in the art, as well as those commercial software techniques used by those referenced above. In US Publication No. US 2009/0249039 Al, published October 1, 2009, Hook et al, "Providing Extended Precision in SIMD Vector Arithmetic Operations," the present invention provides extended precision in SIMD arithmetic operations in a processor having a register file and an accumulator. A first set of data elements and a second set of data elements are loaded into first and second vector registers, respectively. Each data element comprises N bits. Next, an arithmetic instruction is fetched from memory. The arithmetic instruction is decoded. Then, the first vector register and the second vector register are read from the register file. The present invention executes the arithmetic instruction on corresponding data elements in the first and second vector registers. The resulting element of the execution is then written into the accumulator. Then, the resulting element is transformed into an N-bit width element and written into a third register for further operation or storage in memory. The transformation of the resulting element can include, for example, rounding, clamping, and/or shifting the element.
What is needed is new instruction functionality consistent with existing architecture that relieves dependency on architecture resources such as general registers, improves functionality and performa nce of software versions employing the new instruction.
SUMMARY
In an embodiment of the High- word facility, an effective number of General Purpose Registers (GPRs) available to instructions of a program is extended in a computer having a first umber of large GPRs, each instruction comprising an opcode a d o e or more GPR fields for specifying corresponding GPRs, each large GPR comprising a first portion and a second portion, said large GPRs comprising first small GPRs consisting of first portions and second small GPRs consisting of second portions, wherein responsive to the computer being in a small GPR mode, performing a) and b) are performed, a) instructions of a first set of instructions are executed, the first set of instructions for accessing said first small GPRs, the execution comprising generating memory addresses for accessing memory operands based o said first small GPRs or accessing first small GPR operands, wherein the first small GPRs consist of said first portions; and b) instructions of a second set of instructions are executed, the second set of instructions for accessing said second small GPRs, the execution comprising generating memory addresses for accessing memory operands based on said second small GPRs or accessing second small GPR operands, wherein the second small GPRs consist of said second portions; and responsive to the compu ter being in a large GPR mode, instructions of a third set of instructions are executed, the execution comprising generating memory addresses for accessing memory operands based on said large GPRs or accessing large GPR operands comprising said first portions and said second portions.
In an embodimen t, the small GPR mode comprises being in one of a. 24 bit addressing .mode or a 31 bit addressing mode. in an embodiment, the first portion is 32 bits, the second portion is 32 bits and the third portion is 64 bits.
In an embodiment, executio of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consisting of an ADD of two operands function or a. COMPARE of two operands function.
In an embodiment, execution of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consists of a LOAD of an operand from memory -function or a STORE of an operand to memory function.
In an embodiment, execution of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function is a ROTATE THEN INSERT
SELECTED BITS function comprising: rotating a source operand by an instruction specified amount; and inserting a selected portion of the rotated source operand in a selected portion of a target o perand. In an embodiment, an. Operating System is supported operating in Large GPR mode wherein the Large GPRs are saved and restored during context switches for Applications running in Small GPR mode. In an embodiment, an Operating System operates in Large GPR mode wherein the Large
GPRs are saved and restored during context switches for Applications running in Small GPR mode.
The above as well as additional objectives, features, and advantages embodiments become apparent in the following written description.
BRIEF DESCRIPTION OF THE DRAWINGS
Embodiments of the disclosure will now be described, by way of example only, with reference to the accompanying drawings in which:
FIG. 1 A is a diagram depicting an example Host computer system;
FIG. I B is a diagram depicting an example emulation Host computer system;
FIG. 1.C Is a. diagram depicting an example computer system;
FIG. 2 is a diagram depicting an example computer network;
FIG. 3 is a diagram depicting an elements of a computer system;
FIGs. 4A-4C depict detailed elements of a computer system;
FIGs. 5A-5F depict machine instruction format of a computer system;
FIG. 6 depicts an example Large GPR;
FIGs. 7A-7B presents an example High- Word embodiment flow; and
FIG. 8 depicts a example context switch flow.
DETAILED DESCRIPTION
An embodiment may be practiced by software (sometimes referred to Licensed Internal ("ode, Firmware, Micro-code, Mil Si-code, Pico-code and the like, any of which would be consistent with the embodiments). Referring to FIG. 1 A, software program code is typically accessed by the processor also known as a CPU (Central Processing Unit) 1 of the system 50 from long-term storage media 11, such as a CD-ROM drive, tape drive or hard drive. The software program code may be embodied on any of a. variety of known media, .for use with a data processing system, such as a diskette, hard drive, or CD-ROM. The code may be distributed on such media, or may be distributed to users from the computer memory 2 or storage of one computer system, over a network 10 to other computer systems for use by users of such other systems.
Alternatively, the program code may be embodied in the memory 2, and accessed by the processor 1 using the processor bus. Such 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 dense storage media 11 to high-speed memory 2 where it is available for processing by the processor 1. 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,
FIG. I C illustrates a representative workstation or server hardware system. The system 100 of FIG. IC comprises representative computer system 101, such as a personal computer, a workstation or a server, including optional peripheral devices. The workstation 101 includes one or more processors 106 and a bus employed to connect and enable communication between the processors) 106 and the other components of the system 101 in accordance with known techniques. The bus connects the processor 106 to memory 105 and long-term storage .107 which can include a hard drive (including any of magnetic media, CD, DVD and Flash Memory for example) or a tape drive for example. The system 101 might also include a user interface adapter, which connects the microprocessor 106 via the bus to one or more interface devices, such as a keyboard .104, mouse 103, a Printer/scanner 110 and/or other interface devices, which can be any user interface device, such as a touch sensitive screen, digitized entry pad, etc. The bus also connects a display device 102, such as an LCD screen, or monitor, to the microprocessor 106 via a display adapter.
The system 101 may communicate with other computers or networks of computers by way of a network adapter capable of communicating 108 with a network 109. Example network adapters are communications channels, token ring, Ethernet or modems. Alternatively, the workstation 101 may communicate using a wireless interface, such as a CDPD (cellular digital packet data) card. The workstation. 1.01 may be associated with such other computers in a Local Area Network (LAN) or a Wide Area Network (WAN), or the workstation 101 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,
FIG. 2 illustrates a data processing network 200 in which embodiments may be practiced. The data processing network 200 may include a plurality of individual networks, such as a wireless network and a wired network, each of which may include a plurality of individual workstations 101 201 202 203 204. Additionally, as those skilled in. the art will appreciate, one or more LANs may be included, where a LAN may comprise a plurality of intelligent workstations coupled to a host processor.
Still referring to FIG. 2, the networks may also include mainframe computers or servers, such as a gateway computer (client server 206) or application server (remote server 208 which may access a data repository and may also be accessed directly from a workstation 205). A gateway computer 206 serves as a point of entry into each network 207. A gateway is needed when connecting one networking protocol to another. The gateway 206 may be preferably coupled to another network (the Internet 207 for example) by means of a communications link. The gateway 206 may also be directly coupled to one or more workstations 10.1 20.1 202 203 204 using a communications link. The gateway computer may be implemented utilizing an IBM eServer™ zSeries® z9® Server available from IBM Corp. Software programming code is typically accessed by the processor 1.06 of the system 101 from long-term storage media 107, such as a CD-ROM drive or hard drive. The software programming code may be embodied on any of a variety of known media for use with a data processing system, such as a diskette, hard drive, or CD-ROM. The code may be distributed on such media, or may be distributed to users 210 211 from the memory or storage of one computer system, over a network to other computer systems for use by users of such other systems.
Alternatively, the programming code 1 1 1 may be embodied in the memory 105, and accessed by the processor 106 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 112. Program code is normally paged from dense storage media 107 to high-speed memory 105 where it is available for processing by the processor 106. 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 (1,1 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 (l-Cache) holding machine instructions to be executed and a data cache (D-Cache) holding data operands.
Referring to FIG. 3, an exemplary processor embodiment, is depicted for processor 106. Typically one or more levels of Cache 303 are employed to buffer memory blocks in order to improve processor performance. The cache 303 is a high speed buffer holding cache lines of memory data that are likely to be used. Typical cache lines are 64, 128 or 256 bytes of memory data. Separate Caches are often employed for caching instructions than for caching data. Cache coherence (synchronization of copies of lines in Memory and the Caches) is often provided by various "Snoop" algorithms well known in the art. Main storage 105 of a processor system is often referred to as a cache. In a processor system having 4 levels of cache 303 main storage 105 is sometimes referred to as the level 5 (L5) cache since it is typically faster and only holds a portion of the non-volatile storage (DASD, Tape etc) that is available to a computer system. Main storage 105 "caches" pages of data paged in and out of the main storage 105 by the Operating system. A program counter (instruction counter) 311 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 typical iy 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 PS W of the program maintains the program counter value while the program, is not active, and the progra counter (in the PS W) 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 311 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 a Program Status Word (PSW) along with other slate 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 resu lt of the Branch Instruction into the Pro gram Counter 311. Typically an instruction Fetch Unit 305 is employed to fetch instructions on behalf of the processor 106. 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 106. in an embodiment, the fetched instruction(s) are passed to a dispatch unit 306 of the fetch unit . The dispatc unit decodes the instruction(s) and forwards information about the decoded instruetion(s) to appropriate units 307 308 310. An execution unit 307 will typically receive information about decoded arithmetic instructions from the instruction fetch unit 305 and will perform arithmetic operations on operands according to the opcode of the instruction. Operands are provided to the execution unit 307 preferably either from memory 105, architected registers
309 or from an inimediate field of the instruction being executed. Results of the execution, when stored, are stored either in memory 105, registers 309 or in other machine hardware (such as control registers, PS W registers and the like).
A processor 106 typical ly has one or more execution units 307 308 310 for executing the function of the instruction. Referring to F G. 4A. an execution unit 307 may communicate with architected general registers 309, a decode/dispatch unit 306 a load store unit 310 and other '401 processor units by way of interfacing logic 407. An Execution unit 307 may employ several register circuits 403 404 405 to hold information that the arithmetic logic unit (ALU) 402 will operate on. The ALU performs arithmetic operations such as add, subtract, multiply and divide as well as logical function such as and, or and exciusive-or (xor), rotate and shift. Preferably the ALU supports specialized operations that are design dependent. Other circuits may provide other architected facilities 408 including condition codes and recovery support logic for example. Typically the result of an ALU operation is held in an output register circuit 406 which can forward the result to a variety of other processing functions. There are many arrangements of processor units, the present description is only intended to provide a representative understanding of one embodiment. An ADD instruction for example would be executed in an execution unit 307 having arithmetic and logical functionality while a Floating Point instruction for example wou ld 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 307 on operands found in two registers 309 identified by- register fields of the instruction. The execution unit 307 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) '402 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 402 are designed for scalar operations and some for floating point. Data may he 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, l'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 and 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.
Trimodal Ail dressing
"Trimodal addressing" refers to the ability to switch between the 24-bit, 31-bit, and 64-bit addressing modes. This switching can be done by means of:
• The old instructions BRANCH AND SAVE AND SET MODE and BRA CH AND SET MODE. Both of these instructions set the 64-bit addressing mode if bit 63 of the
R2 general register is one. If bit 63 is zero, the instructions set the 24-bit or 31 -bit addressing mode if bit 32 of the register is zero or one, respectively. • The new instruction SET ADDRESSING MODE (SAM24, SAM3.1 , and SAM 64). The instruction sets the 24-bit,. 3 1 -bit, or 64-bit addressing mode as determined by the operation code.
Trf-Modai Instructions
Trimodal addressing affects the general instructions only in the manner in which logical storage addresses are handled, except as follows.
• The instructions BRANCH AND LINK, BRANCH AND SAVE, BRANCH AND SAVE AND SET MODE, BRANCH AND SET MODE, and BRANCH RELATIVE AND SAVE place information in bit positions 32-39 of general register R1 as in ESA/390 in the 24-bit or 31 -bit addressing mode or place address bits in those bit positions in the 64-bit addressing mode. The new instruction BRANCH RELATIVE AND SAVE LONG does the same.
• The instructions BRANCH AND SAVE AND SET MODE and BRANCH AND SET MODE place a one in bit position 63 of general register J in the 64-bit addressing mode, in the 24-bit or 31 -bit mode, BRANCH AND SAVE AND SET"' MODE sets bit 63 to zero, and BRA CH AND SET MODE leaves it unchanged.
» Certain instructions leave bits 0-31 of a general register unchanged in the 24-bit or 31 -bit addressing mode but place or update address or length information in them, in the 64-bit addressing mode. These are listed in programming note 1 on page 7-7 and are sometimes called modal instructions.
Effects on Bits 0-31 of a General Register:
Bits 0- 1 of general registers are changed by two types of instructions. The first type is a modal instruction (see the preceding section) when the instruction is executed in the 64-bit addressing mode. The second type is an instruction having, independent of the addressing mode, either a 64-bit result operand in a single general register or a 128-bit result operand in an even-odd general-register pair. Most of the instructions of the second type are indicated by a "(3," either alone or in "GF," m their mnemonics. All of the instructions of the second type are sometimes referred to as "G-type" instructions. If a program is not executed in the
64-bit addressing mode (Large GPR mode) and does not contain a G-type instruction, it cannot change bits 0-31 of any general register (Small GPR mode). In some environments, a portion of an application program may be in Small G PR mode and another portion ma y be in. Large GPR mode. In an embodiment, certain instructions may be Small GPR mode instructions and others may be Large GPR. mode instructions, wherein the mode of the computer is dependent on whether it is executing a Small GPR mode instruction or a Large GPR mode instruction.
Referring to FIG. 4B, Branch instruction information for executing a branch instruction is typically sent to a branch unit 308 which ofte employs a branch prediction algorithm such as a branch history table 432 to predict the outcome of the branch before other conditional operations are complete. The target of the current branch instruction will be fetched and speculatively executed before the conditional operations are complete. When the conditional operations are completed the speculatively executed branch instructions are either completed or discarded based on the conditions of the conditional operation and the speculated outcome, A typical branch instruction may test condition codes and branch to a target address if the condition codes meet the branch requirement of the branch instruction, a target address may be calculated based on several numbers including ones found in register fields or an immediate field of the instruction for example. The branch unit 308 may employ an ALU 426 having a plurality of input register circuits 427 428 429 and an output register circuit 430. The branch unit 308 may communicate with general registers 309, decode dispatch unit 306 or other circuits 425 for example.
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- pro vide 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 FIG. 4C, a processor accesses storage using a Load/Store unit 3 10. The Load/Store unit 310 may per.fb.rrn a Load operation by obtaining the address of the target operand in memory 303 and loading the operand in a register 309 or another memory 303 location, or may per.fb.rrn. a Store operation by obtaining the address of the target operand in memory 303 and storing data obtained from a register 309 or another memory 303 location in the target operand location in memory 303, The Load/Store unit 310 may be speculative and may access memory in a sequence that is out-of-order relative to instruction sequence, however the Load/Store unit 310 must maintain the appearance to programs that instructions were executed in order. A load/store unit 310 may communicate with general registers 309, decode/dispatch unit 306, Cache/Memory interface 303 or other elements 455 and comprises various register circuits, ALUs 458 and control logic 463 to calculate storage addresses and to provide pipeline sequencing to keep operations in-order. Some operations may be out of order but the Load/Store unit provides functionality to make the out of order operations to appear to the program as having been performed in order as is wel l known in the art..
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) 3 12 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 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 Look-aside Buffer (TLB) which comprises entries mapping a virtual address to an associated physical memory location. The entries are created when DAT 3 12 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 exclusi ve state, a changed state, an invalid state and the like in order to facilitate sharing.
I/O units 304 provide the processor with means for attaching to peripheral devices including Tape, Disc, Printers, Displays, and networks for example. I/O units are often presented to the computer program by software Drivers. In Mainframes such as the z/Series from IBM, Channel Adapters and Open System Adapters are I/O units of the Mainframe that provide the communications between the operating system and peripheral devices.
The following description from the z/ Architecture Principles of Operation describes an architectural view of a computer system: STORAGE
A computer system includes information in 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 must 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 C ACHE 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 horizonta l 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, 3.1 , 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, 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, bits are numbered in a leii-to- right sequence. 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 ears be addressed. To operate on individual bits of a byte in storage, it is necessar to access the entire byte. The bits in a byte are numbered 0 through 7, from left to right. The bits in an address may be numbered 8-3.1 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 automatical ly 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. 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 physica l path to storage may be greater than the length of the field being stored.
Certain units of information must be on an integral bo undary 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 m 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 do bleword 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, doub!ewords, and quadwords, the binary representation of the address contains one, two, three, or four rightmost zero bits. respectively. Instructions must be on two-byte integral boundaries. The storage operands of most instructions do not have boundary-alignment requirements.
On models 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.
INSTRUCTIONS
Typically, operation of the CPU is controlled by instructions in storage that are executed sequentially, one at a time, left to right in an ascending sequence of storage addresses. A change in the sequential operation may be caused by branching, LOAD PSW, interruptions, SIGNAL PROCESSOR orders, or manual intervention.
Preferably an instruction comprises two major parts:
* An operation code (op code), which specifies the operation to be performed
* Optionally, the designation of the operands tha participate.
Instruction formats of the zJ Architecture are shown in F!Gs, 5A-5F. An instruction can simply pro vide an Opcode 501 , or an opcode and a variety of fields including immediate operands or register specifiers for locating operands in registers or in memory. The Opcode can indicate to the hardware that implied resources (operands etc.) are to be used such as one or more specific general purpose registers (GPRs). Operands can be grouped in three classes: operands located in registers, immediate operands, and operands in storage. Operands ma ¬ be either explicitly or implicitly designated. Register operands can be located in general, floating- point, access, or control registers, with the type of register identified by the op code. The register containing the operand is specified by identifying the register in a four-bit field, called the R. field, in the instruction. For some instructions, an operand is located in an implicitly designated register, the register being implied by the op code, immediate operands are contained within the instruction, and the 8-bit, 16-bit, or 32-bit field containing the immediate operand is called the ] field. Operands in storage may have an implied length; be specified by a bit mask; be specified by a four-bit or eight-bit length specification, called the L field, In the instruction; or have a length specified by the contents of a general register. The addresses of operands in storage are specified by means of a format that uses the contents of a general register as part ofthe address. This makes it possible to:
Specify a complete address by using an abbreviated notation
Perform address manipulation using instructions which employ general registers for operands
Modify addresses by program means without alteration of the instruction stream
Operate independent of the location of data areas by directly using addresses received from other programs.
The address used to refer to storage either is contained in a register designated by the R field in the instruction or is calculated from a base address, index, and displacement, specified by the B, X, and D fields, respectively, in the instruction. When the CPU is in the access- register mode, a B or R field may designate an access register in addition to being used to specify an address. To describe the execution of instructions, operands are preferably designated as first and second operands and, in some cases, third and fourth operands. In general, two operands participate In an instruction execution, and the result replaces the first operand. An instruction is one, two, or three haifwords in length and must be located in storage on a halfword boundary. Referring to FIGs. 5A - 5F depicting instruction formats, each instruction is in one of 25 basic formats: E 501 , Ϊ 502, RI 503 504, RJE 505 551 552 553 554, RIL 506 507, RIS 555, RR 510, RRE 511, RRF 512 513 514, RRS, RS 516 517, RSI 520, RSI, 521 , RSY 522 523, RX 524, RXE 525, RXF 526, RXY 527, S 530, SI 531 , SI L 556, SIY 532, SS 533 534 535 536 537, SSE 541 and SSF 542, with three variations of RRF, two of RI, RIL, RS, and RSY, five of RJ E and SS.
The .fb.rm.at names Indicate, in general terms, the classes of operands which, participate in the operation and some details about fields:
4 RIS denotes a register-and-immediate operation and a storage operation.
• RRS denotes a register-and-register operation and a storage operation.
• SIL denotes a storage-and- immediate operation, with a 16-bit immediate field. In the I, RR, RS, RSI, RX, SI, and SS formats, tlie first byte of an instruction contains tlie op code. In the E, RRE, RRF, S, SIL, and SSE formats, the first two bytes of an instruction contain the op code, except that for some instructions in the S format, the op code is in only the first byte. In the Rl and RIL formats, the op code is in the first byte and bit positions 12- 15 of an instruction. In the RIE, RIS, RRS, RSL, RSY, RXE, RXF, RXY, and SIY formats, the op code is in the first byte and the sixth byte of an instruction. The first two bits of the first or only byte of the op code specify the length and format of the instruction, as follows:
In the RR. RRE, RRF, RRR, RX, RXE, RXF, RXY, RS, RSY, RSI, RL RIE, and RIL formats, the contents of the register designated by the R.l . field are called the first operand. The register containing the first operand is sometimes referred to as the "first operand location," and sometimes as "register Rl". In the RR, RRE, RRF and RRR formats, the R2 field designates the register containing the second operand, and the R2 field may designate the same register as Rl . In the RRF, RXF, RS, RSY,RSI, and RIE formats, the use of the R3 field depends on the instruction. In the RS and RSY formats, the R3 field may instead be an M3 field specifying a mask. The R fieid designates a general or access register in the general instructions, a general register in the control instructions, and a floating-point register or a general register in the floating-point instructions. For general and control registers, the register operand is i bit positions 32-63 of the 64-bit register or occupies the entire register, depending on the instruction.
In the I format, the contents of the eight-bit immediate- data field, the I field of the instruction, are directly used as the operand. In the SI format, the contents of the eight-bit immediate- data field, the 12 field of the instruction, are used directly as the second operand. The Bl and D 1 fields specify the first operand, which is one byte in length. In the SIY format, the operation is the same except that DH.1 and DEI fields are used instead of a Dl fieid. In the Rl format for the instructions ADD BALFWORD IMMEDIATE, COMPARE BALFWORD IMMEDIATE, LOAD HALF WOR D IMMEDIATE, and MULTIPLY BALFWORD IMMEDIATE, the contents of the 16-bit 12 field of the instruction are used directly as a signed binary integer, and the Rl field specifies the first operand, which is 32 or
64 bits in length, depending on the instruction. For the instruction TEST UNDER. MASK (TMHB, TMHL, TMLH, TMLL), the contents of the 12 field are used as a mask, and the Rl. field specifies the first operand, which is 64 bits in length.
For the instructions INSERT IMMEDIATE, AND IMMEDIATE, OR IMM EDIATE, and LOAD LOGICAL IMMEDIATE, the contents of the 12 field are used as an unsigned binary integer or a logical value, and the Rl field specifies the first operand, which is 64 bits in length. For the relative-branch iiistrtsctions in the Rl and RSI formats, the contents of the 16- bit 12 field are used as a signed binary integer designating a number of halfwords. This number, when added to the address of the branch instruction, specifies the branch address. For relative-branch instructions in the RIL format, the 12 field is 32 bits and is used in. the same way.
For the relative- branch instructions in the Rl and RSI formats, the contents of the 16-bit 12 field are used as a signed binary integer designating a number of halfwords. This number, when added to the address of the branc instruction, specifies the branc address. For relative-branch instructions in the RIL format, the 12 field is 32 bits and is used in the same way. For the RJE-formai instructions COMPARE IMMEDIATE AND BRANCH
RELATIVE and COMPARE LOGICAL IMMEDIATE AND BRA CH RELATIVE, the contents of the 8-bit 12 field is used directly as the second operand. For the RJE-format instructions COMPARE I MEDIATE AND BRANCH, COMPARE IM MEDIATE AND TRAP, COMPARE, LOGICAL. IMMEDIATE AND BRANCH, and COMPARE, LOGICAL. I MMEDIATE AN D TRAP, the contents of the 16- bit 12 field are used directly as the second operand. For the RIE-fomiat lustra ctions COMPARE AND BRANCH RELATIVE, COMPARE IMMEDIATE AND BRANCH RELATIVE, COMPARE LOGICAL AND BRANCH RELATIVE, and COMPARE LOGICAL IMMEDIATE AND BRANCH
RELATIVE, the contents of the 16-bit 14 field are used as a signed binary integer designating a number of halfwords that are added to the address of the instruction to form the branch address.
For the RIL-format instructions ADD IMMEDLATE, ADD LOGICAL IMMEDLATE, ADD LOGICAL WITH SIGNED IM MEDIATE, COMPARE I MM EDIATE, COMPARE LOGICAL IMMEDIATE, LOAD IMMEDIATE, and MULTIPLY SINGLE IMMEDIATE, ihe contents of the 32-bit 12 field are used directly as a the second operand. o the RIS-format instructions, the contents of the 8- bit 12 field are used directly as the second operand. In the SIL format, the contents of the 16-bit 12 field are used directly as the second operand. The Bl and Dl fields specify the first operand, as described below.
In the RSL, Si, SIL, SSE, and most SS formats, the contents of the general register designated by the Bl field are added to the contents of the Dl field to form the first -operand address. In the RS, RSY, S, SIY, SS, and SSE formats, the contents of the general register designated by the B2 field are added to the contents of the D2 field or DH2 and DL2 fields to form the second-operand address. In the RX, RXE, RXF, and RXY formats, the contents of the general registers designated by the X2 and B2 fields are added to the contents of the D2 field or DH2 and DL2 fields to form the second-operand address. In the RIS and RRS formats, and in one SS format, the contents of the general register designated by the B4 field are added to the contents of the D4 field to form the fourth-operand address.
In the SS format with a single, eight-bit length field, for the instructions AND ( C), EXCLUSIVE OR (XC), MOVE (MVCj, MOVE NUMERICS, MOVE ZONES, and OR (0€), L specifies the number of additional operand bytes to the right of the byte designated by the first-operand address. Therefore, the length in bytes of the first operand is 1-256, corresponding to a length code in L of 0-255. Storage results replace the first operand and are never stored outside the field specified by the address and length. In this format, the second operand has the same length as the first operand. There are variations of the preceding definition that apply to EDIT, EDIT AND MARK, PACK ASCII, PACK
UNICODE, TRANSLATE, TRANSLATE AND TEST, UNPACK ASCII, and UNPACK. UNICODE.
In the SS format with two length fields, and in the RSL format, LI specifies the number of additional operand bytes to the right of the byte designated by the first -operand address. Therefore, the length in bytes of the first operand is 1 -16, corresponding to a length code in LI of 0-15. Similarly, L2 specifies the number of additional operand bytes to the right of the location designated by the second-operand address Results replace the first operand and are never stored outside the field specified by the address and length, if the first operand is longer than the second, the second operand is extended on the left with zeros up to the length of the ftrst operand. This extension does not modify the second operand in storage. In the SS format with two R fields, as used by the MOVE TO PRIMARY, MOVE TO SECONDARY, and MOVE WITH KEY instructions, the contents of the general register specified by the Rl. field are a 32-bit unsigned value called the true length. The operands are both of a length called the effective length. The effective length is equal to the true length or 256, whichever is less. The instructions set the condition code to facilitate programming a loop to move the total number of bytes specified by the true length. The SS format with two R fields is also used to a range of registers and two storage operands for the LOAD MU LTIPLE DISJOINT instruction and to specify one or two registers and one or two storage operands for the PERFORM: LOCKED OPERATION instruction. A zero in any of the Bl, B2, X2, or B4 fields indicates the absence of the corresponding address component. For the absent component, a zero is used informing the intermediate sum, regardless of the contents of general register 0, A displa cement of zero has no specia l significance. Bits 1 and 32 of the current PSW are the addressing- mode bits. Bit 31 is the extended- addressing mode bit, and bit 32 is the basic-addressiiig-mode bit. These bits control the size of the effective address produced by address generation. When bits 3.1 and 32 of the current PSW both are zeros, the CPU is in the 24-bit addressing mode, and 2 -bit instruction and operand effective addresses are generated. When bit 1 of the current PSW is zero and bit 32 is one, the CPU is in the 31-bit addressing mode, and 31 -bit instruction and operand effective addresses are generated. When bits 31 and 32 of the current PSW are both one, the CPU is in the 64-bit addressing mode, and 64-bit instruction and operand effective addresses are generated. Execution of instructions by the CPU involves generation of the addresses of instructions and operands.
When an instruction is fetched from, the location designated by the current PSW, the instruction address is increased by the number of bytes in the instruction, and the instruction is executed. The same steps are then repeated by using the new value of the instruction address to fetch the next instruction in the sequence. In the 24-bit addressing mode, instruction addresses wrap around, with the haifword at instruction address 2 " - 2 being fol lowed by the haifword at instruction address 0. Thus, in the 24-bit addressing mode, any carry out of PSW bit position 104, as a result of updating the instruction address, is lost. In the 31 -bit or 64-bit addressing mode, instruction addresses similarly wrap around, with the haifword at instruction address 2J: - 2 or 264 - 2, respectively, followed by the haifword at instruction address 0. A cany out of PSW bit position 97 or 64, respectively, is lost.
An. operand address that refers to storage is derived from a intermediate value, which either is contained in a register designated by an R field in the instruction or is calculated from the sum of three binary numbers: base address, index, and displacement. The base address (B) is a 64-bit number contained in a general register specified by the program in a four bit field, called the B field, in the instruction. Base addresses can be used as a means of independently addressing each program, and data area. In array type calculations, it can designate the location of an array, and, in record-type processing, it can identify the record. The base address provides for addressing the entire storage. The base address may also be used for indexing.
The index (X) is a 64-bit number contained in a general register designated by the program in a four -bit field, called the X field, in the instruction. It is included only in the address specified by the RX~, RXE-, and RX'V -format instructions. The RX-, K L-, RXF-, and RXY- format instructions permit double indexing; that is, the index can be used to provide the address of an element, within an array.
The displacement (D) is a 12-bit or 20-bit. number contained in a field, called the D field, in the instruction. A 12-bit displacement is unsigned and provides for relative addressing of up to 4,095 bytes beyond the location designated by the base address. A 20-bit displacement is signed and provides for relative addressing of up to 524,287 bytes beyond the base address location or of up to 524,288 bytes before it. In array-type calculations, the displacement can be used to specify one of many items associated with an element. In the processing of records, the displacement can be used to identify items within a record, A 12-bit displacement is in bit positions 20-31 of instructions of certain formats. In instructions of some formats, a second 12-bit displacement also is in the instruction, in bit positions 36-47.
A 20-bit displacement is in instructions of only the RSY, RXY, or SIY format, in these instructions, the D field consists of a DL (low) field in bit positions 20-31 and of a DH (high) field in bit positions 32-39. When the long-displacement facility is installed, the numeric value of the displacement is formed by appending the contents of the DH field on the left of the contents of the DL field. When the long-d isp ί acemen t facility is not installed, the numeric value of the displacement is formed by appending eight zero bits on the left of the contents of the DL field, and the contents of the DH field are ignored.
In forming the intermediate sum, the base address and index are treated as 6 -bit binary integers. A 12-bit displacement is treated as a 12-bit unsigned binary integer, and 52 zero bits are appended on the left. A 20-bit displacement is treated as a 20-bit signed binary integer, and 44 bits equal to the sign bit are appended on the left. The three are added as 64- bit binary numbers, ignoring overflow. The sum is always 64 bits long and is used as an intermediate value to form the generated address. The bits of the intermediate value are numbered 0-63. A zero in any of the B 1 , B2, X2, or B4 fields indicates the absence of the corres onding address component. For the absent component, a zero is used in forming the intermediate sum, regardless of the contents of general register 0. A displacement of zero has no special significance.
When an instruction description specifies that the contents of a general register designated by an R field are used to address an operand in storage, the register contents are used as the 64-bit intermediate value.
An instruction can designate the same general register both for address computation and as the location of an operand. Address computation is completed before registers, if any, are changed by the operation. Unless otherwise indicated in an individual instruction definition, the generated operand address designates the leftmost byte of an operand in storage. The generated operand address is always 64 bits long, and the bits are numbered 0-63. The manner in which the generated address is obtained from the intermediate value depends on the current addressing mode. In the 24-bit addressing mode, bits 0-39 of the intermediate value are ignored, bits 0-39 of the generated address are forced to be zeros, and bits 40-63 of the intermediate value beeome bits 40-63 of the generated address. In the 31 -bit addressing mode, bits 0-32 of the intermediate value are ignored, bits 0-32 of the generated address are forced to be zero, and bits 33-63 of the i termediate value become bits 33-63 of the generated address. I the 64-bit addressing mode, bits 0-63 of the intermediate value become bits 0-63 of the generated address. Negative values may be used in index and base-address registers. Bits 0-32 of these values are ignored in the 31 -bit addressing mode, and bits 0-39 are ignored in the 24-bit addressing mode.
For branch instructions, the address of the next instruction to be executed when the branch is taken is called the branch address. Depending on the branch instruction, the instruction format may be RR, REE, RX, RXY. RS. RSY, kSL RI, RJE, or R L. In the RS, RSY, RX, and RXY formats, the branch address is specified by a base address, a displacement, and, in the RX and RXY* formats, an index. In these formats, the generation of the intermediate value follows the same rules as for the generation of the operand-address intermediate value. In the RR and R. E formats, the contents of the general register designated by the R.2 field are used as the intermediate value from which the branch address is formed. General register
0 cannot be designated as containing a branch address, A value of zero in the R2. field causes the instruction to be executed without branching.
The relative-branch instructions are in the RSI, RI, RIE, and RI L. formats. In the RSI, RI, and RIE formats for the relative-branch instructions, the contents of the 12 field are treated as a 16-bit signed binary integer designating a number of haifwords. In the RIL, format, the contents of the Ϊ2 field are treated as a 32-bit signed binary integer designating a number of haifwords. The branch address is the number of haifwords designated by the 12 field added to the address of the relative- branch instruction.
The 64-bit intermediate value for a relative branch instruction in the RSI, RI, RIE, or RJ format is the sum of two addends, with overflow from bit position 0 ignored. In the RSL RI, or RIF. forrruu. the first addend is the conten ts of the 12 field with one zero bit appended on the right and 47 bits equal to the sign bit of the contents appended on the left, except that for COMPARE AND BRANCH RELATIVE, COMPARE IMMEDIATE AND BRANCH RELATI VE, CO PA L LOGICA L AND BRANCH RELATIVE] and COMPAR E
LOGICAL IMMEDIATE AND BRANCH RELATIVE, the first addend is the contents of the 14 field, with bits appended as described above for the 12 fie id. In the RLE format, the first addend is the contents of the 12 field with one zero bit appended on the right and 31 bits equal to the sign bit of the contents appended o the left. In all formats, the second addend is the 64-bit address of the branch instruction. The address of the branch instruction is the instruction address in the PSW before that address is updated to address the next sequential instruction, or it is the address of the target of the EXECUTE instruction if EXECUTE is used. If EXECUTE is used in the 24-bit or 31-bit addressing mode, the address of the branch instruction is the target address with 40 or 33 zeros, respectively, appended on the left. The branch address is always 64 bits long, with the bits numbered 0-63. The branch address replaces bits 64- ί 27 of the current PSW. The manner in which the branch address is obtained from the intermediate value depends on the addressing mode. For those branch instructions which change the addressing mode, the new addressing mode is used. In the 24- bit addressing mode, bits 0-39 of the Intermediate value are ignored, bits 0-39 of the branch address are made zeros, and bits 40-63 of the intermediate value become bits 40-63 of the branch address. In the 31 -bit addressing mode, bits 0-32 of the intermediate value are ignored, bits 0-32 of the branch address are made zeros, and bits 33-63 of the intermediate value become bits 33-63 of the branch address. In the 64-bit addressing mode, bits 0-63 of the intermediate value become bits 0-63 of the branc h address.
For several branch instructions, branching depends on satisfying a specified condition. When the condition is not satisfied, the branch is not taken, normal sequential instruction execution continues, and the branch address is not used . When a branch is tak en, bits 0-63 of the branch address replace bits 64-127 of the current PSW. The branch address is not used to access storage as part of the branch operation. A specification exception due to an odd branch address and access exceptions due to fetching of the instruction at the branch location are not recognized as part of the branch operation but instead are recognized as exceptions associated with the execution of the instruction at the branch location.
A branch instruction, such as BRANCH AND SAVE, can designate the same general register for branch address computation and as the location of an operand. Branch-address computation is completed before the remainder of the operation is performed .
The program-status word (PSW), described in. Chapter 4 "Control" contains information required for proper program execution. The PSW is used to control instruction sequencing and to hold and indicate the status of the CPU in relation to the program currently being executed. 'Hie active or controlling PSW is called the current PSW. Branch instructions perform the functions of decision making, loop control, and subroutine linkage. A branch instruction affects instruction sequencing by introducing a new instruction address into the current PSW. The relative-branch instructions with a 16-bit 12 field allow branching to a location at an offset of up to plus 64 - 2 bytes or minus 64 bytes relative to the location of the branch instruction, without the use of a base register. The relative-branch instructions with a 32-bit 12 field allow branching to a location at an offset of up to plus 4G - 2 bytes or minus 4G bytes relative to the location of the branch instruction, without the use of a base register.
Facilities for decision making are provided by the BRANCH ON CONDITION, BRANCH RELATIVE ON CONDITION, and BRANCH RELATIVE ON CONDITION LONG instructions. These instructions inspect a condition code that reflects the result of a majority of the arithmetic, logical, and I/O operations. The condition code, which consists of two bits, provides for four possible condition-code settings: 0, 1, 2, and 3.
The specific meaning of any setting depends on the operation that sets the condition code. For example, the condition code reflects such, conditions as zero, nonzero, first operand high, equal, overflow, and subchannel busy. Once set, the condition code remains unchanged until modified by an instruction that causes a different condition code to be set. Loop control can be performed by the use of BRANCH ON CONDITION, BRANCH RELATIVE ON CONDITION, and BRANCH RELATIVE ON CONDITION LONG to test the outcome of address arithmetic and counting operations. For some particularly frequent combinations of arithmetic and tests, BRANCH ON COUNT, BRANCH ON INDEX HIGH, a d BRANCH ON INDEX LOW OR EQUAL are provided, and relative-branch equivalents of these instructions are also provided. These branches, being specialized, provide increased performance for these tasks.
Subroutine linkage when a change of the addressing mode is not required is provided by the BRANCH AND LIN and BRANCH AND SAVE instructions, (This discussion of
BRANCH AND SAVE applies also to BRANCH RELATIVE AND SAVE and BRANCH RELATIVE AND SAVE LONG.) Both of these Instructions permit not only the Introduction of a new instruction address but also the preservation of a return address and associated information. The return address is the address of the instruction following the branch instruction in storage, except that it is the address of the instruction following an EXECUTE instruction that has the branch instruction as its target.
Both BRANCH AND LINK and BRANCH AND SAVE have an III field. They form a brunch address by means of fields that depend on the instruction. The operations of the instructions are summarized as follows:
4 In the 2 -bit addressing mode, both instructions place the return address in bit positions 40- 63 of general register Rl and leave bits 0-31 of that register unchanged. BRANCH AND LINK places the instruction-length code for the instruction and also the condition code and program mask from the current PSW in bit positions 32-39 of general register Rl BRANCH AND SAVE places zeros in those bit positions.
• In the 31-bit addressing mode, both instructions place the return address in bit positions 33- 63 and a one in bit position 32 of general register R 1 , and they leave bits 0-31 of the register unchanged.
• In the 64-bit addressing mode, both instructions place the return address in bit positions 0- 63 of general register Rl .
• In any addressing mode, both instructions generate the branch address under the control of the current addressing mode. The Instructions place bits 0-63 of the branch address in bit positions 64-127 of the PSW. In the RR format, both instructions do not perform branching if the 1 2 field of the instruction is zero.
It can be seen that, in the 24-bit or 3.1 -bit addressing mode, BRANCH AND SAVE places the basic addressing- mode bit, bit 32 of the PSW, in bit position 32 of ge eral register Rl.
BRANCH AND LINK does so in the 1 -bit addressing mode. The instructions BRANC H AND SAVE AND SET MODE and BRANCH AND SET MODE are for use when a change of the addressing mode is required during linkage. These instructions have R l and R2 fields. The operations of the instructions are summarized as follows:
* BRANCH AND SAVE AND SET MODE sets the contents of general register Rl the same as BRANCH AND SAVE. In addition, the instruction places the extended-addressing-mode bit, bit 31 of the PSW, in bit position 63 of the register.
» BRANCH AND SET MODE, if Rl is nonzero, performs as follows. In the 24- or 31 -bit mode, it places bit 32 of the PSW in bit position 32 of general register Rl, and it leaves bits 0-31 and 33-63 of the register unchanged. Note that bit 63 of the register should be zero if the register contains an instruction address. In the 64-bit mode, the instruction places bit 31 of the PSW (a one) in bit position 63 of general register RL and it leaves bits 0-62 of the register unchanged.
* When R2 is nonzero, both instructions set the addressing mode and perform branching as follows. Bit 63 of general register R2 is placed in bit position 31 of the PSW. If bit 63 is zero, bit 32 of the register is placed in bit position 32 of the PSW. If bit 63 is one, PSW bit 32 is set to one. Then the branch address is generated from the contents of the register, except with bit 63 of the register treated as a zero, under the control of the new addressing mode. The instructions place bits 0-63 of the branch address in bit positions 64-127 of the PSW. Bit 63 of general register R2 remains unchanged and, therefore, may be one upon entry to the called program. If R2 is the same as Rl, the results in the designated general register are as specified for the R 1 register.
INTERRUPT! ON S (CONT EXT S WITC H)
The interruption mechanism permits the CPU to change its state as a result of conditions externa! to the configuration, within the configuration, or within the CPU itself. To permit fast response to conditions of high priority and immediate recognition of the type of condition, mterniption conditions are grouped into six classes: external input/output, machine check, program, restart, and supervisor call.
An interruption consists in storing the current PSW as an old PSW, storing information identifying the cause of the interruption, and fetching a new PSW. Processing resumes as specified by the new PSW. The old PSW stored on an interruption normally contains the address of the instruction that would have been executed next had the interruption not occurred, thus permitting resumption of the interrupted program. For program and supervisor-call interruptions, the information stored also contains a code that identifies the length of the last-executed instruction, thus permitting the progra to respond to the cause of the interruption, in the case of some program conditions for which the normal response is re- execution of the instruction causing the interruption, the instruction address directly identifies the instruction last executed. Except for restart, an interruption can occur only when the CPU is in the operating state. The restart interruption can occur with the CPU in either the stopped or operating state.
Any access exception is recognized as part of the execution of the instruction with which the exception is associated. An access exception is not recognized when the CPU attempts to prefetch from an unavailable location or detects some other access-exception condition, but a branch instruction or an interruption changes the instruction sequence such that the instruction is not executed. Every instruction can cause an access exception to be recognized because of instruction fetch. Additionally, access exceptions associated with instruction execu tion may occur because of an access to an operand in storage. An access exception due to fetching an instruction is indicated when the first instruction halfword cannot be fetched without encountering the exception. When the first halfword of the instruction has no access exceptions, access exceptions may be indicated for additional halfwords according to the instruction length specified by the first two bits of the instruction ; however, when the operation can be performed without accessing the second or third halfwords of the instruction, it is unpredictable whether the access exception is indicated for the unused part.
Since the indication of access exceptions for instruction fetch is common to all instructions, it is not covered in the individual instruction definitions. Except where otherwise indicated in the individual instruction description, the following rules apply for exceptions associated with an access to an operand location. For a fetch-type operand, access exceptions are necessarily indicated only for that portion of the operand which is required for completing the operation, it is unpredictable whether access exceptions are indicated for those portions of a fetch-type operand which are not required for completing the operation.
For a store- type operand, access exceptions are recognized for the entire operand even if the operation could be completed without the use of the inaccessible part of the operand. In situation s where the value of a store-type operand is de fin ed to be unpredictable, it is unpredictable whether an access exception is indicated. Whenever an access to an operand location can cause an access exception to be recognized, the word "access" is included in the list of program exceptions in the description of the instruction. This entry also indicates which operand can cause the exception to be recognized and whether the exception is recognized on a fetch or store access to that operand location. Access exceptions are recognized only for the portion of the operand as defined for each particular instruction.
An operation exception is recognized when the CPU attempts to execute an instruction with an invalid operation code. The operation code may be unassigned, or the instruction with that operation code may not be installed on the CPU. The operation is suppressed. The instruction-length code is 1, 2, or 3. The operation exception is indicated by a program interruption code of 0001 hex (or 0081 hex if a concurrent PER event is indicated).
Some models may offer instructions not described in this publication, such as those provided for assists or as part of special or custom features. Consequently, operation codes not described in t is publication do not necessarily cause an operation exception to be recognized. Furthermore, these instructions may cause modes of operation to be set up or may otherwise alter the ma chine so as to affect the execution of subsequent instructions. To avoid causing such an operation, an instruction with an operation code not described in this publication should be executed only when the specific function associated with the operation code is desired. A specification exception is recognized when any of the following is true:
1 . A one is introduced into an unassigned bit position of the PSW (that is, any of bit positions 0, 2-4, 24-30, or 33-63). This is handled as an early PSW specification exception.
2. A one is introduced into bit position 12 of the PSW. This is handled as an early PSW specification exception.
3. The PSW is invalid in any of the following ways: a. Bit 3.1 of the PSW is one and bit 32 is zero, b. Bits 31 and 32 of the PSW are zero, indicating the 24-bit addressing mode, and bits 64-103 of the PSW are not all zeros, e. Bit 31 of the PSW is zero and bit 32 is one, indicating the 31 -bit addressing mode, and bits 64-96 of the PSW are not all zeros. This is handled as an early PSW specification exception.
4. The PSW contains an odd instruction address.
5. An operand address does not designate an integral boundary in an instruction requiring such integral-boundary designation.
6. An odd-numbered general register is designated by an R field of an instruction that requires an even-numbered register designation.
7. A floating-point register other than 0, 1 , 4, 5, 8, 9, 12, or 13 is designated for an extended operand.
8. The multiplier or divisor in decimal arithmetic exceeds 15 digits and sign.
9. The length of the first-operand field is less than or equal to the length of the second- operand field in decimal multiplication or division.
10. Execution of CIPHER MESSAGE, CIPHER MESSAGE WITH CHAINING,
COM PUTE INTERMEDIATE MESSAGE DIGEST, COMPUTE EAST MESSAGE DIGEST, or COMPUTE MESSAGE AUTHENTICATION CODE is attempted, and the function code in bits 57-63 of general register 0 contain an unassigned or uninstalled function code.
11. Execution of CIPHER MESSAGE or CIPHER MESSAGE WITH CHAINING is attempted, and the R l or R2 field designates an odd-numbered register or general register 0.
12. Execution of CIPHER MESSAGE, CIPHER MESSAGE WITH CHAINING,
COMPUTE INTERMEDIATE MESSAGE DIGEST or COMPUTE MESSAGE
AUTHENTICATION CODE is attempted, and the second operand length is not a multiple of the data block size of the designated function. This specification-exception condition does not apply to the query functions. 13. Execution of COMPARE AND FORM CODEWORD is attempted, and genera! registers 1 , 2, and 3 do not initially contain even values.
32. Execution of COMPARE AND SWAP AND STORE is attempted and any of the following conditions exist:
* The function code specifies an u assigned value.
* The store characteristic specifies an unassigned value,
* The function code is 0, and the first operand is not designated on a word boundary.
* The function code is 1 , and the first operand is not designated on a. doubieword boundary.
- The second operand is not designated on an integral boundary corresponding to the size of the store value.
33. Execution of COMPARE LOGICAL LONG UN ICODE or MOVE LONG UNICODE is attempted, and the contents of either general register Rl + I or R3 + 1 do not specify an even num ber of bytes.
34. Execution of COMPARE LOGICAL STRING, MOVE STRING or SEARCH STRING is attempted, and bits 32-55 of general register 0 are not all zeros.
35. Execution of COMPRESSION CALL is attempted, and hits 48- 1 of general register 0 have any of the values 0000 and 01 10-1 1 I 1 binary.
36. Execution of COMPUTE INTERMEDIATE MESSAGE DIGEST, COMPUTE LAST MESSAGE DIGEST, or COMPUTE MESSAGE AUT HENTI CATION CODE is attempted, and either of the f llowing is true:
4 The R2. field designates an odd-numbered register or general register 0.
s Bit 56 of general register 0 is not zero.
37. Execution of CONVERT HFP TO BFP, CONVERT TO FIXED (BFP or HFP), or LOAD FP INTEGER (BFP) is attempted, and the M3 field does not designate a valid modifier.
38. Execution of DIVI DE, TO INTEGER is attempted, and the M4 field does not designate a valid modifier.
39. Execution of EXECUTE is attempted, and the target address is odd.
40. Execution of EXTRACT STACKED STATE is attempted, and the code in bit positions 56-63 of general register R2 is greater than 4 when the ASN-and-LX-reuse facility is not installed or is greater than 5 when the facility is installed. 41. Execution of FIND LEFTMOST ONE is attempted, and the R.1 field designates an oddnumbered register.
42. Execution of INVALIDATE DAT TABLE ENTRY is attempted, and bits 44-5.1 of general register R2 are not all zeros,
43. Execution of LOAD FPC is attempted, and one or more bits of the second operand corresponding to unsupported bits in the FPC register are one.
44. Execution of LOAD PAGE -TABLE -ENTRY ADDRESS is attempted and the M4 field of the instruction contains any value other than 0000-0100 binary.
45. Execution of LOAD PS W is attempted and bit 12 of the doubleword at the second- operand address is zero. It is mode! dependent whether or not this exception is recognized.
46. Execution of MONITOR CALL is attempted, and bit positions 8» 1 1 of the instruction do not contain zeros.
47. Execution of MOVE PAGE is attempted, and bit positions 48-51 of general register 0 do not contain zeros or bits 52 and 53 of the register are both one.
48. Execution of PACK ASCII is attempted, and the L2 field is greater than 31 .
49. Execution of PACK UNICODE is attempted, and the L2 field is greater than 63 or is even.
50. Execution of PERFORM FLOATING POINT OPERATION ts attempted, bit 32 of general register 0 is zero, and one or more fields in bits 33- 63 are invalid or designate an uninstalled function.
51. Execution of PERFORM LOCKED OPERATION is attempted, and any of the following is true:
• The T bit, bit 55 of general register 0 is zero, and the function code in bits 56-63 of the register is invalid.
• Bits 32-54 of general register 0 are not al l zeros.
• In the access-register mode, for funct ion codes that cause use of a parameter List containing an ALEX, the R3 field is zero.
52. Execution of PERFOR M TI MING FACILITY FUNCTION Is attempted, and either of the following is true:
4 Bit 56 of general register 0 Is not zero.
• Bits 57-63 of general register 0 specify an unassigned or uninstalled function code. 53. Execution of PRDGRAM TRANSFER or PRDGRAM TRANSFER WITH INSTANCE is attempted, and all of the following are true:
• The extended-addressing-mode bit in the PSW is zero.
• The basie-addressing-mode bit, bit 32, i the general register designated by the R2 field of the instruction is zero.
• Bits 33-39 of the instruction address in the same register are not ah zeros.
54. Execution of RESUME PROGRAM is attempted, and either of the following is true:
• Bits 3 E, 32, and 64-127 of the PSW field in the second operand are not valid for placement in the current PSW. The exception is recognized if any of the following is true:
- Bits 31 and 32 are both zero and bits 64-103 are not all zeros.
- Bits 3 1 and 32 are zero and one, respectively, and bits 64-96 are not all zeros.
- Bits 31 and 32 are one and zero, respectively.
- Bit 127 is one.
• Bits 0-12 of the parameter list are not all zeros.
55. Execution of SEARCH STRING UN ICODE is attempted, and bits 32-47 of general register 0 are not all zeros.
56. Execution of SET ADDRESS SPACE CONTROL- or SET ADDRESS SPACE
CONTROL FAST is attempted, and bits 52 and 53 of the second-operand address are not both zeros.
57. Execution of SET ADDRESSING MODE (SAM24) is attempted, and bits 0-39 of the un-updated instructio address in the PSW7, bits 64-103 of the PSW7, are not all zeros.
58. Execution f SET ADDRESSING MODE- (SAM31 ) is attempted, and bits 0-32 of the un-updated instruction address in the PSW, bits 64-96 of the PSW, are not all zeros.
59. Execution of SET CLOCK PROGRAMMABLE FIELD is attempted, and bits 32-47 of general register 0 are not all zeros.
60. Execution of SET FPC is attempted, and one or more bits of the first operand corresponding to unsupported bits in the FPC register are one.
61. Execution of STORE SYSTEM INFORMATION is attempted, the function code in general register 0 is valid, and either of the following is true:
4 Bits 36-55 of ge eral register 0 and bits 32- 47 of general register 1 are ot all zeros.
• The second-operand address is not aligned on a 4K-byte boundary. 62. Execution of TRANSLATE TWO TO ONE or TRANSLATE TWO TO TWO is attempted, and the length in general register Rj + 3 does not specify an even number of bytes.
63. Execution of UNPACK ASCII is attempted, and the LI field is greater than 31.
64. Execution of UNPACK UNICODE is attempted, and the LI field is greater than 63 or is even.
65. Execution of UPDATE TREE is attempted, and the initial contents of general registers 4 and 5 are not a multiple of 8 in the 24-bit or 31 -bit addressing mode or are not a multiple of 16 in the 64-bit addressing mode. The execution of the instruction identified by the old PSW is suppressed. However, for early PSW specification exceptions (causes 1 -3) the operation that introduces the new PSW is completed, but an interruption occurs immediately thereafter. Preferably, the instruction- length code (ILC) is 1, 2, or 3, indicating the length of the instruction causing the exception. When the instruction address is odd (cause 4 on page 6-33), it is unpredictable whether the iLC is 1 , 2, or 3. When the exception is recognized because of an early PSW specification exception (causes 1-3) and the exception lias been introduced by LOAD PSW, LOAD PSW EXTENDED, PROGRAM RETURN, or an interruption, the ILC is 0. When the exception is introduced by SET ADDRESSING MODE (SAM24, SAM31 ), the ILC is 1 , or it is 2 if SET ADDRESSING MODE was the target of EXECUTE. When the exception is introduced by SET SYSTEM MASK or by STORE THEN OR SYSTEM MASK, the ILC is 2.
Program interruptions are used to report exceptions and events which occur during execution of the program. A program interruption causes the old PSW to be stored at real locations 336-351 and a new PSW to be fetched from real locations 464-479. The cause of the interruption is identified by the interruption code. The interruption code is placed at real locations 142-143, the instruction-length code is placed in bit positions 5 and 6 of the byte at real locatio 141 with the rest of the bi ts se to zeros, and zeros are stored at rea l location 140. For some causes, additional information identifying the reason for the interruption is stored at real locations 144-183. If the PER-3 facility is Installed, then, as part of the program in terruption action, the con tents of the breaking-even t-address register are placed in real storage locations 272-279. Except for PER events and the erypto-operatioii exception. the condition causing the interruption is indicated by a coded value placed in the rightmost seven bit positions of the Interruption code. Only one condition at a time can be indicated. Bits 0-7 of the interruption code are set to zeros. PER events are indicated by setting bit 8 of the interruption code to one. When this is the only condition, bits 0-7 and 9-15 are also set to zeros. When a PER event is indicated concurrently with another program interruption condition, bit 8 is one, and bits 0-7 and 9-15 are set as for the other condition. The crypto- operation exception is indicated by an interruption code of 0119 hex, or 0199 hex if a PER event is also indicated.
When there is a. corresponding mask bit, a progra interruptio can occur only when that mask bit is one. The program mask in the PS W controls tour of the exceptions, the ΪΕΕΕ masks in the FPC register control the IEEE exceptions, bit 33 in control register 0 controls whether SET SYSTEM MASK causes a special- operation exception, bits 48-63 in control register 8 control interruptions due to monitor events, and a hierarchy of masks control interruptions due to PER. events. When any controlling mask bit is zero, the condition is ignored; the condition does not remain pending.
When the new PS W for a program interruption has a PS W-format error or causes an exception to be recognized in the process of instruction fetching, a. string of program interruptions may occur.
Some of the conditions indicated as program exceptions may be recognized also by the channel subsystem, in which case the exception is indicated in the subchannel-status word or extended-status word.
When a data exception causes a program interruption, a data-exception code (DXC) is stored at location 147, and zeros are stored at locations 144-146. The DXC distinguishes between the various types of data-exception conditions. When the AFP -register (additional floatingpoint register) control bit, bit 45 of control register 0, is one, the DXC is also placed in the DXC field of the floating-point-control (FPC) register. The DXC field in the FPC register remains unchanged when any other program exception is reported. The DXC is an 8-bit code indicating the specific cause of a data exception. DXC 2 and 3 are mutually exclusive and are of higher priority than any other DXC. Thus, for example. DXC 2 (BFP instruction) takes precedence over any ΪΕΕΕ exception; and DXC 3 (DFP instruction) takes precedence over any IEEE exception or simulated IEEE exception. As another example, if the conditions for both DXC 3 (DFP mstruction) and DXC 1 (AFP register) exist, DXC 3 is reported. When both a specification exception and an AFP register data exception apply, it is unpredictable which one is reported.
An addressing exception is recognized when the CPU attempts to reference a main-storage location that is not available in the configuration. A main-storage location is not available in the configuration when the location is not installed, when the storage unit is not in the configuration, or when power is off in the storage unit. An address designating a storage location that is not available in the configuration is referred to as invalid. The operation is suppressed when the address of the mstruction is invalid. Similarly, the operation is suppressed when the address of the target instruction of EXECUTE is invalid . Also, the unit of operation is suppressed when an addressing exception is enco untered in accessing a table or table entry. The tables and table entries to which the rule applies are the dispatchable-unit- eoutrol table, the primary ASN second- table entry, and entries in the access list, region first table, region second table, region third table, segment table, page table, linkage table, linkage- first table, linkage-second table, entry table, ASN first table, ASN second table, authority table, linkage stack, and trace table. Addressing exceptions result in suppression when they are encountered for references to the region first table, region second table, region third table, segment table, and page table, in both implicit references for dynamic address translation and references associated with the execution of LOAD PAGE-TABLE-ENTRY ADDRESS, LOAD REAL ADDRESS, STORE REAL ADDRESS, and TEST
PROTECTION. Similarly, addressing exceptions for accesses to the dispatcha ble-unit control table, primary ASN-second- table entry, access list, ASN second table, or authority table result in suppression when they are encountered in access-register translation done either implicitly or as part of LOAD PAGE-TABLE-ENTRY ADDRESS, LOAD REAL ADD ESS, STOR E REAL ADDRESS, TEST ACCESS, or TEST PROTECTION. Except for some specific Instructions whose execution is suppressed, the operation is terminated for an operand address that can be translated but designates an unavailable location. For termination, changes may occur only to result fields. In this context, the term "'result field" includes the condition code, registers, and any storage locations thai are provided and that are designated to be changed by the instruction.
The foregoing is useful in understanding the termino logy and structure of one comp uter system embodiment. Embodime ts not limited to the z/ Architecture or to the description provided thereof. Embodiments can be advantageously applied to other computer
architectures of other computer manufacturers with the teaching herein.
Different processor architectures provide a limited number of general registers ( GRs)„ sometimes referred to as general purpose registers, that are explicitly (and/or implicitly) identified by instructions of the architected instruction set. IBM z/ Architecture and its predecessor architectures (dating back to the original System 360 circa 1964) provide 16 general registers (GRs) for each central processing unit (CPU). GRs may be used by processors (central processing unit (CPU)) instructions as follows:
As a source operand of an arithmetic or logical operation.
As a target operand of an arithmetic or logical operation.
As a the address of a memory operand (either a base register, index register, or directly). As the length of a memory operand. Other uses such as providing a function code or other information to and from an instruction.
Until the introduction of the IBM z/ Architecture mainframe in 2000, a mainframe general register consisted of 32 bits; with the introduction of z/' Architecture, a general register consisted of 64 bits, however, for compatibility reasons, many ?J Architecture instructions continue to support 32 bits.
Similarly, usher architectures, such as the x86 from Intel® for example, provide
compatibility modes such that a current machine, having, for example 32 bit registers, provide modes for instructions to access only the first 8 bits or 16 bits of the 32 bit GR.
Even in early IBM System 360 environments, 16 registers (identified by a 4 bit register field in an instruction for example) proved to be daunting to assembler programmers and compi ler designers. A moderately-size program could require several base registers to address code and data, limiting the number of registers available to hold active variables. Certain techniques have been used to address the limited number of registers:
Program design (as simple as modular programming) helped to minimize base-register overutifization.
Compilers have used techniques such as register "coloring" to manage the dynamic reassignment of registers. Base register usage can be reduced with the following:
Newer arithmetic and logical instructions with immediate constants (within the instruction). Newer instructions with relative-immediate operand addresses.
Newer instructions with long displacements. However, there remains constant register pressure when there are more live variables and addressing scope than can be accommodated by the number of registers in the CPU. z/Architecture provides three program-selectable addressing modes: 24-, 3 1 », and 64-bit addressing. However, for programs that neither require 64-bit values nor exploit 64-bit memory addressing, having 64-bit G s is of limited benefit. The f llowing disclosure describes a technique of exploiting 64-bit registers for programs that do not generally use 64-bit addressing or variables.
Within this disclosure, a convention is used where bit positions of registers are numbered in ascending order from left to right (Big Endian). In a 64-bit register, bit 0 (the leftmost bit) represents the most significant value (2 ~) and bit 63 (the rightmost bit) represents the least significant value (2°). The leftmost 32 bits of such a register (bits 0-31) are called the high word, and the rightmost 32 bits of the register (bits 32-63) are called the low word where a word is 32 bits. HIGH- WORD FACILITY
A new suite of general instructions (that is. instructions available to an application program) is introduced to exploit the high word (the most-significant 32 bits) of a 64-bit general register when the CPU is in 32 bit mode. The program can employ the new instructions to access the hidden (previously unavailable) high words of the GPR in addition to the old instructions which continue to be restricted to the low words.
Referring to FIG. 8, a program written to an architecture having 16 or 32 bit registers may be run on a newer version of the architecture supporting 64 bit registers. The program written for, say, a 32 bit mode is only aware of 32 bit registers, and typically 32 or fewer logical address bits. An Operating System (OS) 801 in a 64 bit architected computer system may support programs written for 64 bit mode 803 as well as programs written for 32 bit mode 802. A context switch operation 804 in such a machine will save 805 the 64 bit registers as well as the Program Status Word (PSW) when switching between programs and/or the operating system, independent of whether the Application program 802 803 was in 32 or 64 bit mode. Thus, a 32 bit program running in 32 bit mode on a 64 bit machine under control of a 64 bit operating system, will have its registers saved and restored during certain context switches. The computer system and operating system may actually save and restore 805 ail 64 bits of the general registers during the context switch, even though the program subject to the context switch is running in a 32 bit mode. Thus, the program, sees only half of the registers, only 32 bits of the 64 bits of each register. The other 32 bits of the impleme ted registers is "hidden" from the 32 bit program. The 32 bits of the known registers, may be used for addressing, and even though the computer system supports 64 bits of addressing, the OS can manage via Dynamic Address Translation, such that only 32 bits of address are manipulated by the 32 bit program in 32 bit mode. The 32 bit mode may be thought of as a
Sow-word mode since the program is only utilizing the lowr word (32 bit word) of a. double word (64 bit) register. An Application Program operates under control of the OS, and invokes the OS in order to have the OS perform certain functions. This "invoking" is performed by the context switch 804 that saves state of the application program and loads state 805 of the OS to be performed, where the OS begins execution at the address provided by the context switch. The OS can then invoke one of the application programs by a context switch 804 to permit the application program to run. In some applications, use of resources is supported by permitting each application, a time-slice of operation and a context switch 804 is used to "interrupt" the active program after an elapsed time in order to permit the OS to dispatch another application program for another time-slice. The availability of the High- Word facility may be controlled by a bit or a field in the machine that must be set to enable the High-Word facility. When the High Word facility is enabled, the 32 bit program can take advantage of the "hidden" part of the register by executing new "high-word facility" instructions. Other new "hi h.- word facility" instructions may be provided that provide new function to instructions using low-word registers.
In most of these instructions, only the high word of the registers is manipulated, in certain instructions, variants are provided to manipulate the high word of one source register with the low word of another source register, the result being placed in the high word of a target register (e.g., AHHLR). RISBLG provides a low-word analog to the high-word RISBHG instruction. RISBHG and RISBLG provide great flexibility in implementing a number of pseudo-instructions (with assistance from the assembler program).
As mentioned above, processor architectures employ General Purpose Registers (GPRs), available to the Instruction Set of the archi ecture. A program can take advantage of data being in the GPRs, which may be implemented in high speed memory such as embedded latches on a chip, for faster performance than having the data in slower main store, which is often implemented by complex dynamic address translation mechanisms. n some architectures such as x86 having 64 GPRs, the size of each GPR has been increased evolutionary from 8 bits to 16 bits, 32 bits and currently 64 bits. However the number of GPRs available to an instruction ((64 for x86) determined by a number of bits (6 for x86) of a GPR field within an instruction) remains the same so that programs written for an older instruction having 8 bit GPRs for example, will still run on newer architectures having 32 bit GPRs for example. Thus, a machine having 32 bit GPRs operating in 8 bit mode, will provide access to only the lower 8 bits of each 32 bit GPR. However, during a context switch, the 32 bit Operating System (OS) will always save and restore the full 32 bits of each
GPR. In an IBM z/ Architecture imp lementaticm, a machine may ha ve 16 GPRs, each GPR consisting of 64 bits (bits 0-63) but may ran an application program written for 32 bit registers in 32 bit mode. The 32 bits may be the low order 32 bits of the GPR. (bits 32-63), where the high order 32 bits ( bits 0-31 ) are not available (hidden) in a 32 bit mode of operation. The application program has no way of utilizing the high order 32 bits of the
GPRs as they are invisible to the program. The application program, in an example, may have been written for a 32 bit machine of a prior generation of the machine having only 32 bit registers and addressing 24 or 32 bits of logical addresses to memory. The 32 bit mode enables the example 32 bit application program to run on a newer machine having an architecture supporting 64 bits of GPR s, having a. 64 bit Opera ting System (OS) and supporting 64 bit applicaiion programs in 64 bit mode. In another machine architecture defined for 32 bit GPRs, a set of 32 bit "hidden GPRs'" may be provided that are invisible to application programs. A "High-Word Facility mode" is provided that enables a subset of instructions to access the hidden or High Order GPRs, while the remaining set of instructions have access to the architected or Low Order GPR.s.
Preferably, in "High-Word Facility mode", the subset of instructions may only access the High Order GPRs in one implementation, but in another implementation, the subset of instructions may define GPR field as being directed to the High Order GPRs and another GPR field as being directed to the low order GPRs.
In another preferred implementation, in "High- Word Facility mode", only Sow order GPRs can be used for generating main memory addresses.
In an implementation, applications executing in "High- Word Facility mode" can co-exist with applications not executing in "High- Word Facility mode". The applications not in High- Word Facility mode may be 32 bit GPR. applications or 64 bit GPR applications. In this example, GPRs of a machine are utilized having 64 bits with applications written for
GPRs utilizing 32 bits, however, the present embodiments would provide advantage in GPRs of a machine with any number of bits (16. 24, 32, 48, 64, 128) running applications written for GPRs having fewer number of bits (8, 16, 24, 32, 48, 64). Furthermore, High- Word Facility mode hidden registers may utilize only a designated portion of the hidden GPRs, such that, in the 32 bit application program of the previous example, the hidden registers available in High- Word Facility mode for some instructions may be the low order 8 or 1 6 bits of the high order 32 bits of the 64 bit GPRs, while other hidden registers may be the high order 8 or 1 6 bits of the high order 32 bits of the 65 bit GPRs for example. The teaching of embodiments is presented using z/Architeeture and/or x86 architecture, however, other im lernentations are readily apparent to one of average skill, in light of the teaching herein. In an. example ^/Architecture embodiment, for selected 32-bit instructions, the high-word facility effectively provides sixteen additional 32-bit registers (high word registers) by utilizing previously unavailable high order bits 0-31 of the sixteen 64-bit general registers ( bits 0-63). in an embodiment, the High-Word facility may enable the folio wing instructions with mnemonics indicating the function (AHHHR for ADD HIGH for example):
· ADD HIGH (AHHHR, AHHLR)
* ADD IMMEDIATE HIGH (AIH)
* ADD LOGICAL HIGH (ALFIHFIR, ALHHLR)
• ADD LOGICAL WITH SIGNED I MMEDIATE HIGH (ALSIH, ALSIBN)
* BRANCH RELATI VE ON COUNT H IGH (BROTH)
· COMPARE HIGH (CFIHR, CHLR, CHF)
* COMPARE IMMEDIATE HIGH (CIH)
« COMPARE LOGICA L HIGH (CLHHR, CLHLR, CLHF)
• COMPARE LOGICAL IMMEDIATE HIGH (CLIH)
• LOAD BYTE- H IG H (LBH)
* LOAD HALFWORD HIGH (LHH)
* LOAD H IGH (LFH)
• LOAD LOGICAL CHARACTER HIGH (LLCH)
* LOA D LOGICAL- HALFWORD HIGH (LLHFl)
• ROTATE THEN INSERT SELECTED BITS HIGH (RISBHG)
* ROTATE THEN INSERT SELECTED BITS LOW (RISBLG)
« STORE CHARACTER. H IG H (STCH)
• STORE. HALFWORD HIGH (STHH) • STORE HIGH (STFH)
• SUBTRACT HIGH (SHHHR, SI 11 i f R )
• SUBTRACT LOGICAL HIGH (SLHHHR, SLHITLR) The following additional general instructions may be available when the interlocked-aceess facility is installed:
• LOAD AND ADD (LAA, LAAG)
• LOAD AND ADD LOGICAL (LAAL, LAALG)
• LOAD AND AND (LAN, LANG)
* LOAD AND EXCLUSIVE OR (LAX, LAXG)
• LOAD AND OR (LAO, LAOG)
• LOAD PAIR DISJOINT (LPD, LPDG)
The following additional general instructions may be available when the load/store-on- condition fac lity is installed:
• LOAD ON CONDFUON (LOG, LGOC, LGROC, LROC)
• STORE ON CONDITION (STGC, STGOC)
The following additional general instructions may be available when the distinct-operands facility is installed:
• ADD (ARK, AGRK)
« ADD IMM EDIATE (AH IK, AGHI )
• ADD LOGICAL (ALRK, ALGRK)
• ADD LOGICAL WITH SIGNED IMMEDIATE (ALHSIK, ALGHSI )
* AN D (NRK, NGRK)
• EXCLUSIVE OR (XR . XGRK)
• OR (OR , OGR )
• SHIFT LEFT SINGLE (SLAR)
• SHIFT LEFT SINGLE LOGICAL (SLL .)
* SHIFT RIGHT SINGLE (SRAK)
« SF1IFT RIGHT SINGLE LOGICAL (SRL )
- SUBTRACT (SR , SGR ) * SUBTRACT LOGICAL (SLRK, SLGRK.)
EXAMPLE HIGH-WORD INSTRUCTIONS
The following are example instructions that may employ the High- Word facility.
ADD HIGH (RRF format)
When the instruction is executed by the computer system, the second operand is added to the third operand, and the sum is placed at the first-operand location. The operands and the sum are treated as 32-bit signed binary integers. The first and second operands are in bits 0-31 of general registers R.I and R2, respectively; bits 32-63 of general register Rl are unchanged, and bits 32-63 of general register 1 2 are ignored. For AHHHR OpCode, the third operand is in bits 0-3 lof general register R3; bits 32-63 of the register are ignored. For AHHLR OpCode, the third operand is in bits 32-63 of general register R3; bits 0- 1 of the register are ignored. When there is an overflow, the result is obtained by allowing any carry into the sign-bit position and ignoring any carry out of the sign-bit position, and condition code 3 is set. If the fixed-point-overflow mask is one, a program interruption for fixed-point overflow occurs.
Resulting Condition Code:
0 Result zero; no overflow
1 Result less than zero; no overflow
2 Result greater than zero; no overfl w
3 Overflow Program Exceptions:
• Fixed-point overflow* Operation (if the high-word facility is not installed)
ADD IMMEDI ATE HIGH (RIL format)
When the instruction is executed by the computer system, the second operand is added to the first operand, and the sum is placed at the first -operand location. The operands and the sum are treated as 32-bitsigned binary integers. The first operand is in bttsO-31 of general register Rl; bits 32-63 of the register are unchanged. When there is an overflow, the result is obtained by allowing any carry into the sigxt~b.it position, and ignoring any carry out of the sign- bit position, and condition code 3 is set. I f the fixed-point-overflow mask is one. a program interruption for fixed-point overflow occurs.
Resulting Condition Code:
0 Result, zero; no overflow
1 Result less than zero; no overflow
.2 Result greater than zero; no overflow
3 Overflow
Program Exceptions:
4 Fixed-point overflow
s Operation (if the high- ord facility is not installed) ADD LOGICAL HIGH (RRF format)
When the instruction is executed by the computer system, the second operand is added to the third operand, and the sum is placed at the first-operand location. The operands and the sum are treated as 32-bifunsigned binary integers. The first and second operands are in bits 0-31 of general registers R.i and R2, respectively; bits 32-63 of genera l register R i are unchanged, and bits 32-63 of general register R2 are ignored. For ALHHH OpCode, the third operand is in bits0-31 of general register R3; bits 32-63 of the register are ignored. For Λί I if I LK OpCode, the third operand is in bits32-63 of general register R3; bits 0-31 of the register are ignored.
Resulting Condition Code:
0 Result zero; no carry
1 Result not zero; no carry
2 Result zero; carry
3 Result not zero; carry
Program Inceptions:
* Operation (if the high- ord facility is not installed) ADD LOGICAL. WITH SIGNED IMMEDIATE HIGH (RIL formal)
When the instruction is executed by the computer system, the second operand is added to the first operand, and the sum is placed at the first-operand location. The first operand and the sum are treated as 32-bitunsigned binary integers. The second operand is treated as a 32- bit signed binary integer. The first operand is in bits 0-31 of general register Rl ; bits32-63 of the register are unchanged.
Resulting Condition Code:
For ALSIH, the code is set as follows:
0 Result zero; no carry
1 Result not zero; no cany
2 Result zero; carry
3 Result not zero; carry
For ALSIHN, the code remains unchanged.
Program Exceptions:
• Operation (if the high-word facility is not installed)
BRANCH RELATIVE ON COUNT HIGH (Rl, RIL format)
When the instruction is executed by the computer system, A one is subtracted from the first operand, and the result is placed at the first-operand location. For BRANCH RELATIVE ON COUNT (BRCT OpCode), the first operand and result are treated as 32-bit binary integers in bits 32-63 of general register Rl, with overflow ignored; bits 0-31 of the register are unchanged. For BRANCH RELATIVE ON COUNT HIGH (BRCTH OpCode), the first operand and result are treated as 32-bitbinary integers in bits 0-31 of general register Rl, with overflow ignored; bits 32-63 of the register are unchanged. For BRANCH RELATIVE ON COUNT (BRCTG OpCode), the first operand and result are treated as64-bit binary integers, with overflow ignored. When the result Is zero, normal instruction sequencing proceeds with the updated instruction address. When the result is not zero, the instruction address in the current PSW is replaced by the branch address. The contents of the 12 field are a signed binary integer specifying the number of halfwords that is added to the address of the instruction to generate the branch address. Condition Code: The code remains unchanged.
Pro gram Exe eptions :
* Operation (BRCTH, if the high-word facility is not installed)
Programming Notes:
1. The operation is the same as that of the BRANCH ON COUNT instruction except for the means of specifying the branch address.
2. The first operand and result can be considered as either signed or unsigned binary integers since the result of a binary subtraction is the same in both cases.
3. An initial count of one results in zero, and no branching takes place; an initial count of zero results in -1 and causes branching to be executed; an initial count of -1 results in -2 and causes branching to be executed; and so on. In a loop, branching takes place each time the instruction is executed nti 1 the result is again zero.
Note that .for BR.CT, because of the number range, an initial count of -231 results in a positive value of 231 - I, or, for BRCTG„ an initial count of-263 results in a positive value of 263 - 1.4. When the instruction is the target of an execute type instruction, the branch is relative to the target address;
COMPARE HIGH ( RRE, RXY format), COMPARE IMMEDIATE HIGH (RIL format)
When the instruction is executed by the computer system, the first operand is compared with the second operand, and the result is indicated in the condition code. 'The operands are treated as 32-bit signed binary in tegers. The first operand is in bit positions 0-31 of general register R 1 ; bit positions 32-63 of the register are ignored. For COMPARE HIGH (CHHR OpCode), the second operand is in bit positions 0-31 of general register 2; bit positions 32- 63 of the register are ignored. For COMPARE HIGH (CHLR OpCode), the second operand is in bit positions 32-63 of general register R2; bit positionsQ-31 of the register are ignored.
The displacement for CHF is treated as a 20-bitsigned binary integer. Resulting Condition Code:
0 Operands equal
1 First operand low
2 First operand high
3
Program Exceptions:
* Access (operand 2 of CHF only)
» Operation (if the high-word facility is not installed)
COMPARE LOGICAL HIGH (RRE, RXY format), COMPARE LOGICAL IMMEDIATE HIGH (RIL format)
When the instruction is executed by the computer system, the first operand is compared with the second operand, and the result is indicated in the condition code. The operands are treated as 32-bit unsigned binary integers. The first operand is in bit positions 0-3.1 of general register III; bit positions 32-63 of the register are ignored. For COMPARE
LOGICAL HIGH (CLHHR OpCode), the second operand is In bit positions 0-31 of general register R2; bit positions 32-63 of the register are ignored. For CO MPARE LOGICAL H IGH (CLHLR OpCode), the second operand is in bit positions32~63 of general register R2; bit positions 0-31 of the register are ignored. The dispiacement for CLHF is treated as a 20- bitsigned binary integer.
Resulting Condition Code:
0 Operands equal
1 First operand low
2 First operand high
Program Exception s :
4 Access (operand 2 of CLHF only)
• Operation (if the high-word facility is not installed) LOAD BYTE HIGH (RXY format)
When the instruction is executed by the computer system, the second operand is sign extended and placed at the first-operand location. The second operand is one byte in length and is treated as an eight-bit signed binary integer. The first operand is treated as a 32-bit signed binary integer in bits 0-31 of general register Rl; bits 32-63of the register are unchanged. The displacement is treated as a 20-bit signed binary integer.
Condition Code: The code remains unchanged.
Pro gram Exception s :
* Access (fetch, operand 2)
4 Operation (if the high- word facility is not installed) LOAD HALFWORD HIGH (RXY format)
When the instruction is executed by the computer system, the second operand is sign extended and placed at the first-operand location. The second operand is two bytes in length and is treated as an 16-bit signed binary integer. The first operand is treated as a 32-bit signed binary integer in bits 0-3 1 of general register R 1; bits 32-63of the register are unchanged. The displacement is treated as a 20-bit signed binary integer.
Condition Code: The code remains unchanged.
Program Exceptions:
* Access (fetch, operand 2)
* Operation (if the high-word facility is not installed) LOAD HIGH (RXY format)
When the instruction is executed by the computer system, the second operand is placed unchanged at the first operand location. The second operand is 32 bits, and the first operand is in bits 0-31 of general register Rl;bits 32-63 of the register are unchanged . The displacement is treated as a 20-bit signed binary integer. Condition Code: The code remains unchanged.
Program Exceptions:
s Access (fetch, operand 2)
* Operation (if the high-word facility is not installed) LOAD LOGICAL CHARACTER HIGH (RXY format)
When the instruction is executed by the computer system, the one-byte second operand is placed in bit positions24-31 of general register Rl, and zeros are placed in bit positions 0-23 of general register Rl; bit positions 32-63 of general register Rl are unchanged. The displacement is treated as a 20-bit signed binary integer.
Condition C ode: The code remains unchanged.
Program Exception s :
* Access (fetch, operand 2)
* Operation (if the high-word facility is not installed) LOAD LOGICAL HALF WORD HIGH (RXY format)
When the instruction is executed by the computer system, the two-byte second operand is placed in bit positions 16-31 of general register Rl, and zeros are placed in bit positions 0-15 of general register Rl; bit positions 32-63 of general register Rl are unchanged. The displacement is treated as a 20-bit signed binary integer.
Condition Code: The code remains unchanged.
Program Exceptions:
* Access (fetch, operand 2)
* Operation (if the high-word facility is not installed)
ROTATE THEN INSERT SELECTED BITS HIGH (HIE format), ROTATE THEN INSERT SELECTED BITS LOW (RIE format) When the instruction is executed by the computer system, the 64-bit second operand is rotated left by the number of bits specified in the fifth operand. Each bit shifted out of the leftmost bit position of the operand reenters in the rightmost bit position of the operand. The selected bits of the rotated second operand replace the contents of the corresponding bit positions of the first operand. For ROTATE THEN INSERT SELECTED BITS HIGH, the first operand is in bits 0-31 of general register Rl,and bits 32-63 of the register are unchanged. For ROTATE THEN INSERT SELECTED BITS LOW, the first operand is in bits 32-63 of general register Rl,and bits 0-31 of the register are unchanged. The second operand remains unchanged in general register R2. For ROTATE THEN INSERT
SELECTED BITS HIGH, bits 3-7 of the 13 and 14 fields (bits 19-23 and 27-31 of the instruction, respectively), with a binary zero appended on the left of each, form six-bit unsigned binary integers specifying the starting and ending bit positions (inclusive) of the selected range of bits in the first operand and in the second operand after rotation. When the ending bit position is less than the starting bit position, the range of selected bits wraps around from bit 31 to bit 0. Thus, the starting and ending bit positions of the selected range of bits are always between 0 and 31. For ROTATE THEN INSERT SELECTED BITS LOW, bits 3-7 of the 13 and 14 fields, with a binary one appended on the left of each, form six-bit unsigned binary integers specifying the starting and ending bit positions (inclusive) of the selected range of bits in the first operand and in the second operand after rotation. When the ending bit position is less than the starting bit position, the range of selected bits wraps around from bit 63 to bit 32. Thus, the starting and ending bit positions of the selected range of bits are always between 32 and 63.Bits 2-7 of the 15 field (bits 34-39 of the instruction) contain an unsigned binary integer specifying the number of bits that the second operand is rotated to the left. Bit 0 of the 14 field (bit 24 of the instruction) contains the zero-remaining- bits control (Z). The Z bit control show the remaining bits of the first operand are set(that is, those bits, if any, that are outside of the specified range). When the Z bit is zero, the remaining bits of the first operand are unchanged. When the Z bit is one, the remaining bits of the first operand are set to zeros. The immediate fields just described are as follows: Bits 0-2 of the 13 field and bits 1-2 of the 14 field (bits 16- 19 and 25-26 of the instruction) are reserved and should contain zeros; otherwise, the program may not operate compatibly in the future. Bits 0-1 of the 15 field (bits 32-33 of the instruction) are ignored. Condition Code: The code remains unchanged
Program Exceptions:
• Operation (if the high-word facility is not installed)
Programm ing N otes :
1. Although the bits 2-7 of the 15 field are defined to contain an u signed binary integer specifying the number of bits that the second operand is rotated to the left, a negative value may be coded which effectively specifies a rotate-right amount.
2. The first operand is always used in its un-rotated form. When the R 1 and R2 fields designate the same register, the value contained in the register is first rotated, and then the selected bits of the rotated value are inserted into the corresponding bits of the un-rotated register contents.
3. In the assembler syntax, the 15 operand containing the rotate amount is considered to be optional. When the 15 field is not coded, a rotate amount of zero is implied.
4. The 14 field contains both the zero-remaining- bits control (in bit 0) and the ending hit position value(m bits 2-7). For example, to insert bits 40-43 of register 7 into the
corresponding bits of register 5 (no rotation) and zero the remaining bits in the right half of register 5, the programmer might code: The Χ'80' represents the zero-rernainmg-bits control which is added to the ending-bit position to form the 14 field. The high-level assembler (HLASM) provides alternative mnemonics for the zero -remaining bits versions of RJSBHG and RJSBLG in the form of RJSBHGZ and R ISBLHZ, respectively. The "Z" suffix to the mnemonic indicates that the specifiedM field is ORed with a value of X'80' when generating the object code. An equivalent to the example shown above using the Z-suffixed mnemonic is as follows:
5. On some models, improved performance of R!SBHG and RJSBLG may be realized by setting the zero-remaining-bits control to one (or using the Z mnemonic suffix).
6. Unlike ROTATE THEN INSERT SELECT EDBITS which sets the condition code, ROTATETHEN INSERT SELECTED BITS HIGH and ROTATE THEN I NSERT
SELECTED BITS LOWT do not set the condition code. STORE CHARACTER HIGH (RXY format)
When the instruction is executed by the computer system, Bits 24-31 of general register Rl are placed unchanged at the second-operand location. The second operand is one byte in length. The displacement is treated as a 20-bit signed binary integer.
Condition Code: The code remains unchanged.
Program Exceptions:
» Access (store, operand 2) · Operation (if the high-word facility is not installed) STORE HALF WORD HIGH (RXY format)
When the instruction is executed by the computer system. Bits 16-31 of general register Rl are placed unchanged at the second-operand location. The second operand is two bytes in length. The displacement is treated as a 20-bit signed binary integer.
Condition Code: The code remains unchanged.
Program Exceptions:
* Access (store, operand 2)
* Operation (if the high-word facility is not installed) STORE H IGH (RXY format)
When the instruction is executed by the computer system, the first operand is placed unchanged at the second operand location. The first operand is in bits 0-31 of general register Rl, and the second operand is 32bits in storage. The displacement is treated as a 20- bit signed binary integer.
Condition Code: The code remains unchanged.
Program Exceptions:
* Access (store, operand 2)
* Operation (if the high- ord facility is not installed) SUBTRACT HIGH (RRF format)
When the instruction is executed by the computer system, the third operand is subtracted from the second operand, and the difference is placed at the first operand location. The operands and the difference are treated as 32-bit signed binary integers. The first and second operands are in bits 0-31 of general registers Rl and R2, respectively; bits 32-63of general register Rl are unchanged, and bits 32-63of general register R2 are ignored. For SHHHR OpCode, the third operand is in bits 0-31 of general register R3;bits 32-63 of the register are ignored. For SHHLR OpCode, the third operand is in bits 32-63 of general registerR3; bits 0-31 of the register are ignored. When there is an overflow, the result is obtained by allowing any carry into the sign-bit position and ignoring any carry out of the sign-bit position, and condition code 3 is set. If the fixed-point-overflow mask is one, a program interruption for fixed-point overflow occurs.
Resulting Condition Code:
0 Result zero; no overflow
1 Result less than zero; no overflow
2 Result greater than zero; no overflow
3 Overflow
Program Exception s :
4 Fixed-point overflow
• Operation (if the high-word facility is not installed) SUBTRACT LOGICAL H IGH (RRF format)
When the instruction is executed by the computer system, the third operand is subtracted from the second operand, and the difference is placed at the first operand location. The operands and the difference are treated as 32-bit unsigned binary integers. The first and second operands are in bits 0-31 of general registers Rl and R2, respectively; bits 32-63of general register Rl are unchanged, and bits 32-63of general register R2 are ignored. For SLHHHR OpCode, the third operand is in bits 0-31 of general register R3;bits 32-63 of the register are ignored. For SLHHLR OpCode, the third operand is in bits 32-63 of general registerR3; bits 0-31 of the register are ignored. Resulting Condition Code:
0
1 Result not zero; borrow
2 Result zero; no borr w
3 Result not zero; no borrow
Program Exceptions:
• Operation (if the high-word facility is not installed)
Referring to FIG. 6, an example General Purpose Register (GPR) is shown having 16 GPRs (each GPR comprising bits 32-63 in Small GPR mode and bits 0-63 in Large GPR mode). The effective number of General Purpose Registers (GPRs) available to instructions of a program may be extended in a computer ha ving a first number (16 ) of large GPRs, each instruction comprising an opcode and one or more GPR fields for specifying corresponding GPRs, each large GPR consisting of a first portion (31 -63 ) and a second portion (0- 1 ). Referring to FIG. 7 A, a computer in fetches instructions for execution comprising instructions from either First Set 701, a Second Set 702 or a Third Set 710. The First Set only accessing a first portion of any GPR, the Second Set accessing a second portion of any GPR, the Third Set accessing the whole GPR, including the first portion and the second portion. When 703 the computer is in a small GPR mode, for example, and is executing instructions of the first set of instructions 707 for accessing first portions, the execution comprising 708 generating memory addresses for accessing memory operands based on said small GPRs or accessing small GPR operands, wherein each of said small GPRs consists of said first portion 707. when 703 the computer is in a small GPR. mode, when 705 the computer is executing High- Word instructions, executing instructions 706 of a second set of instructions, the second set of instructions for accessing instruction specified second portions, wherein 708 the execution comprises generating memory addresses for accessing memory operands based on said small GPRs or accessing small GPR operands, wherein said small GPR consists of said instruction specified second portion. When 704 the computer is in a large GPR mode wherein each large GPR consists of the first portion and the second portion, the computer executes instructions of the third set of instructions, the execution comprising generating memory addresses for accessing memory operands based on said large GPRs or accessing large GPR operands, wherein each of said large GPR consists of said first portion and said second portion.
Responsive to the computer being in a smal l GPR mode the computer may generate 70 ) an operation exception responsive to executing instructions of the second set of instructions.
As shown in FIG. 7B, the execution of the instruction of the second instruction set may- perform 751 a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consisting of an ADD of two operands function, a COMPARE of two operands function or an OR of two operands function 752.
The execution of the instruction of the second instruction set may perform a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consists of a LOAD and operand from memory function or a STORE an operand to memory function 753.
The execution of the instruction of the second instruction set may perform a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function is a ROTATE THEN INSERT SELECTED BITS function comprising rotating a source operand by an instruction specified amount, then inserting a selected portion of the rotated source operand in a selected portion of a target operand 704.
While the preferred embodiments have been illustrated and described herein, it is to be understood that the embodiments are not limited to the precise construction herein disclosed, and the right is reserved to al l changes and modifications coming within the scope of the invention as defined i the appended claims.

Claims

1. A computer implemented method for extending an effect ve number of General Purpose Registers (GPRs; available to instructions of a program in a computer having a first number of large GPRs, each instruction comprising an opcode and one or more GPR fields for specifying corresponding GPRs, each large GPR comprising a first portion and a second portion, said large GPRs comprising first small GPRs consisting of first portions and second smah GPRs consisting of second portions, the method comprising:
responsive to the computer being in a small GPR mode; executing instructions of a first set of instructions, the first set of instructions for accessing said first small GPRs, the execution comprising generating memory addresses for accessing memory operands based on said first small GPRs or accessing first small GPR operands, wherein the first small GPRs consist of said first portions; and executing instructions of a second set of instructions, the second set of instructions for accessing said second small GPRs, the execution comprising generating memory addresses for accessing memory operands based on said second smal l
GPRs or accessing second small GPR operands, wherein the second small GPRs consist of said second portions; and
responsive to the computer being in a large GPR mode, executing instructions of a third set of instructions, the execution comprising generating memory addresses for accessing memory operands based on said large GPRs or accessing large GPR operands comprising said first portions and said second portions.
2. The method according to Claim 1, the small GPR mode comprising being in one of a 24 bit addressing mode or a 3.1 bit addressing mode.
3. The method according to Claim 1 or Claim 2, wherein the first portion is 32 bits and the second portion is 32 bits.
4. The method according to any preceding claim, wherein the execution of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode deimed function consisting of n ADD of two operands function or a COMPARE of two operands function.
5. The method according to any of claims .1 to 3, wherein the execution of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function consists of a LOAD of an operand from memory function or a. STORE of an operand to memory function.
6. The method according to any of claims 1 to 3, wherein the execution of the instruction of the second instruction set comprises performing a corresponding opcode defined function based on two operands, and storing the result, the corresponding opcode defined function is a ROTATE THEN INSERT SELECTED BITS function comprising: rotating a source operand by an instruction specified amount; and
inserting a selected portion of the rotated source operand in a selected portion of a target operand.
7. The method according to Claim 2, comprising supporting an Operating System operating in Large GPR mode wherein the Large GPRs are saved and restored during context switches for Applications running in Smal l G PR mode.
8. The method according to Claim 7, wherein the third set of instructions comprise the first set of instmctions and the second set of instructions.
9. A computer program product for extending an effective number of General Purpose Registers (GPRs) a vailable to instructions of a. program in a computer ha ving a first number of large GPRs, each instruction comprising an opcode and one or more GPR fields for specifying corresponding GPRs, each large GPR comprising a first portion and a second portion, said large GPRs comprising first small GPRs consisting of first portions and second small GPRs consisting of second portions, the computer program product comprising a tangible storage medium readable by a processing circuit and storing instructions which. when executed by the processing circuit perform the method according to any of claims 1 to
8.
10. A computer system for extending an effective num ber of General Purpose Registers (GPRs) available to instructions of a program in a computer having a first number of large GPRs, each instruction comprising an opcode and one or more GPR fields for specifying corresponding GPRs, each large GPR comprising a first portion and a second portion, said large GPR s comprising first small G PRs consisting of first portions and second small G PRs consisting of second portions, comprising:
a memory;
a processor in communication with the memory, the processor comprising an instruction fetching element for fetching instructions from memory and one or more execution elements for executing fetched instructions;
wherein the computer system is configured to perform the method according to any of claims I to 8.
PCT/EP2010/067048 2010-06-22 2010-11-08 Extending the number of general purpose registers available to instructions WO2011160726A1 (en)

Priority Applications (8)

Application Number Priority Date Filing Date Title
CA2786049A CA2786049C (en) 2010-06-22 2010-11-08 Extending the number of general purpose registers available to instructions
MX2012014533A MX2012014533A (en) 2010-06-22 2010-11-08 Extending the number of general purpose registers available to instructions.
AU2010355817A AU2010355817B2 (en) 2010-06-22 2010-11-08 Extending the number of general purpose registers available to instructions
RU2012149004/08A RU2562430C2 (en) 2010-06-22 2010-11-08 Increasing number of general purpose registers available to instructions
SG2012087284A SG186078A1 (en) 2010-06-22 2010-11-08 Extending the number of general purpose registers available to instructions
EP10776353A EP2430521A1 (en) 2010-06-22 2010-11-08 Extending the number of general purpose registers available to instructions
IL223587A IL223587A (en) 2010-06-22 2012-12-12 Extending the number of general purpose registers available to instructions
ZA2012/09644A ZA201209644B (en) 2010-06-22 2012-12-19 Extending the number of general purpose registers available to instructions

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US12/820,735 2010-06-22
US12/820,735 US8914619B2 (en) 2010-06-22 2010-06-22 High-word facility for extending the number of general purpose registers available to instructions

Publications (1)

Publication Number Publication Date
WO2011160726A1 true WO2011160726A1 (en) 2011-12-29

Family

ID=43334493

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2010/067048 WO2011160726A1 (en) 2010-06-22 2010-11-08 Extending the number of general purpose registers available to instructions

Country Status (14)

Country Link
US (2) US8914619B2 (en)
EP (1) EP2430521A1 (en)
JP (2) JP5379825B2 (en)
KR (1) KR101464808B1 (en)
CN (1) CN102314333A (en)
AU (1) AU2010355817B2 (en)
BR (1) BRPI1103516B1 (en)
CA (1) CA2786049C (en)
IL (1) IL223587A (en)
MX (1) MX2012014533A (en)
RU (1) RU2562430C2 (en)
SG (1) SG186078A1 (en)
WO (1) WO2011160726A1 (en)
ZA (1) ZA201209644B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2550558C2 (en) * 2012-06-15 2015-05-10 Интернэшнл Бизнес Машинз Корпорейшн Comparing and replacing dynamic address translation table entry

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8914619B2 (en) 2010-06-22 2014-12-16 International Business Machines Corporation High-word facility for extending the number of general purpose registers available to instructions
US8615645B2 (en) 2010-06-23 2013-12-24 International Business Machines Corporation Controlling the selectively setting of operational parameters for an adapter
US8468284B2 (en) 2010-06-23 2013-06-18 International Business Machines Corporation Converting a message signaled interruption into an I/O adapter event notification to a guest operating system
US8572635B2 (en) 2010-06-23 2013-10-29 International Business Machines Corporation Converting a message signaled interruption into an I/O adapter event notification
US8635430B2 (en) 2010-06-23 2014-01-21 International Business Machines Corporation Translation of input/output addresses to memory addresses
US9696975B2 (en) * 2010-09-03 2017-07-04 International Business Machines Corporation Allocating register halves independently
US9317285B2 (en) * 2012-04-30 2016-04-19 Apple Inc. Instruction set architecture mode dependent sub-size access of register with associated status indication
US9639369B2 (en) 2013-11-11 2017-05-02 Apple Inc. Split register file for operands of different sizes
US10671391B2 (en) * 2014-02-25 2020-06-02 MIPS Tech, LLC Modeless instruction execution with 64/32-bit addressing
US20150293767A1 (en) * 2014-04-11 2015-10-15 Fujitsu Limited Rotating register file with bit expansion support
WO2016034087A1 (en) * 2014-09-03 2016-03-10 Mediatek Inc. Method for handling mode switching with less unnecessary register data access and related non-transitory machine readable medium
CN107145334B (en) * 2017-04-26 2020-10-09 龙芯中科技术有限公司 Constant acquisition method, device, processor and computer readable storage medium
WO2022067510A1 (en) * 2020-09-29 2022-04-07 华为技术有限公司 Processor, processing method, and related device
US12014198B2 (en) 2021-03-25 2024-06-18 International Business Machines Corporation Running smaller memory-address width program code in a larger memory-address width address space

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5551013A (en) 1994-06-03 1996-08-27 International Business Machines Corporation Multiprocessor for hardware emulation
US5574873A (en) 1993-05-07 1996-11-12 Apple Computer, Inc. Decoding guest instruction to directly access emulation routines that emulate the guest instructions
WO1998012627A1 (en) * 1996-09-23 1998-03-26 Arm Limited Input operand control in data processing systems
US5790825A (en) 1995-11-08 1998-08-04 Apple Computer, Inc. Method for emulating guest instructions on a host computer through dynamic recompilation of host instructions
US6009261A (en) 1997-12-16 1999-12-28 International Business Machines Corporation Preprocessing of stored target routines for emulating incompatible instructions on a target processor
US6308255B1 (en) 1998-05-26 2001-10-23 Advanced Micro Devices, Inc. Symmetrical multiprocessing bus and chipset used for coprocessor support allowing non-native code to run in a system
US6463582B1 (en) 1998-10-21 2002-10-08 Fujitsu Limited Dynamic optimizing object code translator for architecture emulation and dynamic optimizing object code translation method
US20090249039A1 (en) 1997-10-09 2009-10-01 Mips Technologies, Inc. Providing Extended Precision in SIMD Vector Arithmetic Operations

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3432532B2 (en) * 1992-08-03 2003-08-04 株式会社日立製作所 Data processing device
JP2686011B2 (en) * 1992-01-27 1997-12-08 富士通株式会社 Register controller
US5546557A (en) 1993-06-14 1996-08-13 International Business Machines Corporation System for storing and managing plural logical volumes in each of several physical volumes including automatically creating logical volumes in peripheral data storage subsystem
US5751614A (en) 1994-03-08 1998-05-12 Exponential Technology, Inc. Sign-extension merge/mask, rotate/shift, and boolean operations executed in a vectored mux on an ALU
GB2289353B (en) * 1994-05-03 1997-08-27 Advanced Risc Mach Ltd Data processing with multiple instruction sets
TW364976B (en) 1996-09-23 1999-07-21 Arm Corp Input operand control in data processing systems
TW343318B (en) * 1996-09-23 1998-10-21 Advanced Risc Mach Ltd Register addressing in a data processing apparatus
US5838960A (en) 1996-09-26 1998-11-17 Bay Networks, Inc. Apparatus for performing an atomic add instructions
US6343356B1 (en) * 1998-10-09 2002-01-29 Bops, Inc. Methods and apparatus for dynamic instruction controlled reconfiguration register file with extended precision
US6857061B1 (en) * 2000-04-07 2005-02-15 Nintendo Co., Ltd. Method and apparatus for obtaining a scalar value directly from a vector register
US6877084B1 (en) * 2000-08-09 2005-04-05 Advanced Micro Devices, Inc. Central processing unit (CPU) accessing an extended register set in an extended register mode
JP3659252B2 (en) 2003-03-28 2005-06-15 セイコーエプソン株式会社 Vector data address reference method and vector processor
US7284092B2 (en) 2004-06-24 2007-10-16 International Business Machines Corporation Digital data processing apparatus having multi-level register file
US7627723B1 (en) 2006-09-21 2009-12-01 Nvidia Corporation Atomic memory operators in a parallel processor
US7840783B1 (en) * 2007-09-10 2010-11-23 Netlogic Microsystems, Inc. System and method for performing a register renaming operation utilizing hardware which is capable of operating in at least two modes utilizing registers of multiple widths
US8694758B2 (en) 2007-12-27 2014-04-08 Intel Corporation Mixing instructions with different register sizes
US20090182982A1 (en) * 2008-01-11 2009-07-16 International Business Machines Corporation Rotate Then Insert Selected Bits Facility and Instructions Therefore
US20090182983A1 (en) * 2008-01-11 2009-07-16 International Business Machines Corporation Compare and Branch Facility and Instruction Therefore
US7877582B2 (en) * 2008-01-31 2011-01-25 International Business Machines Corporation Multi-addressable register file
US20100100692A1 (en) 2008-10-21 2010-04-22 International Business Machines Corporation Exploiting Register High-Words
US8386754B2 (en) * 2009-06-24 2013-02-26 Arm Limited Renaming wide register source operand with plural short register source operands for select instructions to detect dependency fast with existing mechanism
US8850166B2 (en) 2010-02-18 2014-09-30 International Business Machines Corporation Load pair disjoint facility and instruction therefore
US8438340B2 (en) 2010-02-18 2013-05-07 International Business Machines Corporation Executing atomic store disjoint instructions
US8914619B2 (en) 2010-06-22 2014-12-16 International Business Machines Corporation High-word facility for extending the number of general purpose registers available to instructions

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5574873A (en) 1993-05-07 1996-11-12 Apple Computer, Inc. Decoding guest instruction to directly access emulation routines that emulate the guest instructions
US5551013A (en) 1994-06-03 1996-08-27 International Business Machines Corporation Multiprocessor for hardware emulation
US5790825A (en) 1995-11-08 1998-08-04 Apple Computer, Inc. Method for emulating guest instructions on a host computer through dynamic recompilation of host instructions
WO1998012627A1 (en) * 1996-09-23 1998-03-26 Arm Limited Input operand control in data processing systems
US20090249039A1 (en) 1997-10-09 2009-10-01 Mips Technologies, Inc. Providing Extended Precision in SIMD Vector Arithmetic Operations
US6009261A (en) 1997-12-16 1999-12-28 International Business Machines Corporation Preprocessing of stored target routines for emulating incompatible instructions on a target processor
US6308255B1 (en) 1998-05-26 2001-10-23 Advanced Micro Devices, Inc. Symmetrical multiprocessing bus and chipset used for coprocessor support allowing non-native code to run in a system
US6463582B1 (en) 1998-10-21 2002-10-08 Fujitsu Limited Dynamic optimizing object code translator for architecture emulation and dynamic optimizing object code translation method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"M80C286 High Performance CHMOS Microprocessor with Memory Management and Protection", 1 February 1990 (1990-02-01), pages 1 - 4,50, XP002615297, Retrieved from the Internet <URL:http://datasheets.chipdb.org/Intel/x86/286/datashts/intel_M80C286.pdf> [retrieved on 20101221] *
"z/Architecture Principles of Operation, SA22-7832-07", February 2009, INTERNATIONAL BUSINESS MACHINES CORPORATION, N. Y. USA, XP002615296 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2550558C2 (en) * 2012-06-15 2015-05-10 Интернэшнл Бизнес Машинз Корпорейшн Comparing and replacing dynamic address translation table entry

Also Published As

Publication number Publication date
US20110314260A1 (en) 2011-12-22
RU2562430C2 (en) 2015-09-10
JP2013242918A (en) 2013-12-05
MX2012014533A (en) 2013-01-29
CA2786049A1 (en) 2011-12-29
IL223587A (en) 2017-07-31
JP5657074B2 (en) 2015-01-21
JP2012009020A (en) 2012-01-12
BRPI1103516B1 (en) 2021-01-12
SG186078A1 (en) 2013-01-30
US8914619B2 (en) 2014-12-16
ZA201209644B (en) 2013-08-28
RU2012149004A (en) 2014-05-27
CN102314333A (en) 2012-01-11
KR101464808B1 (en) 2014-11-27
BRPI1103516A2 (en) 2016-05-17
AU2010355817B2 (en) 2014-04-03
US20130117545A1 (en) 2013-05-09
AU2010355817A1 (en) 2012-07-05
US9459872B2 (en) 2016-10-04
JP5379825B2 (en) 2013-12-25
CA2786049C (en) 2018-02-13
KR20110139098A (en) 2011-12-28
EP2430521A1 (en) 2012-03-21

Similar Documents

Publication Publication Date Title
US9135004B2 (en) Rotate then operate on selected bits facility and instructions therefor
US9459872B2 (en) High-word facility for extending the number of general purpose registers available to instructions
US9250904B2 (en) Modify and execute sequential instruction facility and instructions therefor
US7870339B2 (en) Extract cache attribute facility and instruction therefore
US20110314263A1 (en) Instructions for performing an operation on two operands and subsequently storing an original value of operand
US20090182983A1 (en) Compare and Branch Facility and Instruction Therefore
US10963391B2 (en) Extract target cache attribute facility and instruction therefor
US20090182988A1 (en) Compare Relative Long Facility and Instructions Therefore
US20090182984A1 (en) Execute Relative Long Facility and Instructions Therefore
US20090182992A1 (en) Load Relative and Store Relative Facility and Instructions Therefore
US20090182985A1 (en) Move Facility and Instructions Therefore
US20090182982A1 (en) Rotate Then Insert Selected Bits Facility and Instructions Therefore

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 2010776353

Country of ref document: EP

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10776353

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2010355817

Country of ref document: AU

ENP Entry into the national phase

Ref document number: 2786049

Country of ref document: CA

ENP Entry into the national phase

Ref document number: 2010355817

Country of ref document: AU

Date of ref document: 20101108

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2012149004

Country of ref document: RU

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 223587

Country of ref document: IL

WWE Wipo information: entry into national phase

Ref document number: MX/A/2012/014533

Country of ref document: MX

NENP Non-entry into the national phase

Ref country code: DE