MMIX

Designer	Donald Knuth
Bits	64-bit
Introduced	1999
Design	RISC
Encoding	Fixed
Branching	Condition Code
Endianness	Big
Open	Yes, and royalty free
Registers
32 special-purpose registers
General-purpose	256

MMIX (pronounced em-mix) is a 64-bit reduced instruction set computing (RISC) architecture designed by Donald Knuth, with significant contributions by John L. Hennessy (who contributed to the design of the MIPS architecture) and Richard L. Sites (who was an architect of the Alpha architecture). Knuth has said that,

MMIX is a computer intended to illustrate machine-level aspects of programming. In my books The Art of Computer Programming, it replaces MIX, the 1960s-style machine that formerly played such a role… I strove to design MMIX so that its machine language would be simple, elegant, and easy to learn. At the same time I was careful to include all of the complexities needed to achieve high performance in practice, so that MMIX could in principle be built and even perhaps be competitive with some of the fastest general-purpose computers in the marketplace."^[1]

Knuth started the design of MMIX in 1999, and released the stable version of the design in 2011.^[2] The processor is numbered as "2009" with Knuth explaining that this is the arithmetic mean from the numbers of other computer architectures; as well as being "MMIX" in Roman numerals.^[3]

MMIX is a big-endian 64-bit reduced instruction set computer (RISC), with 256 64-bit general-purpose registers, 32 64-bit special-purpose registers, fixed-length 32-bit instructions and a 64-bit virtual address space. The MMIX instruction set comprises 256 opcodes, one of which is reserved for future expansion.^{[citation needed]} MMIX uses IEEE 754 floating-point numbers.

All instructions have an associated mnemonic. For example, instruction #20 (32 decimal) is associated with ADD. Most instructions have the symbolic form OP X,Y,Z, where OP specifies the sort of instruction, X specifies the register used to store the result of the instruction and the rest specify the operands of the instruction. Each of these fields is eight bits wide. For example, ADD $0,$1,3 means "Set $0 to the sum of $1 and 3."

Most instructions can take either immediate values or register contents; thus a single instruction mnemonic may correspond to one of two opcodes.

MMIX programs are typically constructed using the MMIXAL assembly language. The below is a simple MMIXAL program, which prints the string "Hello, world!":

        LOC   #100                   % Set the address of the program
                                     % initially to 0x100.

Main    GETA  $255,string            % Put the address of the string
                                     % into register 255.

        TRAP  0,Fputs,StdOut         % Write the string pointed to by
                                     % register 255 to the standard
                                     % output file.

        TRAP  0,Halt,0               % End process.

string  BYTE  "Hello, world!",#a,0   % String to be printed.  #a is
                                     % newline, 0 terminates the
                                     % string.

There are 256 directly addressable general-purpose architectural registers in an MMIX chip, designated by $0 through $255, and 32 special-purpose architectural registers. The special-purpose registers can be accessed with the GET and PUT instructions. Two of the special registers, rL and rG, determine which of the general registers are local and which are global. All registers from $0... ([rL] − 1) are local registers, and represent a window into an internal stack of registers.^[4] Registers from [rL]... ([rG] − 1) are "marginal registers", they always return 0 if they are used as a source in an operation. Using a marginal register as the destination of an operation will cause the machine to automatically increase rL to include that register. All registers [rG]... $255 are called global registers, and are not part of the register stack.

The local register stack provides each subroutine with its own rL local registers, designated by $0 through $(rL − 1). Whenever a subroutine is called, a number of local registers are pushed down the stack (by shifting the start of the window). The arguments of the called subroutine are left in the remaining local registers. When a subroutine finishes it pops the previously pushed registers. Because the internal stack can contain only a finite number of registers, it may be necessary to store a part of the stack in memory.^[4] This is implemented with the special registers rO and rS which record which part of the local register stack is in memory and which part is still in local physical registers. The register stack provides for fast subroutine linkage.

The 32 special physical architectural registers are as follows:

0. rB, the bootstrap register (trip)

When tripping, rB ← $255 and $255 ← rJ. Thus saving rJ in a general register.

1. rD, the dividend register

   Unsigned integer divide uses this as the left half of the 128-bit input that is to be divided by the other operand.

2. rE, the epsilon register

   Used for floating comparisons with respect to epsilon.

3. rH, the himult register

   Used to store the left half of the 128-bit result of unsigned integer multiplication.

4. rJ, the return-jump register

   Used to save the address of the next instruction by PUSHes and by POP to return from a PUSH.

5. rM, the multiplex mask register

   Used by the multiplex instruction.

6. rR, the remainder register

   Is set to the remainder of integer division.

7. rBB, the bootstrap register (trap)

   When trapping, rBB ← $255 and $255 ← rJ. Thus saving rJ in a general register

8. rC, the cycle counter

   Incremented every cycle.

9. rN, the serial number

   A constant identifying this particular MMIX processor.

10. rO, the register stack offset

    Used to implement the register stack.

11. rS, the register stack pointer

    Used to implement the register stack.

12. rI, the interval counter

    Decremented every cycle. Causes an interrupt when zero.

13. rT, the trap address register

    Used to store the address of the trip vector.

14. rTT, the dynamic trap address register

    Used to store the address of the trap vector.

15. rK, the interrupt mask register

    Used to enable and disable specific interrupts.

16. rQ, the interrupt request register

    Used to record interrupts as they occur.

17. rU, the usage counter

    Used to keep a count of executed instructions.

18. rV, the virtual translation register

    Used to translate virtual addresses to physical addresses. Contains the size and number of segments, the root location of the page table and the address space number.

19. rG, the global threshold register

    All general registers references with a number greater or equal to rG refer to global registers.

20. rL, the local threshold register

    All general registers references with a number smaller than rL refer to local registers.

21. rA, the arithmetic status register

    Used to record, enable and disable arithmetic exception like overflow and divide by zero.

22. rF, the failure location register

    Used to store the address of the instruction that caused a failure.

23. rP, the prediction register

    Used by conditional swap (CSWAP).

24. rW, the where-interrupted register (trip)

    Used, when tripping, to store the address of the instruction after the one that was interrupted.

25. rX, the execution register (trip)

    Used, when tripping, to store the instruction that was interrupted.

26. rY, the Y operand (trip)

    Used, when tripping, to store the Y operand of the interrupted instruction.

27. rZ, the Z operand (trip)

    Used, when tripping, to store the Z operand of the interrupted instruction.

28. rWW, the where-interrupted register (trap)

    Used, when trapping, to store the address of the instruction after the one that was interrupted.

29. rXX, the execution register (trap)

    Used, when trapping, to store the instruction that was interrupted.

30. rYY, the Y operand (trap)

    Used, when trapping, to store the Y operand of the interrupted instruction.

31. rZZ, the Z operand (trap)

    Used, when trapping, to store the Z operand of the interrupted instruction.

Like programs running on almost all other CPUs, MMIX programs can be interrupted in several ways. External hardware, such as timers, are a common source of preemption interrupts. Many instructions cause an interrupt in certain exceptional cases; such as the memory protection page fault exceptions used to implement virtual memory, and floating point exception handling. MMIX has 2 kinds of interrupts: "trips" and "traps". The main difference between "trips" and "traps" is that traps send control to a "trap handler" program in the operating system (trapping), but trips send control to a "trip handler" program in the user application (tripping). Users can also force any interrupt handler to run with explicit software interrupt instructions TRIP and TRAP, similar to some kinds of trap in other computer systems. In particular, a system call from a user program to the operating system uses a TRAP instruction.^[1]: 38

As of October 2015^[update], no known hardware implementations of the MMIX instruction set architecture exist. However, the fpgammix^[5] project implements MMIX in Verilog, making it possible to implement using a field-programmable gate array.

The MMIX instruction set architecture is supported by a number of software tools for computer architecture research and software development.

• MMIXware^[6] – Donald Knuth's MMIX-SIM simple (behavioral) simulator, MMIXAL assembler, test suite, sample programs, full documentation, and MMIX architectural (pipeline) simulator (gzipped tar file).
• MMIXX^[7] – An X11-based graphics package contributed by Andrew Pochinsky of MIT’s Center for Theoretical Physics which, when combined with the MMIXware sources above, augments the MMIX virtual machine with a 640×480 pixel, true-color ‘virtual display’ (for UNIX/Linux).

The GNU Compiler Collection includes an MMIX back-end for its C/C++ compilers, contributed by Hans-Peter Nilsson and part of the main GCC distribution since late 2001. As of November 2017^[update], the MMIX back-end to GCC continues to be actively developed and maintained by volunteers.

• Installation instructions for GCC + MMIX tools by Hans-Peter Nilsson.^[8]
• §3.17.26. MMIX Options for GNU GCC version 7.2.0^[9] (GNU GCC Web site).
• §9.28.  MMIX-dependent Features^[10] for GNU as from GNU Binutils version 2.29, the assembler back-end for GNU GCC (GNU Binutils Web site).

The above tools could theoretically be used to compile, build, and bootstrap an entire FreeBSD, Linux, or other similar operating system kernel onto MMIX hardware, were such hardware to exist.

• Educational programming language
• DLX
• LC-3
• Little man computer
• MikroSim
• MIX
• NAR 2, another processor designed by a professor to help students learn

• Donald E. Knuth (2005). The Art of Computer Programming Volume 1 Fascicle 1: MMIX A RISC Computer for the New Millennium. Addison-Wesley. ISBN 0-201-85392-2 (errata)
• Martin Ruckert (2015). MMIX Supplement, The: Supplement to The Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth. Addison-Wesley. ISBN 0-133-99231-4

Wikimedia Commons has media related to MMIX.

• MMIX Home Page
• Donald Knuth's MMIX page — A brief introduction to MMIX, and Knuth's reasons for using a hypothetical assembly language in TAoCP.
• Donald Knuth's MMIX news page — An open source simulator written in CWEB, a programmer's manual, and example programs.
• MMIXmasters web site — A web site for the volunteers (MMIXmasters) who are converting all of the programs in TAOCP, Volumes 1–3, from the old MIX to the new MMIX.
• VMMMIX Archived 2009-07-05 at the Wayback Machine — VMMMIX is the MMIX virtual machine. It has console, HDD and Ethernet I/Os. Currently, this virtual machine runs on Windows only. And Linux runs on this MMIX virtual machine.
• The VMB Homepage — The Virtual Motherboard Project offers a plug and play collection of devices that can be used with an appropriate version of the MMIX CPU.