1. William Stallings Computer Organization and Architecture 8 th Edition Chapter 11 Instruction Sets: Addressing Modes and Formats

2. Addressing Modes Immediate Direct Indirect Register Register Indirect Displacement (Indexed) Stack

3. Immediate Addressing Operand is part of instruction Operand = address field e.g. ADD 5 —Add 5 to contents of accumulator —5 is operand No memory reference to fetch data Fast Limited range

4. Immediate Addressing Diagram OperandOpcode Instruction

5. Direct Addressing Address field contains address of operand Effective address (EA) = address field (A) e.g. ADD A —Add contents of cell A to accumulator —Look in memory at address A for operand Single memory reference to access data No additional calculations to work out effective address Limited address space

6. Direct Addressing Diagram Address AOpcode Instruction Memory Operand

7. Indirect Addressing (1) Memory cell pointed to by address field contains the address of (pointer to) the operand EA = (A) —Look in A, find address (A) and look there for operand e.g. ADD (A) —Add contents of cell pointed to by contents of A to accumulator

8. Indirect Addressing Diagram Address AOpcode Instruction Memory Operand Pointer to operand

9. Register Addressing (1) Operand is held in register named in address filed EA = R Limited number of registers Very small address field needed —Shorter instructions —Faster instruction fetch No memory access Very fast execution Very limited address space

10. Register Addressing Diagram Register Address ROpcode Instruction Registers Operand

11. Register Indirect Addressing Like as indirect addressing EA = (R) Operand is in memory cell pointed to by contents of register R Large address space (2 n ) One fewer memory access than indirect addressing

12. Register Indirect Addressing Diagram Register Address ROpcode Instruction Memory Operand Pointer to Operand Registers

13. Displacement Addressing EA = A + (R) Address field hold two values —A = base value —R = register that holds displacement —or vice versa

14. Displacement Addressing Diagram Register ROpcode Instruction Memory Operand Pointer to Operand Registers Address A +

15. Relative Addressing A version of displacement addressing R = Program counter, PC EA = A + (PC) i.e. get operand from A cells from current location pointed to by PC c.f locality of reference & cache usage

16. Base-Register Addressing A holds displacement R holds pointer to base address R may be explicit or implicit e.g. segment registers in 80x86

17. Indexed Addressing A = base R = displacement EA = A + R Good for accessing arrays —EA = A + R —R++

18. Stack Addressing Operand is (implicitly) on top of stack e.g. —ADDPop top two items from stack and add

19. x86 Addressing Modes 12 addressing modes available —Immediate —Register —Direct —Indirect —Register Indirect —Displacement —Base —Base with displacement —Scaled index with displacement —Base with index and displacement —Base scaled index with displacement —Relative

20. x86 Instruction Format

21. Assembler Machines store and understand binary instructions E.g. N= I + J + K initialize I=2, J=3, K=4 Program starts in location 101 Data starting 201 Code: Load contents of 201 into AC Add contents of 202 to AC Add contents of 203 to AC Store contents of AC to 204 Tedious and error prone

22. Improvements Use hexadecimal rather than binary —Code as series of lines –Hex address and memory address —Need to translate automatically using program

23. Program in: Binary Hexadecimal AddressContentsAddressContents 1010010 10122011012201 1020001001010212021021202 1030001001010312031031203 1040011001010432041043204 2010000 20100022010002 2020000 20200032020003 2030000 20300042030004 2040000 20400002040000