Backward-compatible computer architecture with extended word size and address space

Abstract

A technique for extending the data word size and the virtual address space of a pre-existing architecture so that hardware for the extended architecture also supports the pre-existing architecture. Extension of the data word size from m bits to N bits entails widening the machine registers and data paths from m bits to N bits and sign-extending entities of m or fewer bits to N bits when they are loaded into registers. Some of the m-bit instructions, when operating on N-bit sign-extended versions of m-bit entities, produce an N-bit result that may not correspond to the correct m-bit result, sign-extended to N bits. For these instructions compatibility requires that the instructions be further defined to guarantee a sign-extended result. This means that separate N-bit instructions corresponding to these m-bit instructions are needed. The support for up to an N-bit virtual address space is provided in part by widening the virtual address data paths. The extended architecture supports the m-bit architecture's addressing with minimal additional hardware. This is made possible by storing m-bit addresses as N-bit entities in sign-extended form and requiring that the results of address computations on these entities be in sign-extended form.

Description

BACKGROUND OF THE INVENTION

The invention relates generally to computer architectures and more specifically to a technique for extending an instruction set architecture to have a larger word size and address space.

The largest programs have been growing their address space needs at approximately one-half to one bit per year. Very soon, a 32-bit address space will be inadequate for these programs, just as 16-bit addressing became inadequate in the 1970's. An example of this phenomenon was the IBM/370 which implemented 31-bit addressing because the 24-bit addressing on the IBM/360 was found to be inadequate.

Computer manufacturers have tended to make the transition to a larger address space in their new computers by moving to new instruction sets. Moving to a new instruction set is a step having potentially disastrous consequences, both for the user and the manufacturer. From the user's point of view, this means that programs written for the old machine won't run on the new machine. The user who has made a substantial investment in software is faced with the equally unpleasant prospects of either paying to convert or replace the software or foregoing the advantages of the various advances embodied in the new machine. From the manufacturer's point of view, such a move is likely to result in user resentment and initially slow sales of the new machine.

Some designers have used a technique called segmentation to extend their instruction sets. A number of 32-bit architectures have already defined a segmentation scheme for extending their address spaces. Examples are IBM-370 (ESA mode), IBM POWER and HP Precision.

While segmentation has been widely used, as for example on the Intel 80286 microprocessor, it has been less than satisfactory. With few exceptions, such as the Multics system on GE-Honeywell hardware, segmentation has proved to be inefficient and programmer visible. Full addresses become multi-word objects, which require multiple instructions and/or cycles to access and compute with. Even then, most segmentation schemes did not allow access to a single data object larger than the segment size, which is one of the primary uses for larger address space in the first place.

Another technique that has been used is to implement both the old (e.g. 16-bit) architecture and a new (e.g. 32-bit) architecture on the same hardware. For example, the DEC VAX 11/780 had a mode where it could execute PDP-11 programs, with some limitations. This technique is primarily applicable to microcoded implementations, where the old architecture is simply implemented as additional microcode. In hardwired implementations, the designer may be forced to implement essentially two CPUs, or at least a much more complex one, whose complexity may harm performance significantly. Either approach is likely to consume significant chip die area, which is an important consideration for single-chip implementations.

In any event, the compatibility mode can be costly, especially if the new and old architectures are different in ways beyond address size. This makes the compatibility mode excess baggage to carried along and later dropped. It is noted that later members of the VAX family did not support PDP-11 emulation.

SUMMARY OF THE INVENTION

The present invention provides efficient techniques for extending a pre-existing architecture in a manner that hardware for the extended architecture also supports the pre-existing architecture. This backward compatibility requires a minimal amount of additional hardware and is achieved with minimal penalty in operating speed. In addition, the programming model for the extended architecture is a simple extension, not a radical change requiring massive software redesign.

The data word size for integer operations is extended from m bits to N bits by widening the machine registers and data paths from m bits to N bits and sign-extending entities of m or fewer bits to N bits when they are loaded into registers. In this context, the term "sign-extending" means writing the most significant bit (the sign bit) of the m-bit entity into the (N-m) most significant bit positions (otherwise undefined) of the N-bit container.

A first subset of the extended architecture instruction set includes the instructions from the previous architecture. These instructions, called m-bit instructions, are redefined to operate on N-bit entities, which may be N-bit sign-extended versions of m-bit (or smaller) entities. For compatibility, the m-bit instructions, when operating on N-bit sign-extended versions of m-bit entities, must produce an N-bit result that is the N-bit sign-extended version of the correct m-bit result.

A second subset includes instructions that are not defined in the previous architecture. These instructions, called N-bit instructions, operate on N-bit entities that are generally not sign-extended versions of m-bit entities. Whether a separate N-bit instruction is required depends on the operation of the corresponding m-bit instruction on sign-extended entities and entities that are not sign-extended.

Some of the m-bit instructions, such as logical operations, when operating on N-bit sign-extended versions of m-bit entities, naturally produce an N-bit result that corresponds to the correct m-bit result, sign-extended to N bits. Thus, compatibility does not require further definition of these instructions, and they operate correctly on N-bit entities that are not sign-extended. Therefore there is no need to provide separate N-bit instructions corresponding to these m-bit instructions.

The situation is different for other m-bit instructions, such as some shift instructions. When these instructions operate on N-bit sign-extended versions of m-bit entities, the N-bit result may not correspond to the correct m-bit result, sign-extended to N bits. For these instructions that do not naturally guarantee a sign-extended result, compatibility requires that the instructions be further defined to guarantee a sign-extended result. This means that the instructions tend not to produce the correct result for N-bit operands that are not sign-extended. Accordingly, separate N-bit instructions corresponding to these m-bit instructions are needed.

The addition operation is one of the instructions that does not guarantee a sign-extended result, and therefore requires extra circuitry to sign-extend the m-bit portion of the result. Unfortunately, addition tends to set the lower limit on the cycle time. Thus, performing sign-extension for every addition operation would require either a longer cycle time or that additions be performed in two cycles. According to one aspect of the invention, sign-extension for addition is performed only when needed, which is when m-bit two's complement overflow is detected. In the context of a pipelined implementation, with one instruction per cycle, this is accomplished by stalling the pipeline, performing the sign-extension, and inserting the correct value into the pipeline during the pipeline restart sequence.

The extended architecture performs address translation and error checking on various portions of an N-bit virtual address field, including portions above bit(m-1). The previous architecture's m-bit addresses are accommodated by providing the value of the sign bit (bit(m-1)) for all the extra high order bits needed by the translation and checking mechanism. In a specific implementation, the N-bit addressing and m-bit addressing share common address generation circuitry as well. In this implementation, the extended architecture supports the m-bit architecture's addressing by generating and storing m-bit addresses as N-bit entities in sign-extended form and requiring that the results of address computations on these entities be in sign-extended form.

The support for an expanded virtual address space is provided in part by widening the virtual address data paths, including a data address adder, a branch adder, and the program counter (PC) to N bits. In one embodiment, the N-bit virtual space is divided into a number of regions differentiated by the high order virtual address bits. For example, in a particular embodiment where N=64 and m=32, virtual address bits(63 . . . 62), designated VA(63 . . . 62), define four regions, starting at addresses 0, 2.sup.62, 2.times.2.sup.62, and 3.times.2.sup.62. The extended architecture provides a number of flat virtual subspaces of up to 2.sup.VSIZE bytes where VSIZE depends on the implementation. In the particular embodiment, VSIZE is constrained to the range 36 to 62 inclusive.

Depending on whether the machine is in user mode, supervisor mode, or kernel mode, certain portions of these regions are available. User mode can address a flat space of 2.sup.VSIZE bytes starting at address 0. VA(61 . . . VSIZE) are not translated by the TLB and an address error results if VA(63 . . . VSIZE) are not all 0's. Supervisor mode can address the user mode space, a 2.sup.VSIZE -byte space starting at address 2.sup.62, and a 2.sup.29 -byte space near the top of the fourth region. Kernel mode can address the spaces in the first and second regions, a number of unmapped spaces in the third region, a (2.sup.VSIZE -2.sup.31)-byte space starting at address 3.times.2.sup.62, and a 2.sup.31 -byte space at the top of the fourth region. The 2.sup.31 -byte spaces at the top and bottom of the 2.sup.64 -byte space are referred to as the compatibility spaces since their addresses are in the form of 32-bit addresses, sign-extended to 64-bits, and are thus accessible to 32-bit addressing.

In a particular implementation, the previous architecture allowed valid user addresses (MSB=0) to result from two's complement overflow. In order to handle this special case in the extended architecture it is necessary to provide an address mode in the machine's status register to specify whether the machine is running an m-bit program (i.e., one written for the previous architecture) or an N-bit program (i.e., one written for the extended architecture). In m-bit user mode, it is necessary to sign-extend the address when two's complement overflow occurs.

A straightforward approach for the m-bit mode is to provide sign-extension hardware in the virtual address path to guarantee a sign-extended output in the event of m-bit two's complement overflow. However, where timing constraints militate against such sign-extension, it suffices to force the (N-m) most significant bits to zero. Accordingly, in one embodiment, zeroing circuitry is provided in the path to the address translation unit. This circuitry is invoked for m-bit user mode while the most significant (N-m) bits are passed unchanged in m-bit kernel mode and N-bit mode.

The use of the sign-extension property provides an elegant way to extend the data word size and the virtual address size without an undue amount of extra hardware to support the prior architecture.

The use of VSIZE-bit virtual addressing with error exceptions has two main advantages. First, it allows the virtual address spaces to grow gracefully in future implementations while only requiring that the TLB for a given processor be as large as needed for the existing VSIZE. Second, since the use of the unmapped virtual address bits for other purposes is forbidden, programs written for a precessor with a certain VSIZE will run on a later processor with a larger VSIZE.

A further understanding of the nature and advantages of the present invention may be realized by reference to the remaining portions of the specification and the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a processor incorporating either the prior art architecture of the extended architecture of the present invention;

FIG. 2A is a block diagram of the prior art execution unit;

FIG. 2B is an expanded block diagram of the prior art shifter in the prior art execution unit;

FIGS. 3A and 3B are address maps for the prior art user mode and kernel mode virtual address spaced;

FIG. 3C is a block diagram of the prior art address unit and address translation circuitry;

FIG. 4A is a block diagram of the execution unit for the extended architecture;

FIG. 4B is a block diagram showing certain portions of the master pipeline control unit;

FIG. 4C is an expanded block diagram of the shifter in the execution unit for the extended architecture;

FIGS. 5A, 5B, and 5C are address maps for the extended architecture's user mode, supervisor mode, and kernel mode virtual address spaces;

FIG. 5D is a block diagram of the address unit and address translation circuitry for the extended architecture; and

FIG. 5E is a block diagram showing the address testing and control logic.

BRIEF DESCRIPTION OF THE TABLES

Table 1 is a list of abbreviations;

Table 2 shows the instruction formats;

Tables 3A-3D show the immediate instructions;

Tables 4A-4C show the register instructions;

Tables 5A and 5B show the jump instructions;

Tables 6A and 6B show the exception instructions; and

Table 7 shows the TLB format.

DESCRIPTION OF SPECIFIC EMBODIMENTS

Introduction and Definitions

The present invention provides a technique for extending a pre-existing architecture to a new architecture characterized by either or both of a larger data word size and a larger virtual address space.

The specific prior art 32-bit architecture described below is a RISC (reduced instruction set computer) architecture, which was implemented on RISC processors known as the R2000, R3000, and R6000, manufactured by MIPS Computer Systems, Inc., Sunnyvale, Calif. A comprehensive description of this architecture is provided in the 1988 Prentice Hall book "MIPS RISC Architecture" by Gerry Kane (Library of Congress No. 88-060290), the disclosure of which is incorporated by reference. The 64-bit extension provides a number of new 64-bit instructions, but includes substantially all the old 32-bit instructions.

As a matter of nomenclature, the terms "doubleword" and "halfword" will normally refer to 64-bit and 16-bit entities. The term "word" is sometimes used generically, and sometimes to refer to a 32-bit entity. Bits are normally numbered with bit(0) being the least significant (rightmost) bit. Bytes within a word or halfword may be ordered in a bid-endian (byte(0) leftmost) or a little-endian (byte(0) rightmost) system.

The term "sign-extension" refers to an operation that is performed when a data entity is smaller than the size of the container in which it is stored. In such a case, the most significant bit (the sign bit) is replicated in the vacant bits positions to the left. For example, sign-extension of a 32-bit entity to be stored in a 64-bit container entails storing the 32-bit entity at bit positions (31 . . . 0) of the 64-bit container, and storing the value of bit(31) of the 32-bit entity in all of bit positions (63 . . . 32) of the container.

The term "zero-extension" refers to the operation wherein zeros are used to fill the bit positions to the left of a data entity that is smaller than the container.

The term "extension" is used generically, referring to either sign-extension or zero-extension, as the case may be (e.g., depending on the definition of the particular instruction).

The term "true 64-bit entity" will sometimes be used to refer to a 64-bit entity whose data content is more than 32 bits, i.e., not a 32- or fewer-bit entity that has been sign-extended to 64 bits.

The term "two's complement overflow" refers to a situation where the carryouts from the two most significant bits differ. This occurs when the addition of two positive numbers or two negative numbers produces a result outside the permissible range. For 64-bit numbers, the range is -2.sup.63 to (2.sup.63 -1). Overflow without carryout from bit(63) occurs, for example, in an attempt to add (2.sup.63 -1) and 1. The correct result is 2.sup.63, but the computed result is -2.sup.63. Carry out without overflow occurs, for example in adding -1 (which is 64 1's in two's complement binary form) and 1. The correct result is 0 while the computed result is 0 with a carryout from bit(63).

The term "32-bit overflow" or "32-bit two's complement overflow" refers to a situation where the carryouts from bit(31) and bit(30) differ. This comes up in two contexts. In the context of adding 32-bit entities, it has the same meaning and effect as defined above. In the context of adding two 32-bit entities, each sign-extended to 64 bits, the result of such an overflow is a 64-bit entity having bit(32) different from bit(31), i.e., a 64-bit entity that is no longer in sign-extended form.

This relationship between overflow and sign-extension will be described in the simpler context of sign-extending 8-bit entities to 16 bits. Consider first a case where the result of adding sign-extended entities is sign-extended, for example the sum of the hexadecimal numbers 7F and 80. As 8-bit entities the sum is FF. The sum of the sign-extended versions of these, namely the sum of 007F and FF80, is FFFF, which is the sign-extended version of the sum FF. Consider next a case where the result of adding sign-extended entities is not sign-extended, for example the sum of 7F and 01. As 8-bit entities, the sum is 80 (which represents a two's complement overflow). The sum of the sign-extended versions of these, namely the sum of 007F and 0001, is 0080. However, the result is not a sign-extended entity, since the proper sign-extended entity would be FF80.

System Overview

FIG. 1 is block diagram of a single-chip processor 10. With a few exceptions, indicated below, the system overview description applies to prior art processors and to a processor under development incorporating the extended architecture of the present invention. The main difference at this high level is that the prior art processor was characterized by a 32-bit word size and virtual address while the extended architecture is characterized by a 64-bit word size and a virtual address of up to 64 bits.

The functional organization and pipeline discussed below corresponds to the R2000 processor.

Processor 10 comprises six synchronized functional units: a master pipeline control unit (MPC) 12, an execution unit (EU) 15, an address unit (AU) 17, a translation lookaside buffer (TLB) 20, a system coprocessor 22, and an external interface controller (EIC) 25. These functional units communicate with each other over a number of internal buses including a data/instruction bus 30, a virtual address bus 32, and a physical address bus 33. Communication off-chip is over data, address, and tag buses 35.

Instructions are issued at a peak rate of one instruction per cycle, with a five-stage pipeline. MPC 12 includes instruction decode circuitry 37 for decoding instruction fields latched off data/instruction bus 30. Upon decoding instructions, the MPC provides appropriate control signals to the other functional units. It also includes fault processing logic 38 for controlling the pipeline if any abnormal conditions arise. For example, when a cache miss occurs, the MPC stalls the pipeline. If another operation, such as an address translation, cannot be completed without intervention, the MPC shuts down the pipeline and transfers control to the operating system. The MPC also serializes simultaneous exceptions and ensures that execution can resume precisely after exception service.

EU 15 will be described in greater detail below. For this initial discussion, it suffices to note that the EU includes a register file 42 containing a number of general purpose registers, an ALU 45 for performing logical, shift, and addition operations, and a multiply/divide unit 47. Register file 42 contains 32 registers, with Register(0) being hardwired to a value 0. There are also special registers HI and LO used for multiply and divide instructions. In the prior art architecture and hardware implementation, the registers, ALU, and data paths within the execution unit are 32 bits wide; in the extended architecture, they are 64 bits wide.

The EU fetches two source operands from the registers every cycle. The operands are passed on to the ALU, or are sent to AU 17 or EIC 25. Simultaneously, the EU writes one result from the ALU, AU, or memory back into the registers. Bypassing allows an ALU or memory reference to take its source operands from a preceding operation, even if that result has not been written into the register file. Multiply/divide section 47 operates autonomously from the rest of the processor, so it can run in parallel with other ALU operations.

AU 17 will be described in greater detail below. For this initial discussion it suffices to note that the AU includes a program counter (PC) 50 and shares register file 42 with EU 15. In the prior art architecture and hardware implementation, the PC and data paths in the AU are 32 bits wide; in the extended architecture and hardware implementation, they are 64 bits wide. In the extended architecture and hardware implementation, the PC and data paths are 64 bits wide. The AU produces an instruction or data virtual address on each of the two clock phases per cycle. It generates the instruction address from the current PC, from a branch offset from the PC, or from a jump address coming directly from the EU. On subroutine calls, the AU also passes the PC back to the EU as a return link. The AU generates the data address from the base register and instruction offset provided by the EU.

TLB 20 is fully associative, and receives instruction and data virtual addresses on alternate clock phases, for mapping to physical addresses. Each translation combines the virtual address with the current process identifier. Thus, the TLB need not be cleared on context switches between processors.

System coprocessor 22 translates virtual addresses to physical addresses, and manages exceptions and transitions between kernel and user states. It also controls the cache subsystem and provides diagnostic control and error recovery facilities. One of the system coprocessors, referred to as coprocessor (0), and TLB 20 together may be referred to as the memory management unit. The system coprocessor includes a number of special registers, including a status register 51, which contains the kernel/user mode, interrupt enable, the diagnostic state of the processor, and in the extended architecture bits supporting a 32-bit mode and a supervisor mode.

EIC 25 manages the processor interface with the separate instruction and data caches, main memory, and external coprocessors. It generates and tests data and address-tag parity on all cache operations to aid system reliability. The EIC also watches external interrupt and internal software interrupt.

Prior Art Architecture--Instruction Set Overview

All processor instructions consist of one 32-bit word. Table 2 sets forth the instruction formats for the three processor instruction types (Immediate, Jump, and Register), and for the coprocessor instructions. The immediate-type instructions include load, store, ALU immediate, and branch instructions. The Jump-type instructions include direct jump instructions. The Register-type instructions include ALU 3-operand (add, subtract, set, and logical), shift, multiply/divide, indirect jump, and exception instructions.

An immediate instruction specifies two registers and a 16-bit immediate field. In the case of load and store instructions, the registers are a base register and source/destination register, and the immediate field contains an address displacement (offset) that is sign-extended and added to the content of the base register. The resulting virtual address is then translated, and the data transferred between the addressed memory location and the source/destination register. In the case of computational (ALU immediate) instructions, the immediate field is extended, combined with the content of the source register, and the result stored in the destination register. In the case of branch instructions the immediate field is sign-extended and added to the PC to form a target address.

A register instruction specifies up to three registers and one numerical field. In the case of add, subtract, AND, OR, XOR, and NOR instructions, two source registers are combined and the result stored in the destination register. In the case of set-on-less-than instructions, two source registers are compared, and depending on the relative values, the destination register is set to a value of 1 or 0. In the case of shift instructions, the contents of one source register are shifted by a specified number or by a number defined by the low order bits of the content of a source register, sign-extended or zero-extended, and stored in the destination register. For multiply instructions, the contents of two source registers are multiplied and the double result stored in the LO and HI special registers. For divide instructions, the content of one source register is divided by the content of the other, and the quotient and remainder are stored in the LO and HI registers. The LO and HI registers can also be written and read by move instructions.

Many of the instructions (load, set-on-less-than, multiply, divide) have "unsigned" counterparts where operands are treated as unsigned integers rather than two's complement integers. The addition and subtraction instructions also have "unsigned" counterparts, but the term has a different connotation. The regular addition and subtraction instructions trap on an overflow (carryouts from bit(30) and bit(31) differ) while the unsigned versions do not trap on an overflow. The definition of separate instructions that trap and don't trap represents the chosen alternative to using a condition code specifying an overflow.

Prior Art Execution Unit

FIG. 2A is block diagram showing the organization and data paths within a prior art embodiment of EU 15 corresponding to the R2000 processor. FIG. 2A is a somewhat stylized representation showing only those portions that are relevant to an understanding of the present invention. For example, the figure is a register-based representation of what is actually a latch-based implementation using a two-phase clock. Additionally, while the hardware for the RF, ALU, MEM, and WB stages is shown, that for the IF stage is not. It should be understood that control signals resulting from the instruction decode by MPC 12 are communicated to the various elements in the figure. With a few exceptions, these control signals are shown generally as "CTL" with the understanding that CTL designates different signals in different places.

In this embodiment register file 42, ALU 45, and all the other registers and data paths are 32 bits wide. ALU 45 is shown as comprising a shift unit 52, a logic unit 53, an adder 55, and an ALU multiplexer 57. Associated with the ALU is conditional branch circuitry including a comparison circuit 58, which compares two data operands, and branch decision logic 60. The branch decision logic makes the branch decision based on the result of the comparison, or the sign bit (bit(31)) of one of the operands, or both, depending on the particular branch instruction, and sends a control signal to AU 17. Zero determinations are made by comparing to Register(0).

Multiplexer 57 provides an ALU output selected from the outputs of the shift unit, the logic unit, and the adder. Shift unit 52 receives a single operand, while logic unit 53 and adder 55 each receives two operands. The second operand may be register data or may be immediate data extended by extension circuitry 63, as selected by an operand multiplexer 64.

Adder 55 performs the addition, subtraction, and set-on-less-than instructions (the latter involve a subtraction). The adder includes circuitry for monitoring 32-bit overflow, which manifests itself as different carryouts from bit(30) and bit(31). As mentioned above, some of the addition and subtraction instructions trap on such an overflow.

Interposed at various points along the data path are pipeline registers 65a-b, 67, and 68. These registers are clocked every cycle unless MPC 12 specifies a stall condition, which is used to disable the registers' respective clock inputs. A bypass multiplexer 70 provides the ALU with an operand from any one of pipeline registers 65a, 67, and 68. This allows the ALU to have access to data that has been loaded or processed before that data is loaded into the register file. The ALU also receives an operand from pipeline register 65b.

All instructions follow the same sequence of five pipeline stages during execution. These stages are instruction fetch (IF), source operand fetch from register file (RF), ALU operation or data operand address generation (ALU), data memory reference (MEM), and write back into register file (WB). During the IF cycle, the processor translates the instruction virtual address to an instruction physical address and drives it out to the instruction cache. The processor chip receives the instruction and decodes it during the RF cycle. The source operands go to the appropriate arithmetic, logic, or address unit during the ALU cycle. If the instruction makes a memory reference, the data cache receives the translated data address during the MEM cycle and returns data for the register file write during the WB cycle. Writes for ALU operations occur in the same pipeline stage. Bypassing between instructions in the pipeline keeps the latency of branches and memory references to one cycle and allows ALU results to be used in succeeding instructions.

During the RF cycle, data is read from register file 42 and clocked into one or both of pipeline registers 65a-b. During the ALU cycle, data from the selected pipeline register is processed by the ALU and the result is clocked into pipeline register 67. (A number of conditional branch instructions depend on the sign of a data entity. To this end, bit(31) (the sign bit) of the bypass multiplexer output is communicated to sign bit test logic associated with the AU 17.) During the MEM cycle, the content of pipeline register 67 or the result of a fetch from memory is clocked into pipeline register 68. A load multiplexer 72 determines the source on the basis of signals from the instruction decoder. During the WB cycle, the content of pipeline register 68 is communicated to the register file and clocked into the appropriate register.

Data from memory (typically from the cache) is communicated to load logic 75, which receives signals from the instruction decoder. For load instructions that are loading less than a full 32-bit word from memory, the load logic performs sign-extension or zero-extension to 32 bits, depending on the particular instruction. The result of the sign-extension is that the leftmost bit of the byte or halfword from memory is replicated in the vacant bit positions to the left. The result of the zero-extension is that the bit positions that are not filled by the loaded data entity are written with zeros.

FIG. 2B is an expanded block diagram of 32-bit shifter 52. As can be seen, the shifter has the capability to shift in 0's for left shifts and is provided with a multiplexer 76 for shifting either 0's for logical right shifts or the sign bit (bit((31)) for arithmetic right shifts

Prior Art Architecture--Addressing Overview

In the prior art architecture, sometimes referred to as the 32-bit architecture, virtual addresses are 32-bit entities. The virtual memory system provides for the logical expansion of the physical memory space of the machine by translating addresses composed in the 32-bit virtual address space into the physical space of the machine. The number of bits in a physical address is designated PSIZE. For R2000 and R3000 processors, PSIZE=32 and virtual address mapping uses 4096-byte (4-KB) pages. Thus, mapping via the TLB affects only the most significant 20 bits of a 32-bit virtual address, namely the virtual page number (VPN), while the remaining 12 bits, referred to as the offset, are passed along unchanged. The number of bits in the offset is designated OSIZE. For R6000 processors, OSIZE=14, PSIZE=36, and pages are 16384 bytes (16 KB) with an 18-bit VPN. The virtual address is extended with an address space identifier (ASID). The ASID field is 6 bits for R2000 and R3000 processors, and 8 bits for R6000 processors.

In the discussions below a given bit(i) or given bits(j . . . k) of the virtual address will be referred to as VA(i) or VA(j . . . k). Similarly, bits in the physical address will be referred to as PA(i) or PA(j . . . k). Bits output from the TLB will be referred to as TLB(j . . . k) with the bit positions referring to corresponding bit positions in the physical address. Thus, since the offset bits are not translated, the TLB output bits are TLB((PSIZE-1) . . . OSIZE) or TLB(31 . . . 12) for R2000 and R3000 processors and TLB(35 . . . 14) for R6000 processors.

The prior art processors (R2000, R3000, and R6000) that support the 32-bit architecture can operate in a user mode or a kernel mode as determined by one or more bits in the machine's status register.

FIG. 3A is an address map for the user mode virtual address space. A processor operating in user mode provides a single, uniform, mapped virtual address space of 2.sup.31 bytes (2 GB). In this context, the term "mapped" means that the virtual address is translated by TLB 20, while "unmapped" means the address is not translated by TLB 20 and the physical address bits are taken directly from the virtual address. All valid user-mode virtual addresses have bit(31)=0 and any attempt to translate an address with bit(31)=1 or fetch from such an address causes an address error exception.

The computation of a data address entails adding an immediate offset to the content of a base register. It is possible to start with a base register content having bit(31)=1, which would not be a valid user mode address, and by adding a negative offset, to provide a data address having bit(31)=0 and two's complement overflow. It is also possible to start with a base register content having bit(31)=0, and by adding an offset, to provide a data address having bit(31)=1, with two's complement overflow. The 32-bit architecture ignores the overflow in either case, but for the case that results in bit(31)=1, an address error exception will occur.

The computation of an instruction address may entail adding an immediate offset (or 1) to the content of the PC. In this case, the PC cannot contain an address with bit(31)=1, so it is impossible to create a valid user address with two's complement overflow.

FIG. 3B is an address map for the kernel mode virtual address space. For operation in kernel mode, four distinct virtual address spaces are simultaneously available, differentiated by the high-order bits of the virtual address. When VA(31)=0, the virtual address space selected covers the full 2-GB current user address space. When VA(31 . . . 29)=100, the virtual address space selected is a 2.sup.29 -byte (0.5-GB) cached, unmapped kernel physical address space. When VA(31 . . . 29)=101, the virtual address space selected is a 0.5-GB uncached, unmapped, kernel physical address space. When VA(31 . . . 30)=11, the virtual address space selected is a 2.sup.30 -byte (1-GB) mapped, kernel virtual space. While the virtual addresses for the unmapped kernel spaces (addresses with VA(31 . . . 30)=10) do not pass through the TLB, they are mapped (in a limited sense) as a block to physical addresses in the range 0-(2.sup.29 -1). That is, they have physical addresses with PA(31 . . . 29)=000. The kernel addressing is constrained so that the base address register must point to the same space as the result.

Prior Art Address Generation and Translation

FIG. 3C is a block diagram showing the organization and address paths within a prior art embodiment of AU 17 and associated address translation circuitry corresponding to the R2000 processor. In this embodiment, PC 50 and all the other registers and data paths are 32 bits wide.

Virtual data addresses for load and store instructions are computed by a data address adder 77. Adder 77 combines a base address from one of the registers with an offset derived from the 16-bit immediate field in the instruction. A sign-extension circuit 78 sign-extends the 16-bit offset to 32 bits before the offset is combined at the adder. Depending on whether the instruction is a load or a store, the data entity is read from the addressed memory location and loaded into the destination register, or the data entity in the source register is written into the addressed memory location.

The instruction address portion of the AU includes PC 50 and a next address multiplexer 80 which loads the PC with a selected one of four inputs. The first input, selected for normal sequential operation, is the next sequential address. This is provided by an incrementer 82, which receives the content of the PC and increments it. The second input, selected in the case of a jump instruction, is a jump address. This may be provided from the instruction or from the register file. The third input, selected in the case of a branch instruction with the branch taken, is a branch target address provided by a branch adder 85. The branch adder combines the content of the PC and an offset derived from the 16-bit immediate field in the branch instruction. The fourth input, selected in the case of an exception, is an exception vector. This is provided by an exception multiplexer, which receives at its inputs fixed exception vectors.

The virtual addresses from data address adder 77 and PC 50 are communicated to the address translation circuitry which generates physical addresses. The 12-bit offset (VA(11 . . . 0)) bypasses TLB 20 for all addresses and defines PA(11 . . . 0). VA(31 . . . 12) are communicated to the TLB and VA(29 . . . 12) bypass the TLB. A set of multiplexers 83 and 85 is controlled to select TLB(31 . . . 12) for the mapped spaces, or three leading zeros and VA(28 . . . 12) for the unmapped kernel spaces. As noted above the unmapped kernel spaces are those with VA(31 . . . 30)=10, and it is this condition that is used to control the multiplexers.

In the R2000 and R3000 processors, TLB 20 is a fully associative on-chip TLB containing 64 entries, all of which are simultaneously checked for a match with the extended virtual address. A TLB entry is defined as a 64-bit entity, but only 50 bits are stored, namely the 20-bit VPN, the 6-bit ASID, a 20-bit page frame number (PFN), and four bits specifying the cache algorithm for the page, whether the page is cached, whether the page is dirty, and whether the entry is valid. In the R6000 processor, the TLB is a two-set associative in-cache TLB.

Instruction Set for the Extended Architecture

The extended architecture assumes a hardware configuration where the registers, ALU, and other data paths within the EU are 64 bits wide. The instruction set includes all the prior art (32-bit) instructions, as well as a number of 64-bit instructions for manipulating doublewords. Thus, the extended architecture is a superset of the prior art architecture. However, it should be understood that the 32-bit instructions actually manipulate 64-bit entities, but that in some cases, the 64-bit entities are sign-extended or zero-extended versions of entities whose actual data content is 32 bits or fewer (words, halfwords, and bytes).

As will be seen below, many of the 32-bit instructions operate correctly on true 64-bit entities as well as on 32-bit entities sign-extended to 64 bits. The instruction decode circuitry in the MPC is able to provide enough information to the EU to specify whether the instruction is one of the 32-bit instructions or one of the doubleword instructions.

A key feature of the extended architecture is that a hardware implementation that supports the extended architecture can run programs containing only 32-bit instructions and manipulating 32-bit or smaller entities and produce exactly the same results as those produced by a prior art processor that supports the 32-bit architecture. This is accomplished by requiring that the 32-bit instructions operate on 64-bit sign-extended versions of 32-bit data entities and produce results that are 64-bit sign-extended versions of the correct 32-bit result. In the description that follows, it will be pointed out which of the 32-bit instructions will naturally operate on sign-extended entities to produce a sign-extended result, and which of them operate on sign-extended entities but require subsequent sign-extension. Where a 32-bit instruction operating on sign-extended entities does not naturally produce a sign-extended result, extra sign-extension circuitry is needed. That means that the instruction will in general not work on true 64-bit entities. In those cases, separate 64-bit (doubleword) instructions are added to the instruction set.

The instructions are listed in a series of tables specifying the instruction description and its opcode, an indication for 32-bit instructions of what type of extension, if any, is necessary in order that the result be a sign-extended or otherwise properly defined quantity, and for 64-bit instructions an indication that the instruction is unique to the extended architecture.

Tables 3A-3D set forth most of the immediate instructions. As noted above, immediate instructions specify an opcode, a pair of registers, and an immediate field which may be data or an offset for address calculation.

Table 3A sets forth the load instructions. The byte and halfword load instructions (LB, LBU, LH, LHU), when executed on a 32-bit machine, produce results that are sign-extended or zero-extended to 32 bits. It is noted that the unsigned load instructions (LBU, LHU) use zero-extension from 8 or 16 bits to 32 bits. Thus, the zero-extension to 64 bits is equivalent to sign-extension, and these instructions work on a 64-bit machine with sign-extension to 64 bits. Similarly, the word load instruction (LW) and the special unaligned word load instructions (LWL, LWR) are defined in the 64-bit architecture to sign-extend from bit(31) and thus require no new instructions. Operation on true 64-bit entities requires four new doubleword load instructions and an unsigned word load instruction (LWU) which operates analogously to the unsigned byte and halfword load instructions (LBU, LHU) in that it fills bits(63 . . . 32) to the left with 0's.

Table 3B sets forth the store instructions. For bytes, halfwords, and words stored as sign-extended 64-bit entities, the existing instructions work identically for 32-bit and 64-bit operation since the instructions ignore at least the upper 32 bits of the 64-bit register. New doubleword store instructions (SD, SDL, SDR, and SCD) are needed for the 64-bit architecture.

Table 3C sets forth the ALU immediate instructions. The bit-wise logical immediate instructions (ANDI, ORI, and XORI) produce sign-extended results when presented with sign-extended input operands. It is noted that the 16-bit immediate value is zero-extended to 32 bits in the 32-bit architecture and to 64 bits in the 64-bit architecture before being combined with the register value. Accordingly, these instructions work for both 32-bit and 64-bit operations.

The addition instructions (ADDI and ADDIU) present a need for additional 64-bit instructions, but for different reasons. ADDI is defined in the 32-bit architecture to trap on 32-bit two's complement overflow, and not write a result into the destination register. Thus if a result of adding two sign-extended entities is written, the result is in sign-extended form, so no sign-extension of the result is needed. However, a separate 64-bit instruction, (DADDI), which traps on 64-bit two's complement overflow, is needed for operation on true 64-bit entities since 32-bit overflow is simply not relevant.

ADDIU does not trap on 32-bit overflow, and thus can produce a result that is not sign-extended when operating on sign-extended inputs. Therefore, sign-extension of the result is required, and operations on true 64-bit entities require a new instruction (DADDIU) that does not sign-extend the result.

The immediate load (LUI) requires sign-extension as do the memory loads. The set-on-less-than instructions (SLTI and SLTIU) load a 1 or a 0, the 64-bit version of which is the sign-extended (and zero-extended) 32-bit version. No separate sign-extension circuitry, and therefore no new instructions are required.

Table 3D sets forth the branch-on-condition instructions. The branch instructions that test equality of two entities (BEQ, BNE, BEQL, and BNEL) do 64-bit bitwise comparison, and therefore operate on sign-extended input operands and true 64-bit operands the same way. Therefore, no new instructions are necessary. The remaining conditional branch instructions test the sign bit, namely bit(63), but with sign-extended input operands, this is the same as bit(31) for 32-bit operation. Accordingly, no new instructions are necessary.

Tables 4A-4C set forth most of the register instructions. As noted above, the register instructions specify up to three registers.

Table 4A sets forth the ALU 3-operand register instructions wherein the contents of two registers are processed, and a result or a value indicative of the result is stored in a 'third register. The addition and subtraction instructions (ADD, ADDU, SUB, and SUBU) require new 64-bit instructions for the same reasons as discussed above in connection with ADDI and ADDIU. ADD and SUB are defined to trap on 32-bit overflow and thus require DADD and DSUB instructions that trap on 64-bit overflow. ADDU and SUBU are not guaranteed to produce sign-extended results, and therefore require sign-extension of the result. Accordingly, new instructions (DADDU and DSUBU) are required for doubleword additions and subtractions without sign-extension.

The set-on-less-than instructions (SLT and SLTU) provide zero-extended values of 0 and 1 in the 32-bit context, and therefore provide sign-extended versions in the 64-bit context. Accordingly, no new instructions are required. The bitwise logical instructions (AND, OR, XOR, and NOR), given sign-extended input operands, naturally produce sign-extended results, and no new instructions are required.

Table 4B sets forth the shift instructions. Shifting a sign-extended entity does not normally produce a sign-extended result, and therefore sign-extension circuitry is required. Special logic is also required for the logical right shift operations (SRL and SRLV) in order to shift 0's into bit(31) prior to sign-extension (assuming that some shift occurs). Accordingly, additional doubleword shift instructions as well as instructions for shifts by more than 32 bits are provided.

It is noted that the shift right arithmetic instructions (SRA and SRAV) sign-extend from the left and therefore provide the correct result for sign-extended entities and true 64-bit entities. Nevertheless separate doubleword instructions (DSRA and DSRAV) are provided. This is necessary for the variable shifts since SRA uses bits(4 . . . 0) of the specified register to determine the shift amount while bits(5 . . . 0) are needed to specify the shift amount for true 64-bit entities. This is not an issue for SRA where the shift amount is a 5-bit field in the instruction. Nevertheless, it is convenient to define a new 64-bit instruction.

Table 4C sets forth the multiply and divide instructions. In the multiply instructions, the low-order word of the double result is loaded into the LO special register and the high-order word of the double result is loaded into the HI special register. Separate sign-extension is required to fill the 64-bit LO and HI registers with the 32-bit results. Similarly, on the divide instructions, the quotient and the remainder are loaded into the LO and HI special registers and separate sign-extension is also required here. Accordingly, separate double-word multiply and divide instructions are required. The instructions that transfer contents between the special registers and general registers work equally well for sign-extended and true 64-bit entities, and no additional instructions are required.

Tables 5A and 5B show the direct (immediate) and indirect jump (register) instructions. In the direct jump instructions in the 32-bit architecture, the 26-bit target address is shifted left two bits and combined with bits(31 . . . 28) of the PC, and the result jumped to. In the extended architecture, the combination is with bits(63 . . . 28) of the PC. If the addresses are sign-extended, correct operation results without any additional instructions. The indirect jumps, namely the jumps to the content of a register, naturally occur if 32-bit addresses are sign-extended to 64 bits.

Tables 6A and 6B set forth the exception instructions. No new instructions are required for the trap instructions for the same reasons as discussed above in connection with the conditional branch instructions.

Execution Unit for the Extended Architecture

FIG. 4 is a stylized block diagram showing the organization and data paths within an embodiment of execution unit that supports the extended architecture. The same reference numerals will be used for elements corresponding to those in FIG. 2, notwithstanding the fact that the elements in FIG. 4 are in general 64 bits wide and those in FIG. 2 are 32 bits wide. As with FIG. 2, only the relevant pipeline stages are shown.

It is important to make a distinction between the architecture as defined by the instruction set and the hardware implementation. For example, the hardware configuration described above in connection with the previous 32-bit architecture was in terms of the R2000 and R3000 processors, which internally use a 5-stage pipeline with each cycle divided into two phases. The prior art R6000 processor has a somewhat different 5-stage pipeline, while a processor currently under development for supporting the 64-bit architecture has an 8-stage pipeline.

The hardware that supports the extended instruction set architecture is represented as somewhat of an extension of the R2000/R3000 hardware implementation. This facilitates the description of the extended architecture and a hardware methodology for supporting it. It should be understood, however, that the hardware configuration for supporting the extended architecture need not be the same as that of the prior art processor.

In order to support the extended architecture defined above, extra extension circuitry is inserted in those data paths where the results of operating on sign-extended entities does not guarantee a sign-extended result.

To this end, extension circuitry 120 is inserted in the data path between shift unit 52 and ALU multiplexer 57. This extension circuitry is only activated for certain 32-bit shift instructions, which fact is denoted schematically by a control input with a set of signals designated 32S. The 32S signals specify, among other things, whether sign-extension or zero-extension is required.

Similarly, the load logic, designated 125, which provides data entities from the memory sub-system must now provide sign-extension or zero-extension to 64 bits for 32-bit words as well as halfwords and bytes. The load logic is shown as receiving generic control signals CTL and additional signals, designated 32L, specifying extension for 32-bit loads. The load logic can be viewed conceptually as sign-extending 32-bit entities to 64 bits, where the 32-bit entities themselves might be sign-extended or zero-extended versions of less-than-32-bit entities.

Adder 55 contains circuitry for monitoring 64-bit two's complement overflow, which causes a trap for the DADD and DSUB instructions. For compatibility, the adder also monitors 32-bit overflow, which causes a trap for the ADD and SUB instructions. This is necessary also for the ADDU and SUBU instructions, which don't trap on 32-bit overflow but require sign-extension in the event of it.

Thus, it is at least sometimes necessary to sign-extend the result of combining two 32-bit signed integers, each sign-extended to 64 bits, in order for the result to be in sign-extended form. A straightforward extension to the hardware would be to provide sign-extension circuitry between adder 55 and ALU multiplexer 57 (just as is done with extension circuitry 120 for shift operations). However, addition is a more time-consuming operation than the shift and logical operations, and the addition of sign-extension circuitry following the adder would result in an overall performance penalty. Since the time to perform an addition operation tends to set a lower limit on the cycle time, the straightforward solution would either require two cycles for every addition or a longer cycle for all operations.

Since 32-bit two's complement overflow occurs relatively infrequently, a hardware implementation as shown in FIG. 4A may be used. In this implementation, the output from adder 55 does not go through ALU multiplexer 57 and pipeline register 67, but rather goes through a separate pipeline register 130 and is directed to load multiplexer 72. The output of pipeline register 130 is also communicated to the input of bypass multiplexer 70 (as is the output of pipeline register 67). Thus, pipeline register 130 can be viewed as a parallel extension of pipeline register 67, with most addition results being introduced directly into the load multiplexer rather than via the ALU multiplexer.

However, an additional data path must be provided to accommodate the case where 32-bit two's complement overflow occurs in the addition of sign-extended operands. This is accomplished by a sign-extension circuit 140, coupled to the output of pipeline register 130, but outside the data paths from pipeline register 130 to load multiplexer 72 and bypass multiplexer 70. An extra multiplexer, referred to as overflow multiplexer 145, is interposed in the path between ALU multiplexer 57 and pipeline register 67, and is capable of selecting the output from sign-extension circuit 140.

When 32-bit overflow occurs with an ADDU or SUBU instruction, MPC 12 stalls the pipeline and controls overflow multiplexer 145 with a signal SE STALL to select the output from sign-extension circuit 140. This is shown schematically in FIG. 4B. This sign-extended output represents the correct result of the addition. Therefore, load multiplexer 72 and bypass multiplexer 70 can be provided with the correct result, which is inserted into the pipeline during the pipeline restart sequence. Thus, sign-extension circuit 140 is in the critical data path only in the event of overflow when it is needed; it is out of the critical path for addition of 64-bit operands or 32-bit sign-extended operands where overflow does not occur.

FIG. 4C is an expanded block diagram of 64-bit shifter 52 and associated extension circuitry 120. The shifter comprises top and bottom 32-bit sections. The shifter has the capability to shift in 0's for all left shifts and is provided a multiplexer 152 for shifting either 0's for logical right shifts or the sign bit (bit(63)) for arithmetic right shifts. Compatibility for 32-bit shifts is provided by multiplexers 153 and 155. For 32-bit logical right shifts, multiplexer 153 loads 0's into the top section of the shifter so that 0's are shifted into the vacated positions starting at bit(31). Multiplexer 155 selects the top section of the shifter or 32 copies of bit(31) of the bottom section for bits(63 . . . 32) of the result. This is necessary to provide sign-extension for the 32-bit left shifts. It is not strictly necessary for the 32-bit right shifts since multiplexers 152 and 153 can ensure a sign-extended result when the input is sign extended.

Addressing for the Extended Architecture

In the extended architecture, virtual addresses are 64-bit entities. A major objective of the extended architecture's addressing is to provide extended flat (non-segmented) subspaces while maintaining the prior architecture's addressing as a subset. To this end, the prior architecture's address space is carried forward in sign-extended form. Thus the 32-bit addresses of the prior architecture are stored and manipulated in sign-extended form.

A processor for the extended architecture may operate in user mode, supervisor mode, or kernel mode, as determined by bits in the machine's status register. The status register also contains bits that specify whether the machine is in the 32-bit mode or the 64-bit mode. In 32-bit mode, addresses are still stored and manipulated as 64-bit sign-extended entities.

As noted above, the physical address size PSIZE depends on the processor. A processor currently under development, referred to as the R4000, for supporting the 64-bit architecture has PSIZE=36. The extended architecture is not characterized by a fixed virtual address, but rather contemplates a processor-dependent virtual address size VSIZE in the range of 36-62 bits inclusive. As will be discussed below, this provides a number of 2.sup.VSIZE -byte virtual spaces. The practical significance of the use of VSIZE is that the TLB does not have to translate VA(61 . . . VSIZE). Thus, assuming that VSIZE has been chosen to reflect reasonably foreseeable needs, the TLB does not have to be any larger than necessary. VSIZE can be increased in later processor implementations as the need for larger virtual address spaces truly arises, and it is only at this time that the burden of a larger TLB will have to be borne.

The R4000 processor has VSIZE=40. This means that it will provide virtual address spaces of 1024 GB, which should be adequate for the time being.

The primary emphasis from a compatibility point of view is to maintain compatibility of user programs. Thus the extended architecture of the present invention provides compatibility for user programs by maintaining addressing compatibility in 32-bit user mode. However, kernel programs tend not to be compatible from processor to processor, even within the same architecture. Therefore, the extended architecture does not guarantee compatibility in 32-bit kernel mode.

To maintain compatibility in 32-bit user mode, an address computation with a result having bit(31)=0 must be considered a valid user address, even if 32-bit two's complement overflow occurs. This requires that the result be sign-extended, or what is equivalent in this case, that bits(63 . . . 32) be forced to zero. Thus, in 32-bit user mode, bits(63 . . . 31) are all 0's, and the address references a 2-GB user address space, which appears as a subset of 'the extended user address space. Otherwise, an address exception occurs. It is the fact that two's complement overflow is allowed in the prior architecture that necessitates the 32-bit mode bit in the status register. However, the 32-bit mode is useful in its own right in that it can be used to select the TLB refill vector in case of a TLB miss.

In 32-bit kernel mode, the virtual address space is 4 GB, divided into five regions, differentiated by the high-order bits of the 32-bit portion of the virtual address. It is assumed that in 32-bit mode, any address presented to the address translation mechanism is in sign-extended form. When VA(31)=0, VA(63 . . . 32) are all 0's, and the virtual address space selected covers the full 2-GB current user address space. Kernel and supervisor addresses have VA(31)=1, and therefore VA(63 . . . 32) are all l's. Thus, the four 0.5-GB spaces are at the extreme upper end of the 2.sup.64 -byte space, i.e., with addresses between (2.sup.64 -2.sup.32 +8000000H) and (2.sup.64 -1). When VA(31 . . . 29)=100, the virtual address space selected is a 0.5-GB cached, unmapped kernel physical address space. When VA(31 . . . 29)=101, the virtual address space selected is a 0.5-GB uncached, unmapped kernel physical address space. When VA(31 . . . 29)=110, the virtual address space selected is a 0.5-GB mapped supervisor virtual address space. When VA(31 . . . 29)=111, the virtual address space selected is a 0.5-GB mapped kernel virtual address space. The first two of these 0.5-GB spaces correspond to 0.5-GB spaces in the 32-bit architecture on a 32-bit processor. The provision of the supervisor virtual address space represents a further differentiation of the 1-GB mapped, kernel virtual space of the 32-bit architecture.

FIG. 5A is an address map for the 64-bit user mode virtual address space. In 64-bit user mode, the processor provides a single, uniform virtual address space of 2.sup.VSIZE bytes where 62.gtoreq.VSIZE.gtoreq.36. Different processor implementations may implement different virtual address space sizes, so long as they trap on addresses larger than implemented. When VSIZE bits are implemented, all valid user-mode virtual addresses have VA(63 . . . VSIZE) all 0's and any attempt to reference an address with those bits other than all 0's causes an address error exception. Making these bits illegal for other uses guarantees that user programs will run on later processor implementations that are characterized by a larger value for VSIZE.

The virtual address calculation, which entails the addition of a 64-bit base register and a 16-bit offset, sign-extended to 64 bits, must not overflow from bits(61 . . . 0) into bits(63 . . . 62). The virtual address is extended with the contents of the address space identifier field to form unique virtual addresses. The mapping of these extended virtual addresses, to physical addresses need not be one-to-one; but rather two virtual addresses are permitted to map to the same physical address.

FIG. 5B is an address map for the 64-bit supervisor mode virtual address space. In 64-bit supervisor mode, there are two virtual address spaces of 2.sup.VSIZE bytes as well as a 2.sup.29 -byte (0.5-GB) space. When VA(63 . . . 62)=00, the virtual address space selected is the 2.sup.VSIZE bytes of the current user address space. When VA(63 . . . 62)=01, the virtual address space selected is the 2.sup.VSIZE bytes of the current supervisor address space starting at address 2.sup.62. When VA(63 62)=11 and VA(31 . . . 29)=110, the address references the 0.5-GB supervisor address space with a starting address of (2.sup.64 -2.sup.32 +C0000000H).

FIG. 5C is an address map for the 64-bit kernel mode virtual address space. In 64-bit kernel mode, four distinct virtual address space regions are simultaneously available, differentiated by the high order bits of the virtual address, namely VA(63 . . . 62). When VA(63 . . . 62)=00, the virtual address space selected is the 2.sup.VSIZE bytes of the current user address space. When VA(63 . . . 62)=01, the virtual address selected is the 2.sup.VSIZE bytes of the current supervisor address space. When VA(63 . . . 62)=10, the virtual address space selected is one of eight 2.sup.PSIZE -byte unmapped kernel physical spaces located in the address range 2.times.2.sup.62 to (3.times.2.sup.62 -1). The particular unmapped space depends on the values of VA(61 . . . 59), and the spaces start at addresses 2.sup.59 bytes apart. Addresses in the (2.sup.59 -2.sup.PSIZE)-byte gaps (addresses with VA(58 . . . VSIZE) not all 0's) cause an address error. When VA(63 . . . 62)=11, the virtual address space selected is either a (2.sup.VSIZE -2.sup.31)-byte kernel virtual address space starting at address 3.times.2.sup.62 if VA(61 . . . VSIZE) are all 0's, or a 2-GB region compatible with the 32-bit kernel mode space if VA(61 . . . 31) are all 1's.

Thus, it can be seen that the 32-bit addressing regime is a subset of the extended addressing. 32-bit addresses, sign-extended to 64 bits, map to the top and bottom 2-GB portions of the 2.sup.64 -byte virtual address space. The 32-bit architecture's virtual addressing and the 32-bit mode of the 64-bit addressing can be brought into a closer correspondence by viewing the addresses as two's complement signed addresses. Viewed this way, the 32-bit space extends from -2.sup.31 to (2.sup.31 -1) with kernel addresses between -2.sup.31 and -1, and user addresses between 0 and (2.sup.31 -1). Similarly, the 64-bit space extends from -2.sup.63 to (2.sup.63 -1) with user and supervisor addresses between 0 and (2.sup.63 -1) and kernel addresses between -2.sup.63 and -1. The 32-bit address space then can be viewed as the center subset of the 64-bit address space, with 32-bit mode kernel and supervisor addresses between -2.sup.31 and -1 and 32-bit mode user addresses between 0 and (2.sup.31 -1).

Address Generation and Translation for the Extended Architecture

FIG. 5D is a block diagram showing the organization and address paths within an embodiment of AU 17 and associated address translation circuitry that supports the extended addressing of the 64-bit architecture. The data address generation circuitry and the instruction address generation circuitry differ from the prior art in that the various elements are 64 bits wide. For example, sign-extension circuit 78 sign extends the 16-bit offset to 64 bits and the exception vectors are stored in sign-extended form.

The address translation circuitry differs from the prior architecture in that it accommodates a 64-bit address that includes portions that provide a flat (non-segmented) extended virtual address space while maintaining the 32-bit addressing as a subset. As in the case of the prior architecture, a 12-bit offset VA(11 . . . 0) bypasses TLB 20 and defines PA(11 . . . 0).

VA(63 . . . 62) and VA((VSIZE-1) . . . 12) are communicated to TLB 20, and VA(63 . . . 29) are communicated to address test and control logic 170. A multiplexer 172 is interposed in the path and substitutes 0's for VA(63 . . . 32) in 32-bit user mode. The zeroing of the high order bits insures that a valid user address (VA(31)=0) that resulted in two's complement overflow is in sign-extended form.

A set of multiplexers 180, 182, and 185 provides PA((PSIZE-1) . . . 12) by selecting either TLB bits for the mapped spaces or virtual address bits for the unmapped kernel spaces. For the mapped spaces, the multiplexers select TLB((PSIZE-1) . . . 12), which are combined with VA(11 . . . 0) to provide the physical address.

As noted above the unmapped spaces include a 2.sup.PSIZE -byte space having VA(63 62)=10 and the two 2.sup.29 -byte spaces having VA(63 . . . 31) all 1's and VA(30)=0. The logical OR of these conditions is used to control multiplexers 180, 182, and 185 so that they select VA bits rather than TLB bits for the physical address. Specifically, when VA(62)=1, the compatibility unmapped spaces are indicated and 0's are substituted for VA((PSIZE-1) . . . 29) by a set of multiplexers 190 and 192 to make sure that the resulting physical address is between 0 and (2.sup.29 -1). Note that it is only necessary to test VA(62) for the unmapped spaces to determine whether the space is a full 2.sup.PSIZE bytes, or just 0.5 GB.

Thus, it is possible to support the 32-bit addressing as a subset of the extended addressing with very little extra hardware.

The TLB for the R4000 processor is a fully associative on-chip TLB containing 40 entries, all of which are checked for a match with the extended virtual address. Each TLB entry maps an even-odd page pair. The page size is controlled on a per-entry basis by a bit mask which specifies which virtual address bits are to be ignored by the TLB. The page size can vary from 4KB (VA(11 . . . 0) bypass TLB) to 16 MB (VA(11 . . . 0) bypass TLB and VA(23 . . . 12) ignored by TLB).

Table 7 shows the TLB format for the R4000 processor where VSIZE=40 and PSIZE=36. The nominal TLB entry is 256 bits, with room for expansion of VSIZE and PSIZE for future processor implementations. The fields indicated with a "-" are not stored.

FIG. 5E is a block diagram showing address test and control logic 170 for the R4000 processor. It is this logic that allows the processor, when it is in a given mode (user, supervisor, kernel) to access certain addresses and not others. Certain references in the figure to VA(36) and VA(35) can be generalized to VA(PSIZE) and VA(PSIZE-1) while references to VA(40) and VA(39) can be generalized to VA(VSIZE) and VA(VSIZE-1). A number of signal names consist of the prefix NZ or AO followed by two 2-digit numbers signifying bit positions. An NZ signal, when true, signifies that the bits in the range are not all 0's; an AO signal, when true, signifies that the bits are all 1's. For example, NZ3532 is asserted if VA(35 . . . 32) are not all 0's while A03532 is asserted if VA(35 . . . 32) are all 1's. These signals are used to test that the virtual address satisfies the various constraints discussed above.

Conclusion

In conclusion it can be seen that the present invention provides an elegant technique for extending a computer architecture, maintaining backward compatibility without significant hardware overhead. The extended virtual addressing scheme provides ample address spaces with room to grow in future processor implementations.

While the above is a complete description of a number of embodiments, various modifications, alternatives, and equivalents may be used. For example, the specification describes a processor that implements 64-bit integer arithmetic with 32-bit integer arithmetic as a subset, and 64-bit addressing with 32-bit addressing as a subset. However, there is no need that both extensions be to 64 bits. Indeed, it is possible to extend the integer arithmetic without extending the addressing, or vice versa. Further, while the 32-bit addressing and 64-bit addressing are described as sharing common address generation circuitry, it would be possible to share just the address translation and error checking circuitry and still derive significant benefits.

Therefore the above description and illustrations should not be taken as limiting the scope of the invention, which is defined by the claims.

TABLE 1______________________________________ABBREVIATIONS______________________________________ALU ALU operation or data operand address generation (cycle)ASID address space identifierAU address unitEIC external interface controllerEU execution unitIF instruction fetch (cycle)MEM data memory reference (cycle)MPC master pipeline control unitOSIZE offset size in virtual addressPA physical addressPC program counterPFN page frame numberPSIZE physical address sizeRF source operand fetch from register file (cycle)RISC reduced instruction set computerTLB translation lookaside bufferVA virtual addressVPN virtual page numberVSIZE virtual address sizeWB write back into register file (cycle)______________________________________ TABLE 2______________________________________INSTRUCTION FORMATSBits Field______________________________________I-type (Immediate)31 . . . 26 operation code25 . . . 21 source register specifier20 . . . 16 source/destination register specifier or sub- operation code15 . . . 0 immediate, branch displacement or address displacementJ-type (Jump)31 . . . 26 operation code25 . . . 0 target, jump target addressRe-type (Register)31 . . . 26 operation code25 . . . 21 source register specifier20 . . . 16 source/destination register specifier or sub- operation code15 . . . 11 destination register specifier10 . . . 6 shift amount5 . . . 0 function fieldCoprocessor31 . . . 26 operation code25 . . . 21 sub-operation code20 . . . 0 the interpretation of rest of the instruction is coprocessor-specific______________________________________ TABLE 3A______________________________________LOAD INSTRUCTIONSDescription Opcode Ext 64-bit______________________________________Load Byte LB SLoad Byte Unsigned LBU ZLoad Halfword LH SLoad Halfword Unsigned LHU ZLoad Word LW SLoad Word Left LWL SLoad Word Right LWR SLoad Linked LL SLoad Doubleword LD *Load Doubleword Left LDL *Load Doubleword Right LDR *Load Linked Doubleword LLD *Load Word Unsigned LWU Z *______________________________________ TABLE 3B______________________________________STORE INSTRUCTIONS______________________________________Store Byte SBStore Halfword SHStore Word SWStore Word Left SWLStore Word Right SWRStore Conditional SCStore Doubleword SD *store Doubleword Left SDL *Store Doubleword Right SDR *Store Conditional Doubleword SCD *______________________________________ TABLE 3C______________________________________ALU IMMEDIATE INSTRUCTIONSDescription Opcode Ext 64-bit______________________________________Add Immediate ADDIAdd Immediate Unsigned ADDIU SDoubleword Add Immediate DADDI *Doubleword Add Immediate DADDIU *UnsignedSet on Less Than Immediate SLTISet on Less Than Immediate SLTIUInsignedAnd Immediate ANDIOr Immediate ORIExclusive or Immediate XORILoad Upper Immediate LUI S______________________________________ TABLE 3D______________________________________BRANCH INSTRUCTIONS 64-Description Opcode Ext bit______________________________________Branch on Equal BEQBranch on Not Equal BNEBranch on Less Than BLEZor Equal to ZeroBranch on Greater Than Zero BGTZBranch on Equal Likely BEQLBranch on Not Equal Likely BNELBranch on Less Than or Equal BLEZLto Zero LikelyBranch on Greater Than BGTZLZero LikelyBranch on Less Than Zero BLTZBranch on Greater Than BGEZor Equal to ZeroBranch on Less Than Zero BLTZALand LinkBranch on Greater Than BGEZALor Equal and LinkBranch on Less Than Zero BLTZLLikelyBranch on Greater Than or BGEZLEqual to Zero LikelyBranch on Less Than Zeroand BLTZALLLink Likely and Link LikelyBranch on Greater Than or Equal BGEZALLEqual to Zero and Link Likely______________________________________ Opcode for these instructions is REGIMM. Specified opcode is actually subopcode. TABLE 4A______________________________________ALU 3-OPERAND REGISTER - TYPE INSTRUCTIONSDescription Function Ext 64-bit______________________________________Add ADD SAdd Unsigned ADDU SSubtract SUB SSubtract Unsigned SUBU SDoubleword Add DADD *Doubleword Add Unsigned DADDU *Doubleword Subtract DSUB *Doubleword Substract Unsigned DSUBU *Set on Less Than SLTSet on Less Than Unsigned SLTUAnd ANDOr ORExclusive Or XORNor NOR______________________________________ Note: Opcode is SPECIAL. Function is stored in function field. TABLE 4B______________________________________SHIFT INSTRUCTIONSDescription Function Ext 64-bit______________________________________Shift Left Logical SLL SShift Right Logical SRL SShift Right Arithmetic SRAShift Left Logical Variable SLLV SShift Right Logical Variable SRLV SShift Right Arithmetic Variable SRAVDoubleword Shift Left Logical DSLL *Doubleword Shift Right Logical DSRL *Doubleword Shift Right DSRA *ArithmeticDoubleword Shift Left DSLLV *Logical VariableDoubleword Shift Right DSRLV *Logical VariableDoubleword Shift Right DSRAV *Arithmetic VariableDoubleword Shift Left DSLL32 *Logical + 32Doubleword Shift Right DSRL32 *Logical + 32Doubleword Shift Right DSRA32 *Arithmetic + 32______________________________________ Note: Opcode is SPECIAL. Function is stored in function field. TABLE 4C______________________________________MULTIPLY/DIVIDE INSTRUCTIONSDescription Function Ext 64-bit______________________________________Multiply MULT SMultiply Unsigned MULTU SDivide DIV SDivide Unsigned DIVU SDoubleword Multiply DMULT *Doubleword Multiply DMULTU *UnsignedDoubleword Divide DDIV *Doubleword Divide Unsigned DDIVU *Move From HI MFHIMove To HI MTHIMove From LO MFLOMove To LO MTLO______________________________________ Note: Opcode is SPECIAL. Function is stored in function field. TABLE 5A______________________________________DIRECT JUMP INSTRUCTIONSDescription Opcode______________________________________Jump JJump and Link JAL______________________________________ TABLE 5B______________________________________INDIRECT JUMP INSTRUCTIONSDescription Function______________________________________Jump to Register JRJump and Link Register JALR______________________________________ Note: Opcode is SPECIAL. Function is stored in function Field. TABLE 6A______________________________________Exception InstructionDescription Function______________________________________System Call SYSCALLBreak BREAKTrap if Greater Than or Equal TGETrap if Greater Than or TGEUEqual UnsignedTrap if Less Than TLTTrap if Less Than Unsigned TLTUTrap if Equal TEQTrap if Not Equal TNE______________________________________ Note: Opcode is SPECIAL. Function is stored in function field. TABLE 6B______________________________________ Sub-Opcode______________________________________Trap if Greater Than or TGEIEqual ImmediateTrap if Greater Than or Equal GEIUUnsigned ImmediateTrap if Less Than Immediate TLTITrap if Less Than Unsigned TLTIUImmediateTrap if Equal Immediate TEQITrap if Not Equal Immediate TNEI______________________________________ Note: Opcode is REGIMM. TABLE 7______________________________________TLB FORMATBits Field______________________________________255 . . . 217 --216 . . . 205 Comparison mask204 . . . 192 --191 . . . 190 Region (00 = user, 01 = supervisor, 11 = kernel)189 . . . 168 --167 . . . 141 VPN/2140 Global (if set, ignore ASID in match logic)139 . . . 136 --135 . . . 128 ASID127 . . . 94 --93 . . . 70 PFN69 . . . 67 Cache algorithm66 Dirty65 Valid64 --63 . . . 0 correspond to bits(127 . . . 64) for second page of pair______________________________________

Claims

1. In a computer system including a processing unit and a memory subsystem, a processing unit comprising:

means, responsive to instructions fetched from said memory subsystem, for specifying corresponding operations wherein an m-bit entity on which operations can be performed has a most significant bit designated bit(m-1) and a least significant bit designated bit(0), an N-bit entity on which operations can be performed has a most significant bit designated bit(N-1) and a least significant bit designated bit(0), and N is greater than m;

the instructions including a first subset of instructions, called m-bit instructions, and a second subset of instructions, called N-bit instructions;

the m-bit instructions including a number of m-bit load instructions, a number of logical operation instructions, a number of m-bit shift instructions, and a number of m-bit addition instructions;

the N-bit instructions including a number of N-bit load instructions, a number of N-bit shift instructions, and a number of N-bit addition instructions;

a load circuit for performing specified load operations to retrieve entities up to N bits long from said memory subsystem, including means, responsive to at least one m-bit load instruction but non-responsive to any N-bit load instructions, for converting a retrieved m-bit entity to an N-bit entity where bit(N-1) through bit(m) of the N-bit entity are all equal to the value of bit (m-1) of the m-bit entity and bit (m-1) through bit(0) of the N-bit entity are respectively equal to the values of bit(m-1) through bit(0) of the m-bit entity;

a register file having a set of N-bit registers;

a logic circuit for performing specified logical operations between two N-bit operands and providing an N-bit result;

a shift circuit for performing specified shift operations on an N-bit operand and providing an N-bit result, including means, responsive to at least one m-bit shift instruction but non-responsive to any N-bit shift instructions, for changing the N-bit result of a shift operation by setting bit(N-1) through bit (m) of the N-bit result equal to the value of bit(m-1) of the N-bit result;

an adder for performing specified addition operations between a pair of N-bit operands and providing an N-bit result;

means, coupled to said adder and responsive to at least one m-bit addition instruction but non-responsive to any N-bit addition instructions, for requiring that the N-bit result of an operation in said adder have bit(N-1) through bit(m) equal to the value of bit(m-1) of the N-bit result;

means defining N-bit data paths from output ports of each of said load circuit, said logic circuit, said shift circuit, and said adder to said register file; and

means defining N-bit data paths from said register file to input ports of each of said logic circuit, said shift circuit, and said adder.

2. The processing unit of claim 1 wherein N=64 and m=32.

3. The processing unit of claim 1 wherein said load circuit further comprises means for sign-extending or zero-extending to m bits a retrieved entity of fewer than m bits to further define a retrieved entity of m bits.

4. The processing unit of claim 1 wherein:

said adder has carryouts from bit positions bit(m-1) and bit(m-2), and provides a signal indicating a condition, referred to as m-bit overflow, where said carryouts from bit positions bit(m-1) and bit(m-2) differ; and

said means for requiring operates to change the N-bit result of an operation by setting bit(N-1) through bit(m) of the N-bit result equal to the value of bit(m-1) of the N-bit result only if an m-bit overflow has occurred.

5. The processing unit of claim 1 wherein:

said adder has carryouts from bit positions bit(m-1) and bit(m-2), and provides a signal indicating a condition, referred to as m-bit overflow, where said carryouts from bit positions bit(m-1) and bit(m-2) differ;

said m-bit addition instructions include ADD and SUB instructions that trap on an m-bit overflow and produce no result, and ADDU and SUBU instructions that do not trap on an m-bit overflow and do produce a result; and

said means for requiring operates to change the N-bit result of an operation in said adder by setting bit(N-1) through bit(m) of the N-bit result equal to the value of bit(m-1) of the N-bit result if an m-bit overflow has occurred in the course of executing said ADDU and SUBU instructions and does not operate in connection with executing said ADD and SUB instructions.

6. The processing unit of claim 1, wherein:

said adder has carryouts from bit positions bit(N-1) and bit(N-2), and provides a signal indicating a condition, referred to as N-bit overflow, where the carryouts from bit positions bit(N-1) and bit(N-2) differ; and

said N-bit addition instructions include DADD and DSUB instructions that trap on an N-bit overflow and produce no result, and DADDU and DSUBU instructions that do not trap on an N-bit overflow and do produce a result.

7. The processing unit of claim 1 wherein said shift circuit comprises:

means, responsive to a first opcode, designated an N-bit logical right shift, for (1) shifting the N-bit operand a designated number of bit positions S to the right and, if the designated number is non-zero, (2) filling bit positions bit(N-1) through bit(N-S) of the N-bit result with 0's;

means, responsive to a second opcode, designated an m-bit logical right shift, for (1) shifting the N-bit operand a designated number of bit positions S to the right and, if the designated number is non-zero, (2) filling bit positions bit(N-1) through bit(m-S) of the N-bit result with 0's;

means, responsive to a third opcode, designated an N-bit left shift, for (1) shifting the N-bit operand a designated number of bit positions S to the left and, if the designated number is non-zero, (2) filling bit positions bit(S-1) through bit(0) of the N-bit result with 0's; and

means, responsive to a fourth opcode, designated an m-bit left shift, for (1) shifting the N-bit operand a designated number of bit positions S to the left and, if the designated number is non-zero, (2) filling bit positions bit(S-1) through bit(0) with 0's to provide an N-bit initial result, and (3) setting bit(N-1) through bit(m) of the N-bit result to the value of bit(m-1) of the N-bit initial result.

8. In the execution unit of a data processor, an adder for combining two N-bit operands to produce an N-bit result, the result and each operand having a most significant bit designated bit(N-1) and a least significant bit designated bit(0), comprising:

means, responsive to a first opcode, designated an N-bit add, for adding a pair of input operands and providing an N-bit result; and

means, responsive to a second opcode, designated an m-bit add, for adding a pair of input operands and providing an N-bit initial result, and, in at least those cases where bit(m) of the initial result is unequal to bit(m-1) of the initial result, for changing the N-bit initial result by setting bit(N-1) through bit(m) of the N-bit initial result to the value of bit(m-1) of the initial result and producing the initial result, thus changed, as the result.

9. In the execution unit of a data processor, a shift unit for shifting an N-bit input operand to produce an N-bit result, the input operand and the result each having a most significant bit designated bit(N-1) and a least significant bit designated bit(0), comprising:

means, responsive to a first opcode, designated an N-bit logical right shift, for (1) shifting the input operand a designated number of bit positions S to the right and, if the designated number is non-zero, (2) filling bit positions bit(N-1) through bit(N-S) of the N-bit result with 0's; and

means, responsive to a second opcode, designated an m-bit logical right shift, for (1) shifting the input operand a designated number of bit positions S to the right and, if the designated number is non-zero, (2) filling bit positions bit(N-1) through bit(m-S) of the N-bit result with 0's.

10. In the execution unit of a data processor, a shift unit for shifting an N-bit input operand to produce an N-bit result, the input operand and the result each having a most significant bit being bit(N-1) and a least significant bit designated bit(0), comprising:

means, responsive to a first opcode, designated an N-bit left shift, for (1) shifting the input operand a designated number of bit positions S to the left and, if the designated number is non-zero, (2) filling bit positions bit(S-1) through bit(0) of the N-bit result with 0's; and

means, responsive to a second opcode, designated an m-bit left shift, for (1) shifting the input operand a designated number of bit positions S to the left and, if the designated number is non-zero, (2) filling bit positions bit(S-1) through bit(0) with 0's to provide an initial result, and (3) setting bit(N-1) through bit(m) of the N-bit result to the value of bit (m-1) of the initial result.

11. A shift unit for performing specified shift operations on an N-bit operand and providing an N-bit result in a processing unit of a computer system wherein

the processing unit executes instructions including a first subset of instructions, called m-bit shift instructions, and a second subset of instructions, called N-bit shift instructions,

the input operand and the result each has a most significant bit designated bit(N-1) and a least significant bit designated bit(0), and

N is greater than m,

the shift unit comprising:

an N-bit shifter having an N-bit input for receiving an N-bit entity to be shifted, an N-bit output for providing an N-bit entity resulting from a shift operation, a control input for specifying a direction and a designated number of bit positions S for a shift operation, a first shift input terminal for receiving a value to replace bit(N-1) for right shifts, and a second input terminal for receiving a value to replace bit(0) for left shifts;

a first data selector having a first (N-m)-bit input coupled to receive bit(N-1) through bit(m) of said N-bit operand, a second input receiving (N-m) 0's, and an output coupled to bit positions bit(N-1) through bit(m) of said input of said shifter;

said first data selector passing bit(N-1) through bit(m) of said N-bit operand for said N-bit shift instructions, and passing said (N-m) 0's for an instruction, designated an m-bit logical right shift, if the designated number of bit positions is non-zero;

bit positions bit(m-1) through bit(0) of said input of said shifter being coupled to receive bit(m-1) through bit(0) of said N-bit operand;

a second data selector having a first input coupled to receive bit(N-1) of said N-bit input operand, a second input receiving a 0, and an output coupled to said first shift input of said shifter;

said second data selector passing bit(N-1) of said N-bit input operand for instructions, designated m-bit and N-bit arithmetic right shifts, and passing said 0 for instructions, designated m-bit and N-bit logical right shifts;

said second shift input being coupled to receive a 0;

a third data selector having a first input coupled to bit positions bit(N-1) through bit(m) of said output of said shifter, a second input coupled to receive (N-m) copies of bit(m-1) of said output of said shifter, and an output for providing bit(N-1) through bit(m) of said N-bit result;

said third data selector passing bit positions bit(N-1) through bit(N-m) of said output of said shifter for said N-bit shift instructions, and passing said (N-m) copies of bit(m-1) of said output of said shifter for instructions, designated m-bit left shifts;

bit positions bit(m-1) through bit(0) of said output of said shifter being coupled to provide bit(m-1) through bit(0) of said N-bit result.

12. A shift unit for performing specified shift operations on an N-bit operand and providing an N-bit result in a processing unit of a computer system wherein

the processing unit executes instructions including a first subset of instructions, called m-bit shift instructions, and a second subset of instructions, called N-bit shift instructions,

the input operand and the result each has a most significant bit designated bit(N-1) and a least significant bit designated bit(0), and

N is greater than m,

the shift unit comprising:

an N-bit shifter having an N-bit input for receiving an N-bit entity to be shifted, an N-bit output for providing an N-bit entity resulting from a shift operation, a control input for specifying a direction and a designated number of bit positions for a shift operation, a first shift input terminal for receiving a value to replace bit(N-1) for right shifts, and a second input terminal for receiving a value to replace bit(0) for left shifts

means for communicating to bit positions bit(N-1) through bit(m) of said input of said shifter (a) bit(N-1) through bit(m) of said N-bit operand for said N-bit shift instructions, and (b) (N-m) 0's for an instruction, designated an m-bit logical right shift, if the designated number of bit positions is non-zero;

bit positions bit(m-1) through bit(0) of said input of said shifter being coupled to receive bit(m-1) through bit(0) of said N-bit operand;

means for communicating to said first shift input of said shifter (a) bit(N-1) of said N-bit input operand for instructions, designated m-bit and N-bit arithmetic right shifts, and (b) a 0 for instructions, designated m-bit and N-bit logical right shifts;

said second shift input being coupled to receive a 0; and

means for providing as bit(N-1) through bit(m) of said N-bit result (a) bit positions bit(N-1) through bit(m) of said output of said shifter for said N-bit shift instructions, and (b) (N-m) copies of bit(m-1) of said output of said shifter for instructions, designated m-bit left shifts;

bit positions bit(m-1) through bit(0) of said output of said shifter being coupled to provide bit(m-1) through bit(0) of said N-bit result.

13. In a computer system including a processing unit and a memory subsystem, a processing unit comprising:

a decoder, responsive to instructions fetched from the memory subsystem, for specifying corresponding operations wherein an m-bit entity on which operations can be performed has a most significant bit designated bit(m-1) and a least significant bit designated bit(0), an N-bit entity on which operations can be performed has a most significant bit designated bit(N-1) and a least significant bit designated bit(0), and N is greater than m;

the instructions including a first subset of instructions, called m-bit instructions, and a second subset of instructions, called N-bit instructions,

the m-bit instructions including a number of m-bit load instructions, a number of logical operation instructions, a number of m-bit shift instructions, and a number of m-bit addition instructions;

the N-bit instructions including a number of N-bit load instructions, a number of N-bit shift instructions, and a number of N-bit addition instructions;

a load circuit for performing specified load operations to retrieve entities up to N bits long from said memory subsystem, the load circuit having an associated load sign-extension circuit, controllably operable in response to at least one m-bit load instruction, but not in response to any N-bit load instructions, to convert a retrieved m-bit entity to an N-bit entity where bit(N-1) through bit(N-m) of the N-bit entity are all equal to the value of bit(m-1) of the m-bit entity and bit(m-1) through bit(0) of the N-bit entity are respectively equal to the values of bit(m-1) through bit(0) of the m-bit entity;

a register file having a set of N-bit registers;

a logic circuit for performing specified logical operations between two N-bit operands and providing an N-bit result;

a shift circuit for performing specified shift operations on an N-bit operand and providing an N-bit result;

a shift sign-extension circuit, controllably operable in response to at least one m-bit shift instruction, but not in response to any N-bit shift instructions, to change the N-bit result of a shift operation by setting bit(N-1) through bit(N-m) of the N-bit result equal to the value of bit(m-1) of the N-bit result;

an adder for performing specified addition operations between a pair of N-bit operands and providing an N-bit result;

an add sign-extension circuit, controllably operable when at least one m-bit addition instruction is executed but not when any N-bit addition instruction is executed, to require the N-bit result of an operation in said adder have bit(N-1) through bit(m) of the N-bit result equal to the value of bit(m-1) of the result;

N-bit data paths from output ports of each of said load circuit, said logic circuit, said shift circuit, and said adder to said register file; and

N-bit data paths from said register file to input ports of each of said logic circuit, said shift circuit, and said adder.

14. The processing unit of claim 13 wherein N=64 and m=32.

15. The processing unit of claim 13 wherein:

said adder has carryouts from bit positions bit(m-1) and bit(m-2), and provides a signal indicating a condition, referred to as m-bit overflow, in said adder where said carryouts from bit positions bit(m-1) and bit(m-2) differ; and

said add sign-extension circuit operates to change the N-bit result of an operation in said adder by setting bit(N-1) through bit(m) of the N-bit result equal to the value of bit(m-1) of the N-bit result only if an m-bit overflow has occurred.

16. The processing unit of claim 1 wherein:

said adder has carryouts from bit positions bit(m-1) and bit(m-2), and provides a signal indicating a condition, referred to as m-bit overflow, in said adder where said carryouts from bit positions bit(m-1) and bit(m-2) differ;

said m-bit addition instructions include ADD and SUB instructions that trap on an m-bit overflow and produce no result, and ADDU and SUBU instructions that do not trap on an m-bit overflow and do produce a result; and

said add sign-extension circuit operates to change the N-bit result of an operation in said adder by setting bit(N-1) through bit(m) of the N-bit result equal to the value of bit(m-1) of the N-bit result if an m-bit overflow has occurred in the course of executing said ADDU and SUBU instructions and does not operate in connection with executing said ADD and SUB instructions.

17. The processing unit of claim 1 wherein:

said adder has carryouts from bit positions bit (N-1) and bit (N-2), and provides a signal indicating a condition, referred to as N-bit overflow, where the carryouts from bit positions bit (N-1) and bit (N-2) differ; and

said N-bit addition instructions include DADD and DSUB instructions that trap on an N-bit overflow and produce no result, and DADDU and DSUBU instructions that do not trap on an N-bit overflow and do produce a result.