Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
PDP-11 architecture
open-in-new
<h2 id="cpu-registers">CPU registers</h2> <p>The CPU contains eight general-purpose 16-bit <a href="/facts/Processor_register/32RvbUdz">registers</a> (R0 to R7). Register R7 is the <a href="/facts/Program_counter/BxqulBRq">program counter</a> (PC). Although any register can be used as a stack pointer, R6 is the stack pointer (SP) used for hardware interrupts and traps. R5 is often used to point to the current procedure call frame. To speed up context switching, some PDP-11 models provide dual R0-R5 register sets. Kernel, Supervisor (where present), and User modes have separate memory maps, and also separate stack pointers (so that a user program cannot cause the system to malfunction by storing an invalid value in the stack pointer register). </p> <h2 id="memory">Memory</h2> <h3>Data formats</h3> <p>The smallest unit of addressable and writable memory is the 8-bit <a href="/facts/Byte/BNHUp9Qq">byte</a>. Bytes can also be held in the lower half of registers R0 through R5. </p><p>16-bit <a href="/facts/Word_(computer_architecture)/2e5umRaj">words</a> are stored <a href="/facts/Endianness/wbrQnyu3">little-endian</a> with least significant bytes at the lower address. Words are always aligned to even memory addresses. Words can be held in registers R0 through R7. </p><p>32-bit double words in the Extended Instruction Set (EIS) can only be stored in register pairs with the lower word being stored in the lower-numbered register. Double words are used by the MUL, DIV, and ASHC instructions. Other 32-bit data are supported as extensions to the basic architecture: <a href="/facts/Floating_point/eIckahxe">floating point</a> in the FPU Instruction Set or long data in the Commercial Instruction Set are stored in more than one format, including an unusual <a href="/facts/Endianness/wbrQnyu3">middle-endian</a> format<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a><a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> sometimes referred to as "PDP-endian". </p><p>A 64-bit double-precision floating-point format is supported by the floating-point processor option (FPP) for 11/45 and most subsequent models. </p> <h3>Memory management</h3> <p>The PDP-11's 16-bit addresses can address 64 <a href="/facts/Kilobyte/jIe6t4yv">KB</a>. By the time the PDP-11 yielded to the VAX, 8-bit bytes and hexadecimal notation were becoming standard in the industry; however, numeric values on the PDP-11 always use octal notation, and the amount of memory attached to a PDP-11 is always stated as a number of words. The basic <a href="/facts/Logical_address/kTaLBkzt">logical address</a> space is 32K words, but the high 4K of physical address space (addresses 160000<a href="/facts/Octal/4nRcq0Ce">8</a> through 1777778 in the absence of memory management) are not populated because input/output registers on the bus respond to addresses in that range. So originally, a fully expanded PDP-11 had 28K words, or 56 kbytes in modern terms. </p><p>The processor reserves low memory addresses for two-word vectors that give a program counter and processor status word with which to begin a service routine. When an I/O device interrupts a program, it places the address of its vector on the bus to indicate which service routine should take control. The lowest vectors are service routines to handle various types of trap. Traps occur on some program errors, such as an attempt to execute an undefined instruction; and also when the program executes an instruction such as BPT, EMT, IOT, or TRAP to request service from the operating system. </p> <h3>Memory expansion</h3> <p>During the life of the PDP-11, the 16-bit logical address space became an increasing limitation. Various techniques were used to work around it: </p> <ul><li>Later-model PDP-11 processors include memory management to support <a href="/facts/Virtual_addressing/ILxbMjgv">virtual addressing</a>. The physical address space was extended to 18 or 22 bits, hence allowing up to 256 KB or 4 MB of RAM. The logical address space (that is, the address space available at any moment without changing the memory mapping table) remains limited to 16 bits.</li> <li>Some models, beginning with the PDP-11/45, can be set to use 32K words (64 KB) as the "instruction space" for program code and a separate 32K words of "data space". Some operating systems—notably Unix since edition V7, and RSX11-M+—rely on this feature.</li> <li>Programming techniques, such as <a href="/facts/Overlay_(programming)/4njAmCUj">overlaying</a> a block of stored instructions or data with another as needed, can conceal paging issues from the application programmer. For example, the <a href="/facts/Modula-2/DFyUTdAq">Modula-2</a> compiler produces code under which the run-time system swaps 8 Kb pages into memory as individual procedures receive control.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a></li></ul> <h2 id="addressing-modes">Addressing modes</h2> <p>Most instructions allocate six bits to specify an operand. Three bits select one of eight addressing modes, and three bits select a general register. </p><p>The encoding of the six bit operand addressing mode is as follows: </p> <table><tbody><tr><td>5</td><td></td><td>3</td><td>2</td><td></td><td>0</td></tr><tr><td colspan="3">Mode</td><td colspan="3">Register</td></tr></tbody></table> <p> In the following sections, each item includes an example of how the operand would be written in assembly language. Rn means one of the eight registers, written R0 through R7. </p> <h3>General register addressing modes</h3> <p>The following eight modes can be applied to any general register. Their effects when applied to R6 (the stack pointer, SP) and R7 (the program counter, PC) are set out separately in the following sections. </p> <table><tbody><tr><th>Code</th><th>Name</th><th>Example</th><th>Description</th></tr><tr><th>0n</th><td>Register</td><td>Rn</td><td>The operand is in Rn</td></tr><tr><th>1n</th><td>Register deferred</td><td>(Rn)</td><td>Rn contains the address of the operand</td></tr><tr><th>2n</th><td>Autoincrement</td><td>(Rn)+</td><td>Rn contains the address of the operand, then increment Rn</td></tr><tr><th>3n</th><td>Autoincrement deferred</td><td>@(Rn)+</td><td>Rn contains the address of the address of the operand, then increment Rn by 2</td></tr><tr><th>4n</th><td>Autodecrement</td><td>−(Rn)</td><td>Decrement Rn, then use the result as the address of the operand</td></tr><tr><th>5n</th><td>Autodecrement deferred</td><td>@−(Rn)</td><td>Decrement Rn by 2, then use the result as the address of the address of the operand</td></tr><tr><th>6n</th><td>Index</td><td>X(Rn)</td><td>Rn+X is the address of the operand</td></tr><tr><th>7n</th><td>Index deferred</td><td>@X(Rn)</td><td>Rn+X is the address of the address of the operand</td></tr></tbody></table> <p>In index and index deferred modes, X is a 16-bit value taken from a second word of the instruction. In double-operand instructions, both operands can use these modes. Such instructions are three words long. </p><p>Autoincrement and autodecrement operations on a register are by 1 in byte instructions, by 2 in word instructions, and by 2 whenever a deferred mode is used, since the quantity the register addresses is a (word) pointer. </p> <h3>Program counter addressing modes</h3> <p>When R7 (the program counter) is specified, four of the addressing modes naturally yield useful effects: </p> <table><tbody><tr><th>Code</th><th>Name</th><th>Example</th><th>Description</th></tr><tr><th>27</th><td>Immediate</td><td>#n</td><td>The operand is the next word of the instruction</td></tr><tr><th>37</th><td>Absolute</td><td>@#a</td><td>The address of the operand is the next word of the instruction</td></tr><tr><th>67</th><td>Relative</td><td>a</td><td>The address of the operand is the next word of the instruction added to the PC</td></tr><tr><th>77</th><td>Relative deferred</td><td>@a</td><td>The address of the address of the operand is the next word of the instruction added to PC</td></tr></tbody></table> <p>The only common use of absolute mode, whose syntax combines immediate and deferred mode, is to specify input/output registers, as the registers for each device have specific memory addresses. Relative mode has a simpler syntax and is more typical for referring to program variables and jump destinations. A program that uses relative mode (and relative deferred mode) exclusively for internal references is <a href="/facts/Position-independent_code/jhgplpJ0">position-independent</a>; it contains no assumptions about its own location, so it can be loaded into an arbitrary memory location, or even moved, with no need for its addresses to be adjusted to reflect its location (<a href="/facts/Relocation_(computer_science)/yKQLrrPE">relocated</a>). In computing such addresses relative to the current location, the processor performed relocation on the fly. </p><p>Immediate and absolute modes are merely autoincrement and autoincrement deferred mode, respectively, applied to PC. When the auxiliary word is "in the instruction" as the above table says, the PC for the next instruction is automatically incremented past the auxiliary word. As PC always points to words, the autoincrement operation is always by 2. </p> <h3>Stack addressing modes</h3> <p>R6, also written SP, is used as a hardware stack for traps and interrupts. A convention enforced by the set of modes the PDP-11 provides is that a stack grows downward—toward lower addresses—as items are pushed onto it. When a mode is applied to SP, or to any register the programmer elects to use as a software stack, the addressing modes have the following effects: </p> <table><tbody><tr><th>Code</th><th>Name</th><th>Example</th><th>Description</th></tr><tr><th>16</th><td>Deferred</td><td>(SP)</td><td>The operand is on the top of the stack</td></tr><tr><th>26</th><td>Autoincrement</td><td>(SP)+</td><td>The operand is on the top of the stack, then pop it off</td></tr><tr><th>36</th><td>Autoincrement deferred</td><td>@(SP)+</td><td>A pointer to the operand is on top of the stack; pop the pointer off</td></tr><tr><th>46</th><td>Autodecrement</td><td>−(SP)</td><td>Push a value onto the stack</td></tr><tr><th>66</th><td>Indexed</td><td>X(SP)</td><td>This refers to any item on the stack by its positive distance from the top</td></tr><tr><th>76</th><td>Indexed deferred</td><td>@X(SP)</td><td>This refers to a value to which a pointer is at the specified location on the stack</td></tr></tbody></table> <p>Although software stacks can contain bytes, SP is always a stack of words. Autoincrement and autodecrement operations on SP are always by 2. </p> <h2 id="instruction-set">Instruction set</h2> <p>The PDP-11 operates on bytes and words. Bytes are specified by a register number—identifying the register's low-order byte—or by a memory location. Words are specified by a register number or by the memory location of the low-order byte, which must be an even number. In most instructions that take operands, bit 15 is set to specify byte addressing, or clear to specify word addressing. In the lists in the following two sections, the assembly-language programmer appended B to the instruction symbol to specify a byte operation; for example, MOV became MOVB. </p><p>A few instructions, for example MARK and SOB, were not implemented on some PDP-11 models. </p> <h3>Double-operand instructions</h3> <p>The high-order four bits specify the operation to be performed (with bit 15 generally selecting word versus byte addressing). Two groups of six bits specify the source operand addressing mode and the destination operand addressing mode, as defined above. </p> <table><tbody><tr><td>15</td><td></td><td></td><td>12</td><td>11</td><td></td><td>9</td><td>8</td><td></td><td>6</td><td>5</td><td></td><td>3</td><td>2</td><td></td><td>0</td></tr><tr><td colspan="4">Opcode</td><td colspan="3">Src</td><td colspan="3">Register</td><td colspan="3">Dest</td><td colspan="3">Register</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>01</th><td>MOV</td><td rowspan="2">Move: Dest ← Src<p>Note: Moving byte to a register sign-extends into bits 8-15</p></td></tr><tr><th>11</th><td>MOVB</td></tr><tr><th>02</th><td>CMP</td><td rowspan="2">Compare: Set-flags(Src − Dest)</td></tr><tr><th>12</th><td>CMPB</td></tr><tr><th>03</th><td>BIT</td><td rowspan="2">Bit test: Set-flags(Src ∧ Dest)</td></tr><tr><th>13</th><td>BITB</td></tr><tr><th>04</th><td>BIC</td><td rowspan="2">Bit clear: Dest ← Dest ∧ Ones-complement(Src)</td></tr><tr><th>14</th><td>BICB</td></tr><tr><th>05</th><td>BIS</td><td rowspan="2">Bit set: Dest ← Dest ∨ Src</td></tr><tr><th>15</th><td>BISB</td></tr><tr><th>06</th><td>ADD</td><td>Add: Dest ← Dest + Src</td></tr><tr><th>16</th><td>SUB</td><td>Subtract: Dest ← Dest − Src</td></tr></tbody></table> <p>The ADD and SUB instructions use word addressing, and have no byte-oriented variations. </p><p>Some two-operand instructions utilize an addressing mode operand and an additional register operand: </p> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td>9</td><td>8</td><td></td><td>6</td><td>5</td><td></td><td>3</td><td>2</td><td></td><td>0</td></tr><tr><td colspan="7">Opcode</td><td colspan="3">Reg</td><td colspan="3">Src/Dest</td><td colspan="3">Register</td></tr></tbody></table> <p>Where a register pair is used (written below as "(Reg, Reg+1)", the first register contains the low-order portion of the operand and must be an even numbered register. The next higher numbered register contains the high-order portion of the operand (or the remainder). An exception is the multiply instruction; Reg may be odd, but if it is, the high 16 bits of the result are not stored. </p> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>070</th><td>MUL</td><td>Multiply: (Reg, Reg+1) ← Reg × Src</td></tr><tr><th>071</th><td>DIV</td><td>Divide: Compute (Reg, Reg+1) ÷ Src; Reg ← quotient; Reg+1 ← remainder</td></tr><tr><th>072</th><td>ASH</td><td>Arithmetic shift: if Src<5:0> < 0 then Reg ← Shift-right(Reg, -Src<5:0>) else Reg ← Shift-left(Reg, Src<5:0>)</td></tr><tr><th>073</th><td>ASHC</td><td>Arithmetic shift combined: if Src<5:0> < 0 then (Reg, Reg+1) ← Shift-right((Reg, Reg+1), -Src<5:0>) else (Reg, Reg+1) ← Shift-left((Reg, Reg+1), Src<5:0>)</td></tr><tr><th>074</th><td>XOR</td><td>Exclusive or: Dest ← Dest ⊻ Reg</td></tr></tbody></table> <h3>Single-operand instructions</h3> <p>The high-order ten bits specify the operation to be performed, with bit 15 generally selecting byte versus word addressing. A single group of six bits specifies the operand as defined above. </p> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>6</td><td>5</td><td></td><td>3</td><td>2</td><td></td><td>0</td></tr><tr><td colspan="10">Opcode</td><td colspan="3">Src/Dest</td><td colspan="3">Register</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>0001</th><td>JMP</td><td>Jump: PC ← Src</td></tr><tr><th>0003</th><td>SWAB</td><td>Swap bytes of word: Dest ← Swap-bytes(Dest)</td></tr><tr><th>0050</th><td>CLR</td><td rowspan="2">Clear: Dest ← 0</td></tr><tr><th>1050</th><td>CLRB</td></tr><tr><th>0051</th><td>COM</td><td rowspan="2">Complement: Dest ← Ones-complement(Dest)</td></tr><tr><th>1051</th><td>COMB</td></tr><tr><th>0052</th><td>INC</td><td rowspan="2">Increment: Dest ← Dest + 1</td></tr><tr><th>1052</th><td>INCB</td></tr><tr><th>0053</th><td>DEC</td><td rowspan="2">Decrement: Dest ← Dest − 1</td></tr><tr><th>1053</th><td>DECB</td></tr><tr><th>0054</th><td>NEG</td><td rowspan="2">Negate: Dest ← Twos-complement(Dest)</td></tr><tr><th>1054</th><td>NEGB</td></tr><tr><th>0055</th><td>ADC</td><td rowspan="2">Add carry: Dest ← Dest + C flag</td></tr><tr><th>1055</th><td>ADCB</td></tr><tr><th>0056</th><td>SBC</td><td rowspan="2">Subtract carry: Dest ← Dest - C flag</td></tr><tr><th>1056</th><td>SBCB</td></tr><tr><th>0057</th><td>TST</td><td rowspan="2">Test: Set-flags(Src)</td></tr><tr><th>1057</th><td>TSTB</td></tr><tr><th>0060</th><td>ROR</td><td rowspan="2">Rotate right: Dest ← Rotate-right(Dest, 1)</td></tr><tr><th>1060</th><td>RORB</td></tr><tr><th>0061</th><td>ROL</td><td rowspan="2">Rotate left: Dest ← Rotate-left(Dest, 1)</td></tr><tr><th>1061</th><td>ROLB</td></tr><tr><th>0062</th><td>ASR</td><td rowspan="2">Arithmetic shift right: Dest ← Shift-right(Dest, 1)</td></tr><tr><th>1062</th><td>ASRB</td></tr><tr><th>0063</th><td>ASL</td><td rowspan="2">Arithmetic shift left: Dest ← Shift-left(Dest, 1)</td></tr><tr><th>1063</th><td>ASLB</td></tr><tr><th>1064</th><td>MTPS</td><td>Move to PSW: PSW ← Src</td></tr><tr><th>0065</th><td>MFPI</td><td>Move from previous I space: −(SP) ← Src</td></tr><tr><th>1065</th><td>MFPD</td><td>Move from previous D space: −(SP) ← Src</td></tr><tr><th>0066</th><td>MTPI</td><td>Move to previous I space: Dest ← (SP)+</td></tr><tr><th>1066</th><td>MTPD</td><td>Move to previous D space: Dest ← (SP)+</td></tr><tr><th>0067</th><td>SXT</td><td>Sign extend: if N flag ≠ 0 then Dest ← -1 else Dest ← 0</td></tr><tr><th>1067</th><td>MFPS</td><td>Move from PSW: Dest ← PSW</td></tr></tbody></table> <h3>Branch instructions</h3> <p>In most branch instructions, whether the branch is taken is based on the state of the condition codes. A branch instruction is typically preceded by a two-operand CMP (compare) or BIT (bit test) or a one-operand TST (test) instruction. Arithmetic and logic instructions also set the condition codes. In contrast to <a href="/facts/Intel/SMF0gJJX">Intel</a> processors in the <a href="/facts/X86_architecture/Kypq5fgu">x86 architecture</a>, MOV instructions set them too, so a branch instruction could be used to branch depending on whether the value moved was zero or negative. </p><p>The high-order byte of the instruction specifies the operation. Bits 9 through 15 are the op-code, and bit 8 is the value of the condition code calculation which results in the branch being taken. The low-order byte is a signed word offset relative to the current location of the program counter. This allows for forward and reverse branches in code. </p> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td>9</td><td>8</td><td>7</td><td></td><td></td><td></td><td></td><td></td><td></td><td>0</td></tr><tr><td colspan="7">Opcode</td><td colspan="1">C</td><td colspan="8">Offset</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>C</th><th>Mnemonic</th><th>Condition or Operation</th></tr><tr><th>000</th><td>1</td><td>BR</td><td>Branch always PC ← PC + 2 × Sign-extend(Offset)</td></tr><tr><th>001</th><td>0</td><td>BNE</td><td>Branch if not equal Z = 0</td></tr><tr><th>001</th><td>1</td><td>BEQ</td><td>Branch if equal Z = 1</td></tr><tr><th>002</th><td>0</td><td>BGE</td><td>Branch if greater than or equal (N ⊻ V) = 0</td></tr><tr><th>002</th><td>1</td><td>BLT</td><td>Branch if less than (N ⊻ V) = 1</td></tr><tr><th>003</th><td>0</td><td>BGT</td><td>Branch if greater than (Z ∨ (N ⊻ V)) = 0</td></tr><tr><th>003</th><td>1</td><td>BLE</td><td>Branch if less than or equal (Z ∨ (N ⊻ V)) = 1</td></tr><tr><th>100</th><td>0</td><td>BPL</td><td>Branch if plus N = 0</td></tr><tr><th>100</th><td>1</td><td>BMI</td><td>Branch if minus N = 1</td></tr><tr><th>101</th><td>0</td><td>BHI</td><td>Branch if higher (C ∨ Z) = 0</td></tr><tr><th>101</th><td>1</td><td>BLOS</td><td>Branch if lower or same (C ∨ Z) = 1</td></tr><tr><th>102</th><td>0</td><td>BVC</td><td>Branch if overflow clear V = 0</td></tr><tr><th>102</th><td>1</td><td>BVS</td><td>Branch if overflow set V = 1</td></tr><tr><th>103</th><td>0</td><td>BCC or BHIS</td><td>Branch if carry clear, or Branch if higher or same C = 0</td></tr><tr><th>103</th><td>1</td><td>BCS or BLO</td><td>Branch if carry set, or Branch if lower C = 1</td></tr></tbody></table> <p>The limited range of the branch instructions meant that, as code grew, the target addresses of some branches would become unreachable. The programmer would change the one-word BR to the two-word JMP instruction from the next group. As JMP has no conditional forms, the programmer would change BEQ to a BNE that branched around a JMP. </p><p>SOB (Subtract One and Branch) is another conditional branch instruction. The specified register is decremented by 1, and if the result is not zero, a reverse branch is taken based on the 6 bit word offset. </p> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td>9</td><td>8</td><td></td><td>6</td><td>5</td><td></td><td></td><td></td><td></td><td>0</td></tr><tr><td colspan="7">Opcode</td><td colspan="3">Reg</td><td colspan="6">Offset</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>077</th><td>SOB</td><td>Subtract One and Branch: Reg ← Reg - 1; if Reg ≠ 0 then PC ← PC - 2 × Offset</td></tr></tbody></table> <h3>Subroutine instructions</h3> <p>JSR calls a subroutine. A group of six bits specifies the addressing mode. The JSR instruction can save any register on the stack and load that register with the return address. Programs that do not need this feature specify PC as the register (JSR PC, address) and the routine returns using RTS PC. </p><p>If a routine is called with, for instance, JSR R4, address, then the old value of R4 is pushed on the top of the stack and the address just after JSR (ordinarily, the return address) is placed in R4. However, the routine can gain access to values coded in-line by specifying (R4)+, or to in-line pointers by specifying @(R4)+. The autoincrementation moves past these data, to the point at which the caller's code resumes. In either case, such a routine specifies RTS R4 to return to its caller. </p><p>The JSR PC,@(SP)+ form, which exchanges the contents of PC with the top element of the stack, can be used to implement <a href="/facts/Coroutine/hGCtXsAQ">coroutines</a>. Once a routine places the entry address of the coroutine on the stack, executing JSR PC,@(SP)+ saves PC on the stack and jumps to the coroutine. Both coroutines can then use additional JSR PC,@(SP)+ instructions to jump to the other coroutine wherever it left off. This lets the two routines swap control and resume one another at the point of the previous swap. </p> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td>9</td><td>8</td><td></td><td>6</td><td>5</td><td></td><td>3</td><td>2</td><td></td><td>0</td></tr><tr><td colspan="7">Opcode</td><td colspan="3">Reg</td><td colspan="3">Src</td><td colspan="3">Register</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>004</th><td>JSR</td><td>Jump to subroutine: -(SP) ← Reg; Reg ← PC; PC ← Src</td></tr></tbody></table> <p>The value of PC moved to Reg is the address after the JSR instruction. </p> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>3</td><td>2</td><td></td><td>0</td></tr><tr><td colspan="13">Opcode</td><td colspan="3">Reg</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>00020</th><td>RTS</td><td>Return from subroutine: PC ← Reg; Reg ← (SP)+</td></tr></tbody></table> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>6</td><td>5</td><td></td><td></td><td></td><td></td><td>0</td></tr><tr><td colspan="10">Opcode</td><td colspan="6">nn</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>0064</th><td>MARK</td><td>Return from subroutine, discard stack entries: SP ← SP + (2 x nn), PC ← R5, R5 ← (SP)+</td></tr></tbody></table> <p>MARK is used to delete parameters on the stack when exiting a subroutine. MARK is unusual in that it is placed on the return stack by the caller for later execution directly on the stack by the return routine. First, the caller pushes R5 on the stack. Next, up to 63 word arguments may be placed on the stack. The caller then adds the number of arguments to the MARK opcode and pushes that result on the stack. The value of SP is copied to R5. Finally, a JSR PC,address is executed to call the subroutine. After executing its code, the subroutine terminates with an RTS R5. This loads the value in R5 (pointing to MARK instruction on stack) into the PC and pops the caller's return address into R5. The MARK instruction is executed. MARK multiplies the number of arguments by 2, adds that to SP, deleting the arguments, and then returns to caller with the equivalent of an RTS R5. The MARK instruction is rarely used as its convoluted operation can be replaced by an ADD to SP.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p> <h3>Trap instructions</h3> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td>9</td><td>8</td><td>7</td><td></td><td></td><td></td><td></td><td></td><td></td><td>0</td></tr><tr><td colspan="7">Opcode</td><td colspan="1">S</td><td colspan="8">Operation Code</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>S</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>104</th><td>0</td><td>EMT</td><td>Emulator trap: -(SP) ← PS; -(SP) ← PC; PC ← (30); PS ← (32)</td></tr><tr><th>104</th><td>1</td><td>TRAP</td><td>General trap: -(SP) ← PS; -(SP) ← PC; PC ← (34); PS ← (36)</td></tr></tbody></table> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>0</td></tr><tr><td colspan="16">Opcode</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>000002</th><td>RTI</td><td>Return from interrupt: PC ← (SP)+; PS ← (SP)+</td></tr><tr><th>000003</th><td>BPT</td><td>Breakpoint trap: -(SP) ← PS; -(SP) ← PC; PC ← (14); PS ← (16)</td></tr><tr><th>000004</th><td>IOT</td><td>I/O trap: -(SP) ← PS; -(SP) ← PC; PC ← (20); PS ← (22)</td></tr><tr><th>000006</th><td>RTT</td><td>Return from trap: PC ← (SP)+; PS ← (SP)+</td></tr></tbody></table> <h4>Trap and Exception Vector Address Assignments</h4> <table><tbody><tr><th>Vector</th><th>Condition</th></tr><tr><th>000000</th><td>(Reserved)</td></tr><tr><th>000004</th><td>Illegal instruction, bus error, stack limit</td></tr><tr><th>000010</th><td>Reserved instruction</td></tr><tr><th>000014</th><td>BPT instruction, trace trap</td></tr><tr><th>000020</th><td>IOT instruction</td></tr><tr><th>000024</th><td>Power fail</td></tr><tr><th>000030</th><td>EMT instruction</td></tr><tr><th>000034</th><td>TRAP instruction</td></tr><tr><th>000114</th><td>Parity error</td></tr><tr><th>000244</th><td>Floating point exception</td></tr><tr><th>000250</th><td>Memory management fault</td></tr></tbody></table> <h3>Miscellaneous instructions</h3> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>0</td></tr><tr><td colspan="16">Opcode</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>000000</th><td>HALT</td><td>Halt processor: Halt execution before next instruction</td></tr><tr><th>000001</th><td>WAIT</td><td>Wait for interrupt: Halt execution before next instruction; Resume execution at next interrupt handler</td></tr><tr><th>000005</th><td>RESET</td><td>Reset UNIBUS: Assert INIT on UNIBUS for 10 ms; All other devices reset to power up state</td></tr><tr><th>000240</th><td>NOP</td><td>No operation: Do nothing</td></tr></tbody></table> <h3>Condition-code operations</h3> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>6</td><td>5</td><td>4</td><td>3</td><td>2</td><td>1</td><td>0</td></tr><tr><td colspan="10">Opcode</td><td>1</td><td>S</td><td>N</td><td>Z</td><td>V</td><td>C</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>S</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>0002</th><td>0</td><td>Ccc</td><td>Clear condition codes: Clear codes according to N, Z, V, C bits</td></tr><tr><th>0002</th><td>1</td><td>Scc</td><td>Set condition codes: Set codes according to N, Z, V, C bits</td></tr></tbody></table> <p>The four condition codes in the processor status word (PSW) are </p> <ul><li>N indicating a negative value</li> <li>Z indicating a zero (equal) condition</li> <li>V indicating an overflow condition, and</li> <li>C indicating a carry condition.</li></ul> <p>Instructions in this group were what Digital called "micro-programmed": A single bit in the instruction word referenced a single condition code. The assembler did not define syntax to specify every combination, but the symbols SCC and CCC assembled an instruction that set or cleared, respectively, all four condition codes. </p><p>Clearing or setting none of the condition codes (opcodes 000240 and 000260, respectively) could effectively be considered as no-operation instructions. In fact, the NOP mnemonic assembled into 000240. </p> <h3>Inconsistent instructions</h3> <p>Over the life of the PDP-11, subtle differences arose in the implementation of instructions and combinations of addressing modes, though no implementation was regarded as correct. The inconsistencies did not affect ordinary use of the PDP-11. </p> <h2 id="optional-instruction-sets">Optional instruction sets</h2> <h3>Extended Instruction Set (EIS)</h3> <p>The EIS is an option for the 11/35/40 and 11/03, and was supplied as standard on newer processors. </p> <ul><li>MUL, DIV multiply and divide integer operand to register pair</li> <li>ASH, ASHC arithmetic – shift a register or a register pair. For a positive number it will shift left, and right for a negative one.</li></ul> <h3>Floating Instruction Set (FIS)</h3> <p>FIS is an option for the PDP-11/35/40 and 11/03. Single-precision floats are operated on a stack addressed by a register operand. The high-order 13 bits specify the operation to be performed. A three bit field specifies which register is used as the floating point operand stack pointer. Each float is two words and each floating point instruction operates on two floats, returning one float as a result. The selected stack pointer is incremented by a stride of 4 after each operation. </p> <table><tbody><tr><td>15</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>3</td><td>2</td><td></td><td>0</td></tr><tr><td colspan="13">Opcode</td><td colspan="3">Reg</td></tr></tbody></table> <table><tbody><tr><th>Opcode</th><th>Mnemonic</th><th>Operation</th></tr><tr><th>07500</th><td>FADD</td><td>Floating add: 4(Rn) ← 4(Rn) + (Rn), Rn ← Rn + 4</td></tr><tr><th>07501</th><td>FSUB</td><td>Floating subtract: 4(Rn) ← 4(Rn) - (Rn), Rn ← Rn + 4</td></tr><tr><th>07502</th><td>FMUL</td><td>Floating Multiply: 4(Rn) ← 4(Rn) × (Rn), Rn ← Rn + 4</td></tr><tr><th>07503</th><td>FDIV</td><td>Floating Divide: 4(Rn) ← 4(Rn) ÷ (Rn), Rn ← Rn + 4</td></tr></tbody></table> <h3>Floating-Point Processor (FPP)</h3> <p>This was the optional floating point processor option for 11/45 and most subsequent models. </p> <ul><li>full floating-point operations on single- or double-precision operands, selected by single/double bit in Floating Point Status Register</li> <li>single-precision floating-point data format predecessor of <a href="/facts/IEEE_754/dD3e7zAl">IEEE 754</a> format: sign bit, 8-bit exponent, 23-bit mantissa with hidden bit 24</li></ul> <h3>Commercial Instruction Set (CIS)</h3> <p>The Commercial Instruction Set, known as CIS or CIS11, adds string and <a href="/facts/Binary-coded_decimal/dWTaE7ES">binary-coded decimal</a> (BCD) instructions used by <a href="/facts/COBOL/wVnhqs0k">COBOL</a> and <a href="/facts/DIBOL/jS8wTBkf">DIBOL</a>. It was implemented by optional microcode in the 11/23/24,<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a><a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> and by an add-in module in the 11/44<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> and one version of the 11/74. </p><p>Strings are represented by two 16-bit integers stored in any two of the general-purpose registers, or as two 16-bit values in subsequent locations in memory. One is designated "n", which is the length up to 64 kB, and the other "A", which is a pointer to the start of the character data in memory. Together, an n/A pair indicates the location and length of the string.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a>: 195 : 406 </p><p>The string copy operations are MOVEC, MOVTC and MOVRC. MOVEC copies the character data in memory from the location indicated in one n/A pair to the location in a second n/A, both in registers, with a third register containing a fill character in its lower 8 bits and zeroes in its upper 8 bits. MOVECI does the same but with the locations and fill character stored in memory locations instead of registers. In all of the move instructions, if the source is shorter than the destination, the destination is padded with the fill character, and if the source is longer, it is truncated. If either occurs, the processor status flags are used to indicate this. MOVRC/MOVRCI are similar, but copy backwards to reverse the original string into the destination.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a>: 409 </p><p>MOVTC/MOVTCI translate characters during copy using a 256-byte lookup table, the beginning of which is pointed to by another register in MOVTC or a 16-bit pointer in memory in MOVTCI. Translations use the source string's character values as index numbers and copy the value in the translation table at that index into the destination string. This can be used for <a href="/facts/EBCDIC/qAhmvgj0">EBCDIC</a> to <a href="/facts/ASCII/vGUI33Qu">ASCII</a> conversions by placing the corresponding ASCII character code for the mapped EBCDIC codes in the table. The character "E" is character 69 in ASCII and 197 in EBCDIC, so to convert EBCDIC to ASCII one would make a table of 256 bytes with a 69 in location 197. When MOVTC is called and sees a 197 in the original string, it will look in location 197 of the table, find the 97, and output that in the new string, performing the conversion.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a>: 456–458 </p><p>String comparisons are handled by CMPC, which sets the processor condition codes based on the results of comparing two strings. LOCC finds the first occurrence of a character in a string, while SKPC searches for the first character that does not match, used for trimming blanks at the start of strings, for instance. SCANC and SPANC are similar to LOCC and SKPC, but match any character in a masked character set. This can be used, for instance, to find the next occurrence of any line-breaking character like VT, LF or CR. Character sets are a table of 256 bytes, split into subsets.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> These are similar to the translation tables with the lower eight bits of the first word forming a mask, and the second word pointing to the start of the table. The mask selects which of the subsets, up to eight, are part of the character set during comparisons. Using this system, one can define character sets like uppercase, lowercase, digits, etc. and then easily make a union via the mask, for instance, selecting the upper and lowercase subsets to produce the complete set of letters.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> </p><p>CIS also includes a set of data types and instructions for manipulating BCD numbers. This data is also represented by two 16-bit registers or memory locations, with the second number being the A identical to the string case. The first word now contains four fields which describe the string representation of the data, which include packed and unpacked digits, handling the sign, and the length of the string, from 0 to 16 bytes. DEC referred to unpacked data, with one digit per byte, as "numeric strings". Using packed data, with two BCD digits per byte, a 16-byte string held BCD numbers up to 32 digits long. Instructions included ADDP/ADDN for packed and unpacked data, SUBP/SUBN, ASHP/ASHN (arithmetic shift) and CMPP/CMPN (compare). Available for packed data only are MULP and DIVP. CIS also includes a set of six instructions (CVT) to convert BCD numbers between packed and unpacked formats, as well as to and from binary values.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> </p><p>A final set of instructions is provided to load two or three 2-word string descriptors to the internal registers, avoiding the need for multiple MOVs.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> </p> <h3>Access to Processor Status Word (PSW)</h3> <p>The PSW is mapped to memory address 177 776, and can thus be processed like any data. Instructions found on all but the earliest PDP-11s give programs more direct access to the register. </p> <ul><li>SPL (set priority level)</li> <li>MTPS (move to Processor Status)</li> <li>MFPS (move from Processor Status)</li></ul> <h3>Access to other memory spaces</h3> <p>On PDP-11s that provide multiple instruction spaces and data spaces, a set of non-orthogonal Move instructions give access to other spaces. For example, routines in the operating system that handle run-time service calls use these instructions to exchange information with the caller. </p> <ul><li>MTPD (move to previous data space)</li> <li>MTPI (move to previous instruction space)</li> <li>MFPD (move from previous data space)</li> <li>MFPI (move from previous instruction space)</li></ul> <h2 id="example-code">Example code</h2> <p>The following PDP-11 <a href="/facts/Assembly_language/7XuV0cla">assembly</a> source code is for a subroutine named TOUPPER that converts a null-terminated <a href="/facts/ASCIIZ/Vt75UxVG">ASCIIZ</a> character string to upper case. </p> <table><tbody><tr><td>000000000000 010046000002 010146000004 016600 000006000010 112001000012 001414000014 120127 000172 000020 003373000022 120127 000141000026 002776000030 142740 000040000034 000766000036 012601000040 012600000042 000207</td><td>; TOUPPER:; Scan a null-terminated ASCII string, converting; all alphabetic characters to upper case.;; Entry stack parameters,; [SP+2] = Address of target string; [SP+0] = Return address;TOUPPER: MOV R0,-(SP) ; Save some registers MOV R1,-(SP) MOV 6(SP),R0 ; Get address of stringLOOP: MOVB (R0)+,R1 ; Get a character BEQ DONE ; If zero, then done CMPB R1, #’z ; Is it between a and z? BGT LOOP ; If not, get next char CMPB R1, #’a BLT LOOP BICB #40,-(R0) ; If a-z, then make it A-Z BR LOOPDONE: MOV (SP)+,R1 ; restore registers MOV (SP)+,R0 RTS PC ; Return from subroutine</td></tr></tbody></table> <p>The following PDP-11 <a href="/facts/Assembly_language/7XuV0cla">assembly</a> source code demonstrates how the PDP-11's addressing modes can be used to write the same routine with no general registers at all. </p> <table><tbody><tr><td>000000000000 105776 000002000004 001416000006 127627 000002 000172000014 003008000016 127627 000002 000141000024 002403000026 142776 000040 000002000034 005266 000002000040 000757000042 000207</td><td>; TOUPPER2:; Scan a null-terminated ASCII string, converting; all alphabetic characters to upper case.;; Entry stack parameters,; [SP+2] = Address of target string; [SP+0] = Return address;TOUPPER2: TSTB @2(SP) ; Test char at address on stack BEQ DONE ; If zero, then done CMPB @2(SP), #’z ; Is it between a and z? BGT NEXTC ; If not, point to next char CMPB @2(SP), #’a BLT NEXTC BICB #40,@2(SP) ; If a-z, then make it A-ZNEXTC: INC 2(SP) ; Inc address of next char on stack BR TOUPPER2DONE: RTS PC</td></tr></tbody></table> <h2 id="speed">Speed</h2> <p>PDP-11 processor speed varies by model, memory configuration, op code, and addressing modes. Instruction timings have up to three components: fetch/execute of the instruction itself and access time for the source and the destination. The last two components depend on the addressing mode. For example, on the PDP-11/70 (circa 1975), an instruction of the form ADD <i>x</i>(R<i>m</i>),<i>y</i>(R<i>n</i>) had a fetch/execute time of 1.35 <a href="/facts/Microsecond/zdW1DEb2">microseconds</a> plus source and destination times of 0.6 microseconds each, for a total instruction time of 2.55 microseconds. Any case where addressed memory is not in the cache adds 1.02 microseconds. The register-to-register ADD R<i>m</i>,R<i>n</i> can execute from the cache in 0.3 microseconds. Floating point is even more complex, since there is some overlap between the CPU and the floating-point processor, but in general, floating point is significantly slower. A single-precision floating add instruction ranges from 2.4 to 5.5 microseconds plus time to fetch the operands.<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a> </p> <h2 id="interrupts">Interrupts</h2> <p>The PDP-11 operates at a priority level from 0 through 7, specified by three bits in the <a href="/facts/Status_register/7KMY9LR9">Processor Status Word (PSW)</a>. High-end models can operate in a choice of modes, Kernel (privileged), User (application), and sometimes Supervisor, according to two bits in the PSW. </p><p>To request an interrupt, a bus device asserts one of four common bus lines, BR4 through BR7, until the processor responds. Higher numbers indicate greater urgency, perhaps that data might be lost or a desired sector might rotate out of contact with the read/write heads unless the processor responds quickly. The printer's readiness for another character is the lowest priority (BR4), as it remains ready indefinitely. If the processor is operating at level 5, then BR6 and BR7 are in order. If the processor is operating at 3 or lower, it will grant any interrupt; if at 7, it will grant none. Bus requests that are not granted are not lost but merely deferred; the device needing service continues to assert its bus request. </p><p>Whenever an interrupt exceeds the processor's priority level, the processor asserts the corresponding bus grant, BG4 through BG7. The bus-grant lines are not common lines but are a <a href="/facts/Daisy_chain_(electrical_engineering)/x1FsIB1E">daisy chain</a>: The input of each gate is the output of the previous gate in the chain. A gate is on each bus device, and a device physically closer to the processor is earlier in the daisy chain. If the device has made a request, then on sensing its bus-grant input, it concludes it is in control of the bus, and does not pass the grant signal to the next device on the bus. If the device has not made a request, it propagates its bus-grant input to its bus-grant output, giving the next closest device the chance to reply. (If devices do not occupy adjacent slots to the processor board, "grant continuity cards" inserted into the empty slots propagate the bus-grant line.) </p><p>Once in control of the bus, the device drops its bus request and places on the bus the memory address of the two-word vector that points to its interrupt service routine address and a new PSW. The processor saves the old <a href="/facts/Program_counter/BxqulBRq">program counter (PC)</a> and PSW, enters Kernel mode, and loads new values from the specified vector. For a device at BR6, the new PSW in its vector typically specifies 6 as the new processor priority, so the processor will honor more urgent requests (BR7) during the service routine, but defer requests of the same or lower priority. With the new PC, the processor jumps to the service routine for the interrupting device. That routine operates the device, at least removing the condition that caused the interrupt. The routine ends with the RTI (ReTurn from Interrupt) instruction, which restores PC and PSW as of just before the processor granted the interrupt. </p><p>If a bus request is made and no device responds to the bus grant, the processor times out and performs a trap that suggests bad hardware. </p> <h2 id="macro-11-assembly-language">MACRO-11 assembly language</h2> <p><a href="/facts/MACRO-11/lyzWyVg7">MACRO-11</a> is the <a href="/facts/Assembly_language/7XuV0cla">assembly language</a> for the PDP-11. It is the successor to <a href="/facts/PAL-11R/A7Jtv6rz">PAL-11</a> (Program Assembler Loader), an earlier version of the PDP-11 assembly language without macro facilities. MACRO-11 is supported on all DEC PDP-11 operating systems. PDP-11 <a href="/facts/Unix/0pNL2seI">Unix</a> systems also include an assembler (called "<a href="/facts/As_(Unix)/e4o6lqho">as</a>"), structurally similar to MACRO-11, but with different syntax and fewer features. </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/WD16/07sHjgJQ">WD16</a>, an extension of the PDP-11 ISA</li></ul> <h2 id="notes">Notes</h2> <h2 id="further-reading">Further reading</h2> <ul><li>Eckhouse, jr., Richard H.; Morris, L. Robert (1979). <i>Microcomputer Systems Organization, Programming and Applications (PDP-11)</i>. <a href="/facts/Englewood_Cliffs,_New_Jersey/gSQUlgvD">Englewood Cliffs, New Jersey</a>: <a href="/facts/Prentice-Hall/bynWAuat">Prentice-Hall</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-13-583914-9.</li> <li>Michael Singer, <i>PDP-11. Assembler Language Programming and Machine Organization</i>, John Wiley & Sons, NY: 1980.</li> <li><a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP1105-40_Handbook_1973.pdf"><i>pdp11 processor handbook - pdp11/05/10/35/40</i></a> (PDF). Digital Equipment Corporation. 1973.</li> <li><a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP11_Handbook1979.pdf"><i>pdp11 processor handbook - pdp11/04/34a/44/60/70</i></a> (PDF). Digital Equipment Corporation. 1979.</li></ul> <h2 id="external-links">External links</h2> <ul><li>PDP-11 Processor Handbook (Gordon Bell's <a href="http://gordonbell.azurewebsites.net/digital/pdp%2011%20handbook%201969.pdf">1969 edition</a>, <a href="http://www.bitsavers.org/pdf/dec/pdp11/handbooks/PDP11_Handbook1979.pdf">1979 edition at bitsavers</a> )</li> <li><a href="http://www.pdp11.org">Preserving the PDP-11 Series of 16-bit minicomputers</a></li> <li><a href="/facts/Gordon_Bell/kEsh4EwF">Gordon Bell</a> and Bill Strecker's 1975 paper, <a href="http://gordonbell.azurewebsites.net/digital/bell_strecker_what_we%20_learned_fm_pdp-11c%207511.pdf">What We Learned From the PDP-11</a></li> <li><a href="http://www.dbit.com">Ersatz-11</a>, a PDP-11 emulator</li> <li>Further papers and links on <a href="http://gordonbell.azurewebsites.net/digital/decmuseum.htm">Gordon Bell's site</a>.</li> <li><a href="http://www.eecis.udel.edu/~mills/gallery/gallery10.html">The Fuzzball</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. Retrieved 13 November 2015. <a href="http://bitsavers.trailing-edge.com/pdf/dec/pdp11/handbooks/PDP11_Handbook1979.pdf" target="_blank">http://bitsavers.trailing-edge.com/pdf/dec/pdp11/handbooks/PDP11_Handbook1979.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>"Chapter 7". processor handbook pdp11/05/10/35/40 (PDF). DEC. 1973. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP1105-40_Handbook_1973.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP1105-40_Handbook_1973.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. p. 421. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP11_Handbook1979.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP11_Handbook1979.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Dotzel, Günter (1986). "On LSI-11, RT-11, Megabytes of Memory and Modula-2/VRS" (PDF). <a href="http://www.modulaware.com/history/Vrsmot.pdf" target="_blank">http://www.modulaware.com/history/Vrsmot.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"The PDP11/40 Processor Handbook". Digital Equipment Corporation. Retrieved 16 July 2024. <a href="https://pdos.csail.mit.edu/6.828/2005/pdp11/pdp11-40-000107.html" target="_blank">https://pdos.csail.mit.edu/6.828/2005/pdp11/pdp11-40-000107.html</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>KDF11-BA CPU Module User's Guide (PDF). DEC. January 1982. p. 1-8. <a href="http://bitsavers.org/pdf/dec/pdp11/1123/KDF11BA_UsersManual.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/1123/KDF11BA_UsersManual.pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>PDP-11/24 System Technical Manual (PDF). DEC. June 1981. p. 4-3. EK-11024-TM-001. <a href="http://bitsavers.org/pdf/dec/pdp11/1124/EK-11024-TM-001_PDP11_24_System_Technical_Manual_Jun81.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/1124/EK-11024-TM-001_PDP11_24_System_Technical_Manual_Jun81.pdf</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>KE44-ACISP User's Guide (PDF). DEC. 1981. EK-KE44A-UG-002. <a href="http://bitsavers.org/pdf/dec/pdp11/1144/EK-KE44A-UG-002_KE44-A_CISP_Users_Guide_1981.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/1144/EK-KE44A-UG-002_KE44-A_CISP_Users_Guide_1981.pdf</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>The one-byte mask would imply there are eight subsets of 32 characters each, but this is not clearly stated in the documentation. <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>pdp11 processor handbook pdp11/04/34a/44/60/70 (PDF). DEC. 1979. <a href="http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf" target="_blank">http://bitsavers.org/pdf/dec/pdp11/handbooks/PDP-11_Handbook1979.pdf</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>DEC PDP-11/70 Processor Handbook, 1975, Appendix C, Instruction Timing. <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> </ol>