Scribd
Upload
4 views26 pages

4 addressingmodes

The document provides an overview of various addressing modes in computer organization and architecture, including Immediate, Direct, Indirect, Register, Register Indirect, Displacement, Relative, Base-Register, Indexed, and Stack addressing. Each mode is described with its characteristics, examples, and diagrams illustrating how operands are accessed. The document emphasizes the trade-offs between speed, address space, and memory access for each addressing mode.

Uploaded by

om61401
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
4 views26 pages

4 addressingmodes

The document provides an overview of various addressing modes in computer organization and architecture, including Immediate, Direct, Indirect, Register, Register Indirect, Displacement, Relative, Base-Register, Indexed, and Stack addressing. Each mode is described with its characteristics, examples, and diagrams illustrating how operands are accessed. The document emphasizes the trade-offs between speed, address space, and memory access for each addressing mode.

Uploaded by

om61401
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 26

COMPUTER ORGANIZATION & ARCHITECTURE

UNIT-I
ADDRESSING MODES
Addressing Modes
• Immediate
• Direct
• Indirect
• Register
• Register Indirect
• Displacement
• Stack or implied
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
Immediate Addressing Diagram

Instruction
Opcode Operand
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
Direct Addressing Diagram

Instruction
Opcode Address A
Memory

Operand
Indirect Addressing
• 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
• Large address space
• 2n where n = word length
• May be nested, multilevel, cascaded
— e.g. EA = (((A)))
– Draw the diagram yourself
• Multiple memory accesses to find operand
• Hence slower
Indirect Addressing Diagram

Instruction
Opcode Address A
Memory

Pointer to operand

Operand
Register Addressing
• 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
• Multiple registers helps performance
Register Addressing Diagram

Instruction
Opcode Register Address R
Registers

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

Instruction
Opcode Register Address R
Memory

Registers

Pointer to Operand Operand


Autoincrement/Autodecrement Addressing Diagram

Instruction
Opcode Register R
Memory

Registers

Pointer to Operand + Operand


Displacement Addressing
• EA = A + (R)
• Address field hold two values
—A = base value
—R = register that holds displacement
—R = PC for relative addressing
—R = XR for index addressing or indexing
—R = BR for base register addressing
Displacement Addressing Diagram

Instruction
Opcode Register R Address A
Memory

Registers

Pointer to Operand + Operand


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
Base-Register Addressing
• A holds displacement
• R holds pointer to base address
• R may be explicit or implicit
• e.g. segment registers in 80x86
Indexed Addressing
• A = base
• R = displacement
• EA = A + R
• Good for accessing arrays
—EA = A + R
—R++
Stack Addressing
• Operand is (implicitly) on top of stack
• e.g.
—ADD Pop top two items from stack
and add
Stack Addressing

Instruction
Opcode
201
QA : ADDRESSING MODES
QA : ADDRESSING MODES
QA : ADDRESSING MODES
QA : ADDRESSING MODES
QA : ADDRESSING MODES

You might also like