z80 Documented
z80 Documented
Copyright Statement
Copyright c 1997, 1998, 2001, 2003, 2005 Sean Young. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
Contents
1 Introduction 1.1 History . . . . . 1.2 Where to get this 1.3 Feedback . . . . 1.4 ChangeLog . . . . . . . . . document . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 5 5 5 6 7 7 8 8 9 9 11 11 11 12 12 13 14 14 15 15 16 16 17 17 17 17 19 19 19 20 21 21 23 23 24 24
2 Overview 2.1 History of the Z80 . 2.2 Registers . . . . . . . 2.3 Flags . . . . . . . . . 2.4 Power on defaults . . 2.5 Pin Descriptions [7] .
3 Undocumented Opcodes 3.1 CB Prex [5] . . . . . . . 3.2 DD Prex [5] . . . . . . . 3.3 FD Prex [5] . . . . . . . 3.4 ED Prex [5] . . . . . . . 3.5 DDCB Prex . . . . . . . 3.6 FDCB Prexes . . . . . . 3.7 Combinations of Prexes .
4 Undocumented Eects 4.1 BIT instructions . . . . . . . . 4.2 Memory Block Instructions [1] 4.3 I/O Block Instructions . . . . . 4.4 16 Bit I/O ports . . . . . . . . 4.5 Block Instructions . . . . . . . 4.6 16 Bit Additions . . . . . . . . 4.7 DAA Instruction . . . . . . . .
5 Interrupts 5.1 Non-Maskable Interrupts (NMI) . . . . . 5.2 Maskable Interrupts (INT) . . . . . . . . 5.3 Things aecting the Interrupt ip-ops . 5.4 HALT instruction . . . . . . . . . . . . . 5.5 Where interrupts are accepted . . . . . .
6 Timing and R register 6.1 R register and memory refresh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Other Information 7.1 Errors in ocial documentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii
CONTENTS 8 Instruction Tables 8.1 8-Bit Load Group . . . . . . . . . . . . . . . . . . . . . 8.2 16-Bit Load Group . . . . . . . . . . . . . . . . . . . . 8.3 Exchange, Block Transfer, Search Group . . . . . . . . 8.4 8-Bit Arithmetic and Logical Group . . . . . . . . . . 8.5 General-Purpose Arithmetic and CPU Control Group 8.6 16-Bit Arithmetic Group . . . . . . . . . . . . . . . . . 8.7 Rotate and Shift Group . . . . . . . . . . . . . . . . . 8.8 Bit Set, Reset and Test Group . . . . . . . . . . . . . 8.9 Jump Group . . . . . . . . . . . . . . . . . . . . . . . 8.10 Call and Return Group . . . . . . . . . . . . . . . . . 8.11 Input and Output Group . . . . . . . . . . . . . . . . 9 Instructions Sorted by Opcode 10 Instructions Sorted by MNemonic 11 GNU Free Documentation License 11.1 Applicability and Denitions . . . . . 11.2 Verbatim Copying . . . . . . . . . . . 11.3 Copying in Quantity . . . . . . . . . . 11.4 Modications . . . . . . . . . . . . . . 11.5 Combining Documents . . . . . . . . . 11.6 Collections of Documents . . . . . . . 11.7 Aggregation With Independent Works 11.8 Translation . . . . . . . . . . . . . . . 11.9 Termination . . . . . . . . . . . . . . . 11.10Future Revisions of This License . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 26 27 29 30 30 31 32 33 33 34 35 36 42 48 48 49 49 50 51 51 52 52 52 52
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
. . . . . . . . . . .
iii
Chapter 1
Introduction
1.1 History
(Sean) Ever since I rst started working on an MSX emulator, Ive been very interested in getting the emulation absolutely correct including the undocumented features. Not just to make sure that all games work, but also to make sure that if a program crashes, it crashes exactly the same way if running on an emulator as on the real thing. Only then is perfection achieved. I set about collecting information. I found pieces of information on the Internet, but not everything there is to know. So I tried to ll in the gaps, the results of which I put on my website. Various people have helped since then; this is the result of all those eorts and to my knowledge this document is the most complete.
(Jan) Interested in emulation for a long time, but a few years after Sean started writing this document, I have also started writing my own MSX emulator in 2003 and Ive used this document quite a lot. Now (2005) the Z80 emulation is nearing perfection, I decided to add what extra I have learned and comments various people have sent to Sean, to this document. I have restyled the document (although very little) to t my personal needs and I have checked a lot of things that were already in here.
1.2
A The latest version is always available in L TEX and pdf at the following location: http://www.myquest.nl/z80undocumented/
1.3
Feedback
I welcome any kind of feedback. I would like to hear about any corrections or additions you might have. Also note that there are a few ags which are still unknown, it would be great if someone found out how they work. You can reach me at jw@dds.nl and my website can be found at http://www.myquest.nl/z80undocumented/. Seans website is at http://www.msxnet.org/.
CHAPTER 1. INTRODUCTION
1.4
ChangeLog
18th September 2005 (version 0.91) Corrected a textual typo in the R register and memory refresh section, thanks to David Aubespin. Corrected the contradiction in the DAA section saying the NF ag was both aected and unchanged :) thanks to Dan Meir. Added an error in ocial documetation about that way Interrupt Mode 2 works, thanks to Aaldert Dekker. 15th Juni 2005 (version 0.9) Corrected improper notation of JP x,nn mnemonics in opcode list, thanks to Laurens Holst. Corrected a mistake in the INI, INIR, IND, INDR section and documented a mistake in ocial Z80 documentation concerning Interrupt Mode 2, thanks to Boris Donko. Thanks to Aaldert Dekker for his ideas, for verifying many assumptions and writing instruction exercisers for various instruction groups. 18th May 2005 (version 0.8) Added an alphabetical list of instructions for easy reference and corrected an error in the 16-bit arithmetic section, SBC HL, nn sets the N-ag just like other subtraction instructions, thanks to Fredrik Olsson for pointing that out. 4th April 2005 (version 0.7) I (Jan <jw@dds.nl>) will be maintaining this document from this version on. I restyled the document to x the page numbering issues, corrected an error in the I/O Block Instructions section, added graphics for the RLD and RRD instructions and corrected the spelling in several places. 20th November 2003 (version 0.6) Again, thanks to Ramsoft, added PF ag to OUTI, INI and friends. Minor x to DAA tables, other minor xes. 13th November 2003 (version 0.5) Thanks to Ramsoft, add the correct tables for the DAA instruction (section 4.7). Minor corrections & typos, thanks to Jim Battle, David Sutherland and most of all Fred Limouzin. September 2001 (version 0.4) Previous documents I had written were in plain text and Microsoft Word, which I now nd very embarrassing, so I decided to combine them all and A use L TEX. Apart from a full re-write, the only changed information is Power on defaults (section 2.4) and the algorithm for the CF and HF ags for OTIR and friends (section 4.3).
Chapter 2
Overview
2.1 History of the Z80
In 1969 Intel was approached by a Japanese company called Busicom to produce chips for Busicoms electronic desktop calculator. Intel suggested that the calculator should be built around a single-chip generalized computing engine and thus was born the rst microprocessor the 4004. Although it was based on ideas from much larger mainframe and mini-computers the 4004 was cut down to t onto a 16-pin chip, the largest that was available at the time, so that its data bus and address bus were each only 4-bits wide. Intel went on to improve the design and produced the 4040 (an improved 4-bit design) the 8008 (the rst 8-bit microprocessor) and then in 1974 the 8080. This last one turned out to be a very useful and popular design and was used in the rst home computer, the Altair 8800, and CP/M. In 1975 Federico Faggin who had had worked at Intel on the 4004 and its successors left the company and joined forces with Masatoshi Shima to from Zilog. At their new company Faggin and Shima designed a microprocessor that was compatible with Intels 8080 (it ran all 78 instructions of the 8080 in almost the same way that Intels chip did)1 but had many more abilities (an extra 120 instructions, many more registers, simplied connection to hardware). Thus was born the mighty Z80! and thus was the empire forged. The original Z80 was rst released in July 1976, coincidentally Jan was born in the very same month. Since then newer versions have appeared with much of the same architecture but running at higher speeds. The original Z80 ran with a clock rate of 2.5MHz, the Z80A runs at 4MHz, the Z80B at 6MHz and the Z80H at 8Mhz. Many companies produced machines based around Zilogs improved chip during the 1970s and 80s and because the chip could run 8080 code without needing any changes to the code the perfect choice of operating system was CP/M. Also Zilog has created a Z280, an enhanced version of the Zilog Z80 with a 16 bit architecture, introduced in July, 1987. It added an MMU to expand addressing to 16Mb, features for multitasking, a 256 byte cache, and a huge number of new opcodes (giving a total of over 2000!). Its internal clock runs at 2 or 4 times the external clock (e.g. a 16MHz CPU with a 4MHz bus The Z380 CPU incorporates advanced architectural while maintaining Z80/ Z180 object code compatibility. The Z380 CPU is an enhanced version of the Z80 CPU. The Z80 instruction set has been retained, adding a full compliment of 16-bit arithmetic and logical operations, multiply and divide, a complete set of register-to-register loads and exchanges, plus 32-bit load and exchange, and 32-bit arithmetic operations for address calculations. The addressing modes of the Z80 have been enhanced with Stack pointer relative loads and stores, 16-bit and 24- bit indexed osets and more exible indirect register addressing. All of the
1 Thanks to Jim Battle <frustum@pacbell.net>: the 8080 always puts the parity in the PF ag; VF does not exist and the timing is dierent. Possibly there are other dierences.
CHAPTER 2. OVERVIEW addressing modes allow access to the entire 32-bit addressing space.
2.2
Registers
The following accessible registers exist in the Z80. A BC DE HL IX IY PC SP I R AF BC DE HL F Accumulator and Flags General purpose registers Index registers Special purpose registers
For interrupts, there are two interrupt op-ops, IFF1 and IFF2, and the interrupt mode is retained. See chapter 5 for more about interrupts. Also there is an internal register which is described in section 4.3.
2.3
Flags
The conventional way of denoting the ags is with one letter, C for the carry ag for example. It could be confused with the C register, so Ive chosen to use the CF notation for ags. Also in previous things Ive written I called the two undocumented ags 5 and 3, but now Ive changed to the same notation used in MAME2 , which is YF and XF, respectively. Note that in mnemonics the original way is still maintained. bit ag 7 SF 6 ZF 5 YF 4 HF 3 XF 2 PF 1 NF 0 CF
SF ag Set if the 2-complement value is negative. Its simply a copy of the most signicant bit. ZF ag Set if the result is zero. YF ag A copy of bit 5 of the result. HF ag The half-carry of an addition/subtraction (from bit 3 to 4). Needed for BCD correction with DAA. XF ag A copy of bit 3 of the result. PF ag This ag can either be the parity of the result (PF), or the 2-compliment signed overow (VF): set if 2-compliment value doesnt t in the register. NF ag Shows whether the last operation was an addition (0) or an subtraction (1). This information is needed for DAA.3
2 http://www.mame.net/ 3 Wouldnt it be better to have separate instructions for DAA after addition and subtraction, like the 80x86 has in stead of sacricing a bit in the ag register?
CHAPTER 2. OVERVIEW CF ag The carry ag, set if there was a carry after the most signicant bit. Note that the only way to read the XF, YF and NF can only be read using PUSH AF.
2.4
Power on defaults
Matt4 has done some excellent research on this. He found that AF and SP are always set to FFFFh after a reset, and all other registers are undened (dierent depending on how long the CPU has been powered o, dierent for dierent Z80 chips). Of course the PC should be set to 0 after a reset, and so should the IFF1 and IFF2 ags (otherwise strange things could happen). Also since the Z80 is 8080 compatible, interrupt mode is probably 0. Probably the best way to simulate this in an emulator is set PC, IFF1, IFF2, IM to 0 and set all other registers to FFFFh.
2.5
This section might also relevant even if you dont do anything with hardware; it might give so insight into how the Z80 operates. Besides, it took me hours to draw this.
A11 A12 A13 A14 A15 CLK D4 D3 D5 D6 +5V D2 D7 D0 D1 INT NMI HALT MREQ IORQ 40 1 39 2 38 3 37 4 36 5 35 6 34 7 33 8 32 9 31 10 Z80 CPU 30 11 29 12 28 13 27 14 26 15 25 16 24 17 23 18 22 19 21 20
A15 A0 Address bus (output, active high, 3-state). This bus is used for accessing the memory and for I/O ports. During the refresh cycle the IR register is put on this bus. BUSACK Bus Acknowledge (output, active low). Bus Acknowledge indicates to the requesting device that the CPU address bus, data bus, and control signals MREQ, IORQ, RD and WR have been entered into their high-impedance states. The external device now control these lines. BUSREQ Bus Request (input, active low). Bus Request has a higher priority than NMI and is always recognised at the end of the current machine cycle. BUSREQ forces the CPU address bus, data bus and control signals MREQ, IORQ, RD and WR to go to a high-impedance state so that other devices can control these lines. BUSREQ is normally wired-OR and requires an external pullup for these applications. Extended BUSREQ periods due to extensive DMA operations can prevent the CPU from refreshing dynamic RAMs.
4 redame@xmission.com
CHAPTER 2. OVERVIEW D7 D0 Data Bus (input/output, active low, 3-state). Used for data exchanges with memory, I/O and interrupts. HALT Halt State (output, active low). Indicates that the CPU has executed a HALT instruction and is waiting for either a maskable or nonmaskable interrupt (with the mask enabled) before operation can resume. While halted, the CPU stops increasing the PC so the instruction is re-executed, to maintain memory refresh. INT Interrupt Request (input, active low). Interrupt Request is generated by I/O devices. The CPU honours a request at the end of the current instruction if IFF1 is set. INT is normally wired-OR and requires an external pullup for these applications. IORQ Input/Output Request (output, active low, 3-state). Indicates that the address bus holds a vailid I/O address for an I/O read or write operation. IORQ is also generated concurrently with M1 during an interrupt acknowledge cycle to indicate that an interrupt response vector can be placed on the databus. M1 Machine Cycle One (output, active low). M1, together with MREQ, indicates that the current machine cycle is the opcode fetch cycle of an instruction execution. M1, together with IORQ, indicates an interrupt acknowledge cycle. MREQ Memory Request (output, active low, 3-state). Indicates that the address holds a valid address for a memory read or write cycle operations. NMI Non-Maskable Interrupt (input, negative edge-triggered). NMI has a higher priority than INT. NMI is always recognised at the end of an instruction, independent of the status of the interrupt ip-ops and automatically forces the CPU to restart at location 0066h. RD Read (output, active low, 3-state). Indicates that the CPU wants to read data from memory or an I/O device. The addressed I/O device or memory should use this signal to place data onto the data bus. RESET Reset (input, active low). Initializes the CPU as follows: it resets the interrupt ip-ops, clears the PC and IR registes, and set the interrupt mode to 0. During reset time, the address bus and data bus go to a high-impedance state, and all control output signals go to the inactive state. Note that RESET must be active for a minimum of three full clock cycles before the reset operation is complete. Note that Matt found that SP and AF are set to FFFFh. RFSH Refresh (output, active low). RFSH, together with MREQ, indicates that the IR registers are on the address bus (note that only the lower 7 bits are useful) and can be used for the refresh of dynamic memories. WAIT Wait (input, active low). Indicates to the CPU that the addressed memory or I/O device are not ready for data transfer. The CPU continues to enter a wait state as long as this signal is active. Note that during this period memory is not refreshed. WR Write (output, active low, 3-state). Indicates that the CPU wants to write data to memory or an I/O device. The addressed I/O device or memory should use this signal to store the data on the data bus.
10
Chapter 3
Undocumented Opcodes
There are quite a few undocumented opcodes/instructions. This section should describe every possible opcode so you know what will be executed, whatever the value of the opcode is. The following prexes exist: CB, ED, DD, FD, DDCB and FDCB. Prexes change the way the following opcodes are interpreted. All instructions without a prex (not a value of one the above) are single byte opcodes1 , which are documented in the ocial documentation.
3.1
CB Prex [5]
An opcode with a CB prex is a rotate, shift or bit test/set/reset instruction. There are a few instructions missing from the ocial list, which are usually denoted with SLL (Shift Logical Left). It works like SLA, for one exception: it sets bit 0 (SLA resets it). CB30 CB31 CB32 CB33 CB34 CB35 CB36 CB37 SLL SLL SLL SLL SLL SLL SLL SLL B C D E H L (HL) A
3.2
DD Prex [5]
In general, the instruction following the DD prex is executed as is, but if the HL register is supposed to be used the IX register is used instead. Here are the rules: Any usage of HL is treated as an access to IX (except EX DE,HL and EXX and the ED prexed instructions that use HL). Any access to (HL) is changed to (IX+d), where d is a signed displacement byte placed after the main opcode except JP (HL), which isnt indirect anyway. The mnemonic should be JP HL. Any access to H is treated as an access to IXh (the high byte of IX) Except if (IX+d) is used as well. Any access to L is treated as an access to IXl (the low byte of IX) Except if (IX+d) is used as well.
1 Without
11
CHAPTER 3. UNDOCUMENTED OPCODES A DD prex before a CB selects a completely dierent instruction set, see Section 3.5. Some examples: Without DD prex LD H,(HL) LD H,A LD L,H JP (HL) LD DE,0 LD HL,0 With DD prex LD H,(IX+d) LD IXh,A LD IXl,IXh JP (IX) LD DE,0 LD IX,0
3.3
FD Prex [5]
This prex has the same eect as the DD prex, though IY is used instead of IX. Note LD IXl,IYh is not possible: only IX or IY is accessed in one instruction, never both.
3.4
ED Prex [5]
There are a number of undocumented EDxx instructions, of which most are duplicates of documented instructions. Any instruction not listed has no eect (same behaviour as 2 NOP instructions). The complete list except for the block instructions: ED40 ED41 ED42 ED43 ED44 ED45 ED46 ED47 ED48 ED49 ED4A ED4B ED4C ED4D ED4E ED4F ED50 ED51 ED52 ED53 ED54 ED55 ED56 ED57 ED58 IN B,(C) OUT (C),B SBC HL,BC LD (nn),BC NEG RETN IM 0 LD I,A IN C,(C) OUT (C),C ADC HL,BC LD BC,(nn) NEG RETI IM 0 LD R,A IN D,(C) OUT (C),D SBC HL,DE LD (nn),DE NEG RETN IM 1 LD A,I IN E,(C)
instruction
ED60 ED61 ED62 ED63 ED64 ED65 ED66 ED67 ED68 ED69 ED6A ED6B ED6C ED6D ED6E ED6F ED70 ED71 ED72 ED73 ED74 ED75 ED76 ED77 ED78
IN H,(C) OUT (C),H SBC HL,HL LD (nn),HL NEG RETN IM 0 RRD IN L,(C) OUT (C),L ADC HL,HL LD HL,(nn) NEG RETN IM 0 RLD IN (C) / IN F,(C) OUT (C),0 SBC HL,SP LD (nn),SP NEG RETN IM 1 NOP IN A,(C)
Undocumented
12
CHAPTER 3. UNDOCUMENTED OPCODES ED59 ED5A ED5B ED5C ED5D ED5E ED5F OUT (C),E ADC HL,DE LD DE,(nn) NEG RETN IM 2 LD A,R ED79 ED7A ED7B ED7C ED7D ED7E ED7F OUT (C),A ADC HL,SP LD SP,(nn) NEG RETN IM 2 NOP
The ED70 instruction reads from I/O port C, but does not store the result. It just aects the ags like the other IN x,(C) instructions. ED71 simply outs the value 0 to I/O port C. The ED63 is a duplicate of the 22 opcode (LD (nn),HL) and similarly ED6B is a duplicate of the 2A opcode. Of course the timings are dierent. These instructions are listed in the ocial documentation. According to Gerton Lunter2 : The instructions ED 4E and ED 6E are IM 0 equivalents: when FF was put on the bus (physically) at interrupt time, the Spectrum continued to execute normally, whereas when an EF (RST 28h) was put on the bus it crashed, just as it does in that case when the Z80 is in the ocial interrupt mode 0. In IM 1 the Z80 just executes a RST 38h (opcode FF) no matter what is on the bus. All the RETI/RETN instructions are the same, all like the RETN instruction. So they all, including RETI, copy IFF2 to IFF1. More information on RETI and RETN and IM x is in section 5.3.
3.5
DDCB Prex
The undocumented DDCB instructions store the result (if any) of the operation in one of the seven all-purpose registers, which one depends on the lower 3 bits of the last byte of the opcode (not operand, so not the oset). 000 001 010 011 100 101 110 111 B C D E H L (none: documented opcode) A
The documented DDCB0106 is RLC (IX+01h). So, clear the lower three bits (DDCB0100) and something is done to register B. The result of the RLC (which is stored in (IX+01h)) is now also stored in register B. Eectively, it does the following: LD B,(IX+01h) RLC B LD (IX+01h),B So you get double value for money. The result is stored in B and (IX+01h). The most common notation is: RLC (IX+01h),B Ive once seen this notation: RLC (IX+01h) LD B,(IX+01h)
2 gerton@math.rug.nl
13
CHAPTER 3. UNDOCUMENTED OPCODES Thats not correct: B contains the rotated value, even if (IX+01h) points to ROM. The DDCB SET and RES instructions do the same thing as the shift/rotate instructions: DDCB10C0 DDCB10C1 DDCB10C2 DDCB10C3 DDCB10C4 DDCB10C5 DDCB10C6 DDCB10C7 SET SET SET SET SET SET SET SET 0,(IX+10h),B 0,(IX+10h),C 0,(IX+10h),D 0,(IX+10h),E 0,(IX+10h),H 0,(IX+10h),L 0,(IX+10h) - documented instruction 0,(IX+10h),A
So for example with the last instruction, the value of (IX+10h) with bit 0 set is also stored in register A. The DDCB BIT instructions do not store any value; they merely test a bit. Thats why the undocumented DDCB BIT instructions are no dierent from the ocial ones: DDCB DDCB DDCB DDCB DDCB DDCB DDCB DDCB d d d d d d d d 78 79 7A 7B 7C 7D 7E 7F BIT BIT BIT BIT BIT BIT BIT BIT 7,(IX+d) 7,(IX+d) 7,(IX+d) 7,(IX+d) 7,(IX+d) 7,(IX+d) 7,(IX+d) - documented instruction 7,(IX+d)
3.6
FDCB Prexes
3.7
Combinations of Prexes
This part may be of some interest to emulator coders. Here we dene what happens if strange sequences of prexes appear in the instruction cycle of the Z80. If CB or ED is encountered, that byte plus the next make up an instruction. FD or DD should be seen as prex setting a ag which says use IX or IY in stead of HL, and not an instruction. In a large sequence of DD and FD bytes, it is the last one that counts. Also any other byte (or instruction) resets this ag. FD DD 00 21 00 10 NOP NOP NOP LD HL,1000h
14
Chapter 4
Undocumented Eects
4.1 BIT instructions
BIT n,r behaves much like AND r,2n with the result thrown away, and CF ag unaected. Compare BIT 7,A with AND 80h: ag YF and XF are reset, SF is set if bit 7 was actually set; ZF is set if the result was 0 (bit was reset), and PF is eectively set if ZF is set (the result of the AND leaves either no bits set (PF set - parity even) or one bit set (PF reset - parity odd). So the rules for the ags are: SF ag Set if n = 7 and tested bit is set. ZF ag Set if the tested bit is reset. YF ag Set if n = 5 and tested bit is set. HF ag Always set. XF ag Set if n = 3 and tested bit is set. PF ag Set just like ZF ag. NF ag Always reset. CF ag Unchanged. This is where things start to get strange. With the BIT n,(IX+d) instructions, the ags behave just like the BIT n,r instruction, except for YF and XF. These are not copied from the result but from something completely dierent, namely bit 5 and 3 of the high byte of IX+d (so IX plus the displacement). Things get more bizarre with the BIT n,(HL) instruction. Again, except for YF and XF the ags are the same. YF and XF are copied from some sort of internal register. This register is related to 16 bit additions. Most instructions do not change this register. Unfortunately, I havent tested all instructions yet, but here is the list so far. ADD HL,xx Use the high byte of HL, ie. H before the addition. LD r,(IX+d) Use high byte of the resulting address IX+d. JR d Use high byte target address of the jump. LD r,r Doesnt change this register. Any help here would be most appreciated!
15
4.2
The LDI/LDIR/LDD/LDDR instructions aect the ags in a strange way. At every iteration, a byte is copied. Take that byte and add the value of register A to it. Call that value n. Now, the ags are: YF ag A copy of bit 1 of n. HF ag Always reset. XF ag A copy of bit 3 of n. PF ag Set if BC not 0. SF, ZF, CF ags These ags are unchanged. And now for CPI/CPIR/CPD/CPDR. This instruction compares a series of bytes in memory to register A. Eectively, it can be said it does CP (HL) at every iteration. The result of that compare sets the HF ag, which is important for the next step. Take the value of register A, subtract the value of the memory address, and nally subtract the value of HF ag, which is set or reset by the hypothetical CP (HL). So, n = A - (HL) - HF. SF, ZF, HF ags Set by the hypothetical CP (HL). YF ag A copy of bit 1 of n. XF ag A copy of bit 3 of n. PF ag Set if BC is not 0. NF ag Always set. CF ag Unchanged.
4.3
These are the most be bizarre instructions, as far as ags is concerned. Ramsoft found all of the ags. The out instructions behave dierently than the in instructions, which doesnt make the CPU very symmetrical. First of all, all instructions aect the following ags: SF, ZF, YF, XF ags Aected by decreasing register B, as in DEC B. NF ag A copy of bit 7 of the value read from or written to an I/O port. And now the for OUTI/OTIR/OUTD/OTDR instructions. Take state of the L after the increment or decrement of HL; add the value written to the I/O port to; call that k for now. If k > 255, then the CF and HF ags are set. The PF ags is set like the parity of k bitwise anded with 7, bitwise xored with B. HF and CF Both set if ((HL) + L > 255) PF The parity of ((((HL) + L) & 7) xor B) INI/INIR/IND/INDR use the C register in stead of the L register. There is a catch though, because not the value of C is used, but C + 1 if its INI/INIR or C - 1 if its IND/INDR. So, rst of all INI/INIR: HF and CF Both set if ((HL) + ((C + 1) & 255) > 255) 16
CHAPTER 4. UNDOCUMENTED EFFECTS PF The parity of (((HL) + ((C + 1) & 255)) & 7) xor B) And last IND/INDR: HF and CF Both set if ((HL) + ((C - 1) & 255) > 255) PF The parity of (((HL) + ((C - 1) & 255)) & 7) xor B)
4.4
Ocially the Z80 has an 8 bit I/O port address space. When using the I/O ports, the 16 address lines are used. And in fact, the high 8 bit do actually have some value, so you can use 65536 ports after all. IN r,(C), OUT (C),r, and the Block I/O instructions actually place the entire BC register on the address bus. Similarly IN A,(n) and OUT (n),A put A 256 + n on the address bus. The INI/INIR/IND/INDR instructions use BC after decrementing B, and the OUTI/OTIR/OUTD/OTDR instructions before.
4.5
Block Instructions
The repeated block instructions simply decrease the PC by two so the instruction is simply reexecuted. So interrupts can occur during block instructions. So, LDIR is simply LDI + if BC is not 0, decrease PC by 2.
4.6
16 Bit Additions
The 16 bit additions are a bit more complicated than 8 bit ones. Since the Z80 is an 8-bit CPU, 16 bit additions are done in two stages: rst the lower bytes are added, then the two higher bytes. The SF, YF, HF, XF ags are aected as by the second (high) 8 bit addition. ZF is set if the whole 16 bit result is 0.
4.7
DAA Instruction
This instruction is useful when youre using BCD values. After an addition or subtraction, DAA corrects the value back to BCD again. Note that it uses the CF ag, so it cannot be used after INC and DEC. Stefano Donati from Ramsoft1 has found the tables which describe the DAA operation. The input is the A register and the CF, NF, HF ags. Result is as follows: Depending on the NF ag, the di from this table must be added (NF is reset) or subtracted (NF is set) to A.
1 http://www.ramsoft.bbk.org/
17
CHAPTER 4. UNDOCUMENTED EFFECTS CF 0 0 0 0 1 1 1 0 0 high nibble 0-9 0-9 0-8 a-f * * * 9-f a-f HF 0 1 * 0 0 1 * * 1 low nibble 0-9 0-9 a-f 0-9 0-9 0-9 a-f a-f 0-9 di 00 06 06 60 60 66 66 66 66
The CF ag is aected as follows: CF 0 0 0 0 1 high nibble 0-9 0-8 9-f a-f * low nibble 0-9 a-f a-f 0-9 * CF 0 0 1 1 1
The HF ags is aected as follows: NF 0 0 1 1 1 HF * * 0 1 1 low nibble 0-9 a-f * 6-f 0-5 HF 0 1 0 0 1
SF, YF, XF are copies of bit 7,5,3 of the result respectively; ZF is set according to the result and NF is always unchanged.
18
Chapter 5
Interrupts
There are two types of interrupts, maskable and non-maskable. The maskable type is ignored if IFF1 is reset. Non-maskable interrupts (NMI) will are always accepted, and they have a higher priority, so if the two are requested at the same time the NMI will be accepted rst. For the interrupts, the following things are important: Interrupt Mode (set with the IM 0, IM 1, IM 2 instructions), the interrupt ip-ops (IFF1 and IFF2), and the I register. When a maskable interrupt is accepted, a external device can put a value on the databus. Both types of interrupts increase the R register by one, when accepted.
5.1
When a NMI is accepted, IFF1 is reset. At the end of the routine, IFF1 must be restored (so the running program is not aected). Thats why IFF2 is there; to keep a copy of IFF1. An NMI is accepted when the NMI pin on the Z80 is made low (edge-triggered). The Z80 responds to the change of the line from +5 to 0 so the interrupt line doesnt have a state, its just a pulse. When this happens, a call is done to address 0066h and IFF1 is reset so the routine isnt bothered by maskable interrupts. The routine should end with an RETN (RETurn from Nmi) which is just a usual RET, but also copies IFF2 to IFF1, so the IFFs are the same as before the interrupt. You can check whether interrupts were disabled or not during an NMI by using the LD A,I or LD A,R instruction. These instructions copy IFF2 to the PF ag. Accepting an NMI costs 11 t-states.
5.2
If the INT line is low and IFF1 is set, a maskable interrupt is accepted whether or not the last INT routine has nished. Thats why you should not enable interrupts during such a routine, and make sure that the device that generated it has put the INT line up again before ending the routine. So unlike NMI interrupts, the interrupt line has a state; its not a pulse. When an INT is accepted, both IFF1 and IFF2 are cleared, preventing another interrupt from occurring which would end up as an innite loop (and overowing the stack). What happens next depends on the Interrupt Mode. A device can place a value on the databus when the interrupt is accepted. Some computer systems do not utilize this feature, and this value ends up being FFh. Interrupt Mode 0 This is the 8080 compatibility mode. The instruction on the bus is executed (usually an RST instruction, but it can be anything. The I register is not used. Assuming it a RST instruction, accepting this takes 13 t-states.
19
CHAPTER 5. INTERRUPTS Interrupt Mode 1 An RST 38h is executed, no matter what value is put on the bus or what value the I register has. Accepting this type costs 13 t-states. Interrupt Mode 2 A call is made to the address read from memory. What address is read from is calculated as follows: (I register) 256 + (value on bus). Zilogs user manual states (very convincingly) that the least signicant bit of the address is always 0, so they calculate the address that is read from as: (I register) 256 + (value on bus & 0xFE). I have tested this and it not correct. Of course a word (two bytes) are read, making the address where the call is made to. In this way, you can have a vector table for interrupts. Accepting this of interrupt type costs 19 t-states. At the end of a maskable interrupt, the interrupts should be enabled again. You can assume that was the state of the IFFs because otherwise the interrupt wasnt accepted. So, an INT routine always ends with an EI and a RET (RETI according to the ocial documentation, more about that later): INT: . . . EI RETI or RET Note a fact about EI: a maskable interrupt isnt accepted directly after it, so the next opportunity for an interrupt is after the RETI. This is very useful; if the INT line is still low, an interrupt is accepted again. If this happens a lot and the interrupt is generated before the RETI, the stack could overow (since the routine would be called again and again). But this property of EI prevents this. DI is not necessary at the start of the interrupt routine: the interrupt ip-ops are cleared when accepting the interrupt. You can use RET instead of RETI, depending on the hardware setup. RETI is only useful if you have something like a Z80 PIO to support daisy-chaining: queuing interrupts. The PIO can detect that the routine has ended by the opcode of RETI, and let another device generate an interrupt. That is why I called all the undocumented EDxx RET instructions RETN: All of them operate alike, the only dierence of RETI is its specic opcode which the Z80 PIO recognises.
5.3
All the IFF related things are: CPU reset DI EI Accept INT Accept NMI RETI/N LD A,I/LD A,R
If youre working with a Z80 system without NMIs (like the MSX), you can forget all about the two separate IFFs; since a NMI isnt ever generated, the two will always be the same. Some documentation says that when an NMI is accepted, IFF1 is rst copied into IFF2 before IFF1 is cleared. If this is true, the state of IFF2 is lost after a nested NMI, which is undesirable. Have tested this in the following way: make sure the Z80 is in EI mode, generate an NMI. In the 20
CHAPTER 5. INTERRUPTS NMI routine, wait for another NMI before executing RETN. In the second NMI IFF2 was still set, so IFF1 is not copied to IFF2 when accepting an NMI. Another interesting fact is this. I was trying to gure out whether the undocumented ED RET instructions were RETN or RETI. I tested this by putting the machine in EI mode, wait for an NMI and end with one of the ED RET instructions. Then execute a HALT instruction. If IFF1 was not restored, the machine would hang but this did not happen with any of the instructions, including the documented RETI! Since every INT routine must end with EI followed by RETI ocially, It does not matter that RETI copies IFF2 into IFF1; both are set anyway.
5.4
HALT instruction
The HALT instruction halts the Z80; it does not increase the PC so that the instruction is reexecuted, until a maskable or non-maskable interrupt is accepted. Only then does the Z80 increase the PC again and continues with the next instruction. During the HALT state, the HALT line is set. The PC is increased before the interrupt routine is called.
5.5
During execution of instructions, interrupts wont be accepted. Only between instructions. This is also true for prexed instructions. Directly after an EI or DI instruction, interrupts arent accepted. Theyre accepted again after the instruction after the EI (RET in the following example). So for example, look at this MSX2 routine that reads a scanline from the keyboard: LD DI IN AND ADD OUT EI IN RET C,A A,(0AAh) 0F0h A,C (0AAh),A A,(0A9h)
You can assume that there never is an interrupt after the EI, before the IN A,(0A9h) which would be a problem because the MSX interrupt routine reads the keyboard too. Using this feature of EI, it is possible to check whether it is true that interrupts are never accepted during instructions: DI make sure INT is active EI insert instruction to test INT: store PC where INT was accepted RET And yes, for all instructions, including the prexed ones, interrupts are never accepted during an instruction. Only after the tested instruction. Remember that block instructions simply reexecute themselves (by decreasing the PC with 2) so an interrupt is accepted after each iteration. Another predictable test is this: at the insert instruction to test insert a large sequence of EI instructions. Of course, during execution of the EI instructions, no interrupts are accepted. 21
CHAPTER 5. INTERRUPTS But now for the interesting stu. ED or CB make up instructions, so interrupts are accepted after them. But DD and FD are prexes, which only slightly aects the next opcode. If you test a large sequence of DDs or FDs, the same happens as with the EI instruction: no interrupts are accepted during the execution of these sequences. This makes sense, if you think of DD and FD as a prex which set the use IX instead of HL or use IY instead of HL ag. If an interrupt was accepted after DD or FD, this ag information would be lost, and: DD 21 00 00 LD IX,0 could be interpreted as a simple LD HL,0 if the interrupt was after the last DD. Which never happens, so the implementation is correct. Although I havent tested this, as I imagine the same holds for NMI interrupts.
22
Chapter 6
During every rst machine cycle (beginning of an instruction or part of it prexes have their own M1 two), the memory refresh cycle is issued. The whole IR register is put on the address bus, and the RFSH pin is lowered. It is unclear whether the Z80 increases the R register before or after putting IR on the bus. The R register is increased at every rst machine cycle (M1). Bit 7 of the register is never changed by this; only the lower 7 bits are included in the addition. So bit 7 stays the same, but it can be changed using the LD R,A instruction. Instructions without a prex increase R by one. Instructions with an ED, CB, DD, FD prex, increase R by two, and so do the DDCBxxxx and FDCBxxxx instructions (weird enough). Just a stray DD or FD increases the R by one. LD A,R and LD R,A access the R register after it is increased (by the instruction itself). Remember that the block instructions simply decrease the PC with two, so the instructions are re-executed. So LDIR increased R by BC times 2 (note that in the case of BC = 0, R is increased by 10000h times 2, eectively 0). Accepting an maskable or non-maskable interrupt increases the R by one. After a hardware reset, or after power on, the R register is reset to 0. That should cover all there is to say about the R register. It is often used in programs for a random value, which is good but of course not truly random.
23
Chapter 7
Other Information
7.1 Errors in ocial documentation
In some ocial Zilog documentation, the are some errors. Some dont have all of these mistakes, so your documentation may not be awed but these are just things to look out for. The Flag aection summary table shows that LDI/LDIR/LDD/LDDR instructions leave the SF and ZF in an undened state. This is not correct; the SF and ZF ags are unaected (like the same documentation says). Similarly, the same table shows that CPI/CPIR/CPD/CPDR leave the SF and HF ags in an undened state. Not true, they are aected as dened elsewhere in the documentation. Also, the table says about INI/OUTD/etc Z=0 if B <> 0 otherwise Z=0; of course the latter should be Z=1. The INI/INIR/IND/INDR/OUTI/OUTD/OTIR/OTDR instructions do aect the CF ag (some ocial documentation says they leave it unaected, important!) and the NF ag isnt always set but may also be reset (see 4.3 for exact operation). When an NMI is accepted, the IFF1 isnt copied to IFF2. Only IFF1 is reset. In the 8-bit Load Group, the last two bits of the second byte of the LD r,(IX + d) opcode should be 10 and not 01. In the 16-bit Arithmetic Group, bit 6 of the second byte of the ADD IX, pp opcode should be 0, not 1. IN x,(C) resets the HF ag, it never sets it. Some documentation states it is set according to the result of the operation; this is impossible since no arithmetic is done in this instruction. Note: In zilogs own Z80 User Manual (z80cpu um.pdf), there are also errors, some are very confusing, I will mention the ones I have found here: page 21, gure 2 says the Alternative Register Set contains 2 B registers, this should ofcourse be B and C. page 26, gure 16 shows very convincingly that the least signicant bit of the address to read for Interrupt Mode 2 is always 0. I have tested this and it is not correct, it can also be 1, in my testcase the bus contained 0xFF and the address that was read did not end in 0xFE but was 0xFF.
24
Bibliography
[1] Mark Rison Z80 page for !CPC.
http://www.acorn.co.uk/mrison/en/cpc/tech.html
[2] YAZE (Yet Another Z80 Emulator). This is a CPM emulator by Frank Cringle. It emulates almost every undocumented ag, very good emulator. Also includes a very good instruction exerciser and is released under the GPL.
ftp://ftp.ping.de/pub/misc/emulators/yaze-1.10.tar.gz
Note: the instruction exerciser zexdoc/zexall does not test I/O instructions and not all normal instructions (for instance LD A,(IX+n) is tested, but not with dierent values of n, just n=1, values above 128 (LD A,(IX-n) are not tested) but it still gives a pretty good idea of how well a simulated Z80 works. [3] Z80 Family Ocial Support Page by Thomas Scherrer. Very good your one-stop Z80 page.
http://www.geocities.com/SiliconValley/Peaks/3938/z80 home.htm
[5] Gerton Lunters Spectrum emulator (Z80). In the package there is a le TECHINFO.DOC, which contains a lot of interesting information. Note that the current version can only be unpacked in Windows.
ftp://ftp.void.jump.org/pub/sinclair/emulators/pc/dos/z80-400.zip
[6] Mostek Z80 Programming Manual a very good reference to the Z80. [7] Z80 Product Specication, from MSX2 Hardware Information.
http://www.hardwareinfo.msx2.com/pdf/Zilog/z80.pdf
25
Chapter 8
Instruction Tables
8.1
Mnemonic LD r,r LD p,p LD q,q LD r,n LD p,n LD q,n LD r,(HL) LD r,(IX+d) LD r,(IY+d) LD (HL),r LD (IX+d),r LD (IY+d),r LD (HL),n LD (IX+d),n
LD (IY+d),n
(continued)
26
YF
PF
NF
CF
IFF2 0 IFF2 0
8.2
Mnemonic LD dd,nn LD IX,nn
LD IY,nn
IXnn
LD HL,(nn) H(nn+1) L(nn) LD dd,(nn) ddh(nn+1) ddl(nn) LD IX,(nn) IXh(nn+1) IXl(nn) LD IY,(nn) IYh(nn+1) IYl(nn) LD (nn),HL (nn+1)H (nn)L LD (nn),dd (nn+1)ddh (nn)ddl LD (nn),IX (nn+1)IXh (nn)IXl LD (nn),IY (nn+1)IYh (nn)IYl LD SP,HL LD SP,IX LD SP,IY SPHL SPIX SPIY
(continued)
27
28
8.3
Mnemonic EX DE,HL EX AF,AF EXX
Symbolic Operation SF ZF DEHL AFAF BCBC DEDE HLHL EX (SP),HL H(SP+1) L(SP) EX (SP),IX IXh(SP+1) IXl(SP) EX (SP),IY IYh(SP+1) IYl(SP) LDI (DE)(HL) DEDE+1 HLHL+1 BCBC-1 LDIR (DE)(HL) DEDE+1 HLHL+1 BCBC-1 Repeat until BC=0 LDD (DE)(HL) DEDE-1 HLHL-1 BCBC-1 LDDR (DE)(HL) DEDE-1 HLHL-1 BCBC-1 Repeat until BC=0 4 3 CPI A-(HL) HLHL+1 BCBC-1 4 3 CPIR A-(HL) HLHL+1 BCBC-1 Repeat until A=(HL) or BC=0 A-(HL) HLHL-1 BCBC-1 A-(HL)
Flags HF XF 0
4
PF
1
NF 0
CF
Opcode M T 76 543 210 Hex Bytes Cycles States Comments 11 101 011 EB 1 1 4 00 001 000 08 1 1 4 11 011 001 D9 1 1 4 11 100 011 11 11 11 11 11 10 011 100 111 100 101 100 101 011 101 011 101 000 E3 DD FD ED A0 ED B0 1 2 2 2 5 6 6 4 19 23 23 16
02 0
2 2
5 4
21 16
if BC=0 if BC=0
ED A8 ED B8
16
02 0
2 2
5 4
21 16
if BC=0 if BC=0
1 1
ED A1 ED B1
2 2 2
4 5 4
CPD CPDR
1 1
ED A9 ED
2 2 2
4 5 4
Note:
HLHL-1 10 111 001 B9 BCBC-1 Repeat until A=(HL) or BC=0 1 PF is 0 the result of BC-1=0, otherwise PF is set. 2 PF is 0 only at completion of the instruction. 3 ZF is set if A=(HL), otherwise ZF is reset. 4 See section 4.2 for a description.
29
8.4
Mnemonic ADD A,r ADD A,p
Flags Opcode M T SF ZF YF HF XF PF NF CF 76 543 210 Hex Bytes Cycles States Comments VF 0 10 000 r 1 1 4 r Reg VF 0 11 011 101 DD 2 2 8 000 B 10 000 p 001 C ADD A,q AA+q VF 0 11 111 101 FD 2 2 8 010 D 10 000 q 011 E ADD A,n AA+n VF 0 11 000 110 2 2 7 100 H n 101 L 1 2 7 111 A ADD A,(HL) AA+(HL) VF 0 10 000 110 ADD A,(IX+d) AA+(IX+d) VF 0 11 011 101 DD 3 5 19 10 000 110 d p Reg ADD A,(IY+d) AA+(IY+d) VF 0 11 111 101 FD 3 5 19 000 B 10 000 110 001 C d 010 D ADC A,s AA+s+CF VF 0 001 011 E SUB s AA-s VF 1 010 100 IXh SBC A,s AA-s-CF VF 1 011 101 IXl AND s AAs 1 PF 0 0 100 111 A 110 OR s AAs 0 PF 0 0 XOR s AAs 0 PF 0 0 101 1 1 CP s A-s VF 1 111 q Reg INC r rr+1 VF 0 00 r 100 1 1 4 000 B INC p pp+1 VF 0 11 011 101 DD 2 2 8 001 C 00 p 100 010 D INC q qq+1 VF 0 11 111 101 FD 2 2 8 011 E 100 IYh 00 q 100 INC (HL) (HL)(HL)+1 VF 0 00 110 100 1 3 11 101 IYl INC (IX+d) (IX+d)(IX+d)+1 VF 0 11 011 101 DD 3 6 23 111 A 00 110 100 d INC (IY+d) (IY+d)(IY+d)+1 VF 0 11 111 101 FD 3 6 23 00 110 100 d DEC m mm-1 VF 1 101 1 Note: YF and XF flags are copied from the operand s, not the result A-s s is any of r, p, q, n, (HL), (IX+d), (IY+d) as shown for ADD. The indicated bits replace the 000 in the ADD set above m is any of r, p, q, (HL), (IX+d), (IY+d) as shown for INC. Replace 100 with 101 in opcode
8.5
Symbolic Flags Opcode M T Mnemonic Operation SF ZF YF HF XF PF NF CF 76 543 210 Hex Bytes Cycles States Comments DAA PF 00 100 111 27 1 1 4 Decimal adjust accumulator CPL A A 1 1 00 101 111 2F 1 1 4 Compliment NEG A0-A VF 1 11 101 101 ED 2 2 8 Negate 01 000 100 44 CCF CF CF 1 2 1 0 00 111 111 3F 1 1 4 SCF CF1 1 0 1 0 1 00 110 111 37 1 1 4 NOP 00 000 000 00 1 1 4 HALT 01 110 110 76 1 1 4 3 DI IFF1,20 11 110 011 F3 1 1 4 3 EI IFF1,21 11 111 011 FB 1 1 4 4 IM 0 11 101 101 ED 2 2 8 01 000 110 46 4 IM 1 11 101 101 ED 2 2 8 01 010 110 56 IM 24 11 101 101 ED 2 2 8 01 011 110 5E 1 Note: YF and XF are copied from register A. 2 HF is like CF before the instruction. 3 No interrupts are accepted directly after EI or DI. 4 This instruction has other undocumented opcodes.
30
8.6
Symbolic Flags Opcode M T Mnemonic Operation SF ZF YF HF XF PF NF CF 76 543 210 Hex Bytes Cycles States Comments ADD HL,ss HLHL+ss 2 2 2 0 1 00 ss1 001 1 3 11 ss Reg ADC HL,ss HLHL+ss+CF 1 1 2 2 2 VF1 0 1 11 101 101 ED 2 4 15 00 BC 01 ss1 010 01 DE 1 1 2 2 2 1 1 SBC HL,ss HLHL-ss-CF VF 1 11 101 101 ED 2 4 15 10 HL 01 ss0 010 11 SP 2 2 2 1 ADD IX,pp IXIX+pp 0 11 011 110 DD 2 4 15 00 pp1 001 pp Reg ADD IY,qq IYIY+qq 2 2 2 0 1 11 111 110 FD 2 4 15 00 BC 00 qq1 001 01 DE INC ss ssss+1 00 ss0 011 1 1 6 10 IX INC IX IXIX+1 11 011 101 DD 2 2 10 11 SP 00 100 011 23 INC IY IYIY+1 11 111 101 FD 2 2 10 qq Reg 00 100 011 23 00 BC DEC ss ssss-1 00 ss1 011 1 1 6 01 DE DEC IX IXIX-1 11 011 101 DD 2 2 10 10 IY 00 101 011 2B 11 SP DEC IY IYIY-1 11 111 101 FD 2 2 10 00 101 011 2B 1 Note: Flag is affected by the 16 bit result. 2 Flag is affected by the high-byte addition.
31
8.7
Mnemonic RLCA RLA RRCA RRA RLC r RLC (HL)
- 70 - CF - 70- CF
CF 70 CF 70 CF 70
PF 0 PF 0 PF 0
RLC (IX+d)
RLC (IY+d)
CF 70
PF 0
FD CB DD CB FD CB
23
RLC (IX+d),r r(IX+d) RLC r (IX+d)r RLC (IY+d),r r(IY+d) RLC r (IY+d)r RL m RRC m RR m SLA m SLL m SRA m SRL m RLD RRD Note: CF 70 - 70 - CF - 70- CF 0 CF 70 1 CF 70 - 70- CF - 70- CF 0 ?
PF 0
23
PF 0
23
0 0 0 0 0 0 0 0 0
PF 0 PF 0 PF 0 PF 0 PF 0 PF 0 PF 0 PF 0 PF 0
A 7-4 3-0 7-4 3-0 (HL) A 7-4 3-0 7-4 3-0 (HL)
6 6 ?? 6
m is one of r,(HL),(IX+d),(IY+d).
11 101 101 ED 2 5 18 01 100 111 67 To form new opcode replace 000 of RLCs with shown code.
32
8.8
Mnemonic BIT b,r
Flags Opcode M T SF ZF YF HF XF PF NF CF 76 543 210 Hex Bytes Cycles States Comments 1 1 1 1 1 0 11 001 011 CB 2 2 8 r Reg 01 b r 000 B 1 1 1 1 BIT b,(HL) ZF (HL)b 1 0 11 001 011 CB 2 3 12 001 C 01 b 110 010 D 1 BIT b,(IX+d)2 ZF (IX + d)b 1 1 1 1 0 11 011 101 DD 4 5 20 011 E 11 001 011 CB 100 H d 101 L 01 b 110 111 A 1 BIT b,(IY+d)2 ZF (IY + d)b 1 1 1 1 0 11 111 101 FD 4 5 20 11 001 011 CB d 01 b 110 SET b,r rb 1 11 001 011 CB 2 2 8 b Bit 11 b r 000 0 SET b,(HL) (HL)b 1 11 001 011 CB 2 4 15 001 1 11 b 110 010 2 SET b,(IX+d) (IX + d)b 1 11 011 101 DD 4 6 23 011 3 11 001 011 CB 100 4 d 101 5 11 b 110 110 6 SET b,(IY+d) (IY + d)b 1 11 111 101 FD 4 6 23 111 7 11 001 011 CB d 11 b 110 SET b,(IX+d),r r(IX+d) 11 011 101 DD 4 6 23 rb 1 11 001 011 CB (IX+d)r d 11 b r SET b,(IY+d),r r(IY+d) 11 111 101 FD 4 6 23 rb 1 11 001 011 CB (IY+d)r d 11 b r RES b,m mb 0 10 1 Note: See section 4.1 for a complete description. 2 Instruction has other undocumented opcodes. m is one of r, (HL), (IX+d), (IY+d). To form RES instruction, replace 11 with 10 .
8.9
Jump Group
Symbolic Flags Opcode M T Mnemonic Operation SF ZF YF HF XF PF NF CF 76 543 210 Hex Bytes Cycles States Comments JP nn PCnn 11 000 011 C3 3 3 10 cc Condition n 000 NZ n 001 Z JP cc,nn if cc 11 cc 010 3 3 10 010 NC PCnn n 011 C n 100 PO JR e PCPC+e 00 011 000 18 2 3 12 101 PE e-2 110 P 111 M JR ss,e JP (HL) JP (IX) JP (IY) if ss PCPC+e PCHL PCIX PCIY 00 1ss 000 e-2 11 101 001 11 011 101 11 101 001 11 111 101 11 101 001 2 2 1 2 2 3 2 1 2 2 12 7 4 8 8 if ss is true if ss is false ss 11 10 01 00 Condition C NC Z NZ
E9 DD E9 FD E9
DJNZ e Note:
BB-1 00 010 000 10 2 2 8 if B=0 if B=0 e-2 PCPC+e 2 3 13 if B=0 e is a signed two-compliment in the range -127, 129. e-2 in the opcode provides an effective number of PC+e as PC is incremented by two prior to the addition of e.
33
8.10
Mnemonic CALL nn
Symbolic Operation SF ZF (SP-1)PCh (SP-2)PCl SPSP-2 PCnn CALL cc,nn if cc is true (SP-1)PCh (SP-2)PCl SPSP-2 PCnn RET PCl(SP) PCh(SP+1) SPSP+2 RET cc if cc is true PCl(SP) PCh(SP+1) SPSP+2 RETI1 PCl(SP) PCh(SP+1) SPSP+2 IFF1IFF2 2 RETN PCl(SP) PCh(SP+1) SPSP+2 IFF1IFF2
1 1 1
3 1 3 4
10 5 11 14 if cc is false if cc is true cc 000 001 010 011 100 101 110 111 t 000 001 010 011 100 101 110 111 Condition NZ Z NC C PO PE P M p 0h 8h 10h 18h 20h 28h 30h 38h
ED 4D ED 45
14
RST p
11
111
11
Note:
1 2
RETI also copies IFF2 into IFF1, like RETN. This instruction has other undocumented opcodes.
34
8.11
Mnemonic IN A,(n) IN r,(C) IN F,(n) INI
(HL)(C) HLHL+1 BB-1 INIR (HL)(C) HLHL+1 BB-1 Repeat until B=0 IND (HL)(C) HLHL-1 BB-1 INDR (HL)(C) HLHL-1 BB-1 Repeat until B=0 OUT (n),A (n)A OUT (C),r (C)r OUT (C),0 (C)0 OUTI OTIR
ED B2
2 2
5 4
21 16
if B=0 if B=0
ED AA ED BA
2 2 2
4 5 4
16 21 16 if B=0 if B=0
OUTD OTDR
Note:
(C)(HL) HLHL+1 BB-1 2 3 (C)(HL) 0 1 0 3 0 11 101 101 ED HLHL+1 10 110 011 B3 BB-1 Repeat until B=0 1 1 1 3 1 3 2 3 (C)(HL) 11 101 101 ED HLHL-1 10 101 011 AB BB-1 (C)(HL) 0 1 0 3 0 3 2 5 11 101 101 ED HLHL-1 10 111 011 BB BB-1 Repeat until B=0 1 flag is affected by the result of BB-1 as in DEC B. 2 NF is a copy of bit 7 of the transferred byte. 3 This flag is bizarre, see section 4.3.
11 010 011 n 11 101 101 01 r 001 11 101 101 01 110 001 11 101 101 10 100 011
D3 ED ED 71 ED A3
2 2 2 2 2 2
3 3 3 4 5 4
11 12 12 16 21 16 if B=0 if B=0
2 2 2
4 5 4
16 21 16 if B=0 if B=0
35
Chapter 9
n e n n
n e
n e n n n n
n e n n
n e n n n n
36
n n n
37
n d d d n
d d d d
d d d d d d d d d d d d d d d d d d d d d d d d d d
n n
n n
n n n n n n
00 01 02 03 04 05 06 07 08
38
n n
n n
n n
n n
n n
n n
n n
n n
n n
39
d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d
n n
n n
n n n n n n
n n n
n d d d n
d d d d
00 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F 10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F 20 21 22 23 24 25 26 27
40
41
Chapter 10
d d
d d d d d d d d d d d d d d d d
40 41 42 43 44 45 47 46 40 41 42 43 44 45 47 46
d d d d d d d d d d d d d d d d
48 49 4A 4B 4C 4D 4F 4E 48 49 4A 4B 4C 4D 4F 4E
d d d d d d d d d d d d d d d d
58 59 5A 5B 5C 5D 5F 5E 58 59 5A 5B 5C 5D 5F 5E
d d
d d d d d d d
60 61 62 63 64 65 67
42
n n n n n n n n n d d
d d d d d d d d d d d d d d d d
68 69 6A 6B 6C 6D 6F 6E 68 69 6A 6B 6C 6D 6F 6E
d d d d d d d d d d d d d d d d
70 71 72 73 74 75 77 76 70 71 72 73 74 75 77 76
d d
d d d d d d d d d d d d d d d
78 79 7A 7B 7C 7D 7F 7E 78 79 7A 7B 7C 7D 7F
43
d d n
d d
d d
n n n n n n n n
d d
n n n d d
n n n n n
d d
n d d
d d d d d d d d d d d d d d d d
87 80 81 82 83 84 85 86 87 80 81 82 83 84 85 86
n n n d d
n n
d d d d d d d d d
8F 88 89 8A 8B 8C 8D 8E 8F
44
d d d d d d d d d d d d d d d d
97 90 91 92 93 94 95 96 97 90 91 92 93 94 95 96
d d d d d d d d d d d d d d d d
AF A8 A9 AA AB AC AD AE AF A8 A9 AA AB AC AD AE
d d d d d d d d d d d d d d d d
9F 98 99 9A 9B 9C 9D 9E 9F 98 99 9A 9B 9C 9D 9E
d d d d d d d d d d d d d d d d
B7 B0 B1 B2 B3 B4 B5 B6 B7 B0 B1 B2 B3 B4 B5 B6
d d d d d d d d d d d d d d d d
17 10 11 12 13 14 15 16 17 10 11 12 13 14 15 16
d d d d d d d d d d d d d d d d
A7 A0 A1 A2 A3 A4 A5 A6 A7 A0 A1 A2 A3 A4 A5 A6
d d d d d d d d d d d d d d d d
BF B8 B9 BA BB BC BD BE BF B8 B9 BA BB BC BD BE
d d d d d d d d d d d d d d d d
07 00 01 02 03 04 05 06 07 00 01 02 03 04 05 06
d d d d d d d d d d d d d
1F 18 19 1A 1B 1C 1D 1E 1F 18 19 1A 1B
45
d d d d d d d d d d d d d d d d
0F 08 09 0A 0B 0C 0D 0E 0F 08 09 0A 0B 0C 0D 0E
d d d d d d d d d d d d d d d d
CF C8 C9 CA CB CC CD CE CF C8 C9 CA CB CC CD CE
d d d d d d d d d d d d d d d d
E7 E0 E1 E2 E3 E4 E5 E6 E7 E0 E1 E2 E3 E4 E5 E6
d d
d d d d d d d d d d d d d d d d
D7 D0 D1 D2 D3 D4 D5 D6 D7 D0 D1 D2 D3 D4 D5 D6
d d d d d d d d d d d d d d d d
EF E8 E9 EA EB EC ED EE EF E8 E9 EA EB EC ED EE
d d d d d d d d d d d d d d
C7 C0 C1 C2 C3 C4 C5 C6 C7 C0 C1 C2 C3 C4
d d d d d d d d d d d d d d d d
DF D8 D9 DA DB DC DD DE DF D8 D9 DA DB DC DD DE
d d d d d d d d d d d d d d d d
F7 F0 F1 F2 F3 F4 F5 F6 F7 F0 F1 F2 F3 F4 F5 F6
d d d d d d
FF F8 F9 FA FB FC
46
d d d d d d d d d d d d d d d d
27 20 21 22 23 24 25 26 27 20 21 22 23 24 25 26
d d d d d d d d d d d d d d d d
2F 28 29 2A 2B 2C 2D 2E 2F 28 29 2A 2B 2C 2D 2E
d d
d d
d d d d d d
36 37 30 31 32 33
d d d d d d
3F 38 39 3A 3B 3C
47
Chapter 11
Preamble
The purpose of this License is to make a manual, textbook, or other written document free in the sense of freedom: to assure everyone the eective freedom to copy and redistribute it, with or without modifying it, either commercially or non-commercially. Secondarily, this License preserves for the author and publisher a way to get credit for their work, while not being considered responsible for modications made by others. This License is a kind of copyleft, which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software. We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; it can be used for any textual work, regardless of subject matter or whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference.
11.1
This License applies to any manual or other work that contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. The Document, below, refers to any such manual or work. Any member of the public is a licensee, and is addressed as you. A Modied Version of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modications and/or translated into another language. A Secondary Section is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Documents overall subject (or to related matters) and contains nothing that could fall directly within that overall subject. (For example, if the Document is in part a textbook of mathematics, a Secondary Section may not explain any mathematics.) The relationship could be a matter of historical connection with the subject or with related matters, or of legal, commercial, philosophical, ethical or political position regarding them.
48
CHAPTER 11. GNU FREE DOCUMENTATION LICENSE The Invariant Sections are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. The Cover Texts are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. A Transparent copy of the Document means a machine-readable copy, represented in a format whose specication is available to the general public, whose contents can be viewed and edited directly and straightforwardly with generic text editors or (for images composed of pixels) generic paint programs or (for drawings) some widely available drawing editor, and that is suitable for input to text formatters or for automatic translation to a variety of formats suitable for input to text formatters. A copy made in an otherwise Transparent le format whose mark-up has been designed to thwart or discourage subsequent modication by readers is not Transparent. A copy that is not Transparent is called Opaque. Examples of suitable formats for Transparent copies include plain ASCII without mark-up, A Texinfo input format, L TEX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML designed for human modication. Opaque formats include PostScript, PDF, proprietary formats that can be read and edited only by proprietary word processors, SGML or XML for which the DTD and/or processing tools are not generally available, and the machine-generated HTML produced by some word processors for output purposes only. The Title Page means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, Title Page means the text near the most prominent appearance of the works title, preceding the beginning of the body of the text.
11.2
Verbatim Copying
You may copy and distribute the Document in any medium, either commercially or non-commercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other conditions whatsoever to those of this License. You may not use technical measures to obstruct or control the reading or further copying of the copies you make or distribute. However, you may accept compensation in exchange for copies. If you distribute a large enough number of copies you must also follow the conditions in section 3. You may also lend copies, under the same conditions stated above, and you may publicly display copies.
11.3
Copying in Quantity
If you publish printed copies of the Document numbering more than 100, and the Documents license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on the back cover. Both covers must also clearly and legibly identify you as the publisher of these copies. The front cover must present the full title with all words of the title equally prominent and visible. You may add other material on the covers in addition. Copying with changes limited to the covers, as long as they preserve the title of the Document and satisfy these conditions, can be treated as verbatim copying in other respects. If the required texts for either cover are too voluminous to t legibly, you should put the rst ones listed (as many as t reasonably) on the actual cover, and continue the rest onto adjacent pages. If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a publicly-accessible computer-network location containing a complete 49
CHAPTER 11. GNU FREE DOCUMENTATION LICENSE Transparent copy of the Document, free of added material, which the general network-using public has access to download anonymously at no charge using public-standard network protocols. If you use the latter option, you must take reasonably prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this Transparent copy will remain thus accessible at the stated location until at least one year after the last time you distribute an Opaque copy (directly or through your agents or retailers) of that edition to the public. It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document.
11.4
Modications
You may copy and distribute a Modied Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modied Version under precisely this License, with the Modied Version lling the role of the Document, thus licensing distribution and modication of the Modied Version to whoever possesses a copy of it. In addition, you must do these things in the Modied Version: Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the Document). You may use the same title as a previous version if the original publisher of that version gives permission. List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modications in the Modied Version, together with at least ve of the principal authors of the Document (all of its principal authors, if it has less than ve). State on the Title page the name of the publisher of the Modied Version, as the publisher. Preserve all the copyright notices of the Document. Add an appropriate copyright notice for your modications adjacent to the other copyright notices. Include, immediately after the copyright notices, a license notice giving the public permission to use the Modied Version under the terms of this License, in the form shown in the Addendum below. Preserve in that license notice the full lists of Invariant Sections and required Cover Texts given in the Documents license notice. Include an unaltered copy of this License. Preserve the section entitled History, and its title, and add to it an item stating at least the title, year, new authors, and publisher of the Modied Version as given on the Title Page. If there is no section entitled History in the Document, create one stating the title, year, authors, and publisher of the Document as given on its Title Page, then add an item describing the Modied Version as stated in the previous sentence. Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was based on. These may be placed in the History section. You may omit a network location for a work that was published at least four years before the Document itself, or if the original publisher of the version it refers to gives permission. In any section entitled Acknowledgements or Dedications, preserve the sections title, and preserve in the section all the substance and tone of each of the contributor acknowledgements and/or dedications given therein. 50
CHAPTER 11. GNU FREE DOCUMENTATION LICENSE Preserve all the Invariant Sections of the Document, unaltered in their text and in their titles. Section numbers or the equivalent are not considered part of the section titles. Delete any section entitled Endorsements. Such a section may not be included in the Modied Version. Do not retitle any existing section as Endorsements or to conict in title with any Invariant Section. If the Modied Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modied Versions license notice. These titles must be distinct from any other section titles. You may add a section entitled Endorsements, provided it contains nothing but endorsements of your Modied Version by various parties for example, statements of peer review or that the text has been approved by an organization as the authoritative denition of a standard. You may add a passage of up to ve words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modied Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through arrangements made by) any one entity. If the Document already includes a cover text for the same cover, previously added by you or by arrangement made by the same entity you are acting on behalf of, you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one. The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modied Version.
11.5
Combining Documents
You may combine the Document with other documents released under this License, under the terms dened in section 4 above for modied versions, provided that you include in the combination all of the Invariant Sections of all of the original documents, unmodied, and list them all as Invariant Sections of your combined work in its license notice. The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but dierent contents, make the title of each such section unique by adding at the end of it, in parentheses, the name of the original author or publisher of that section if known, or else a unique number. Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work. In the combination, you must combine any sections entitled History in the various original documents, forming one section entitled History; likewise combine any sections entitled Acknowledgements, and any sections entitled Dedications. You must delete all sections entitled Endorsements.
11.6
Collections of Documents
You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in the collection, provided that you follow the rules of this License for verbatim copying of each of the documents in all other respects. You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. 51
11.7
A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or distribution medium, does not as a whole count as a Modied Version of the Document, provided no compilation copyright is claimed for the compilation. Such a compilation is called an aggregate, and this License does not apply to the other self-contained works thus compiled with the Document, on account of their being thus compiled, if they are not themselves derivative works of the Document. If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one quarter of the entire aggregate, the Documents Cover Texts may be placed on covers that surround only the Document within the aggregate. Otherwise they must appear on covers around the whole aggregate.
11.8
Translation
Translation is considered a kind of modication, so you may distribute translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include translations of some or all Invariant Sections in addition to the original versions of these Invariant Sections. You may include a translation of this License provided that you also include the original English version of this License. In case of a disagreement between the translation and the original English version of this License, the original English version will prevail.
11.9
Termination
You may not copy, modify, sublicense, or distribute the Document except as expressly provided for under this License. Any other attempt to copy, modify, sublicense or distribute the Document is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.
11.10
The Free Software Foundation may publish new, revised versions of the GNU Free Documentation License from time to time. Such new versions will be similar in spirit to the present version, but may dier in detail to address new problems or concerns. See http://www.gnu.org/copyleft/. Each version of the License is given a distinguishing version number. If the Document species that a particular numbered version of this License or any later version applies to it, you have the option of following the terms and conditions either of that specied version or of any later version that has been published (not as a draft) by the Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation.
52