Transcript Lecture 5 - Basic Instruction Set

ECE265
ECE 265 – LECTURE 5
The M68HC11 Basic Instruction Set
4/13/2015
1
Lecture Overview
2

The M68HC11 Basic Instruction Set
 How
to partition the instruction set to learn it
 What are those partitions
 The 68HC11 data movement instructions

Material from Chapter 2 and 3 plus a 68HC11
reference manual. Instruction set details are in
Appendix A of the text.
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Basic guide to any architecture
3


The instruction set of any processor can be partitioned into
logical groupings.
Instructions for






Data Movement – no operation or manipulation – just transfer
the data from one location to another
Arithmetic – an take note of any unique aspects – most
architecture treat data such that it is treated as 2’s complement.
Multiply and Divide – if these are supported by instructions.
Logical Instructions – Boolean operations
Testing and Bit Manipulation – even in the CCR
Shift and Rotate
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Basic guide (cont.)
4

Instruction classes continued
 Condition
Code Register
 Branch – what conditional branches are supported
 Jump – direct? How different from Branch?
 Subroutine Calls and Return – calls that save register
and data and calls that don’t.
 Stack Pointer
 Index Register and Indexed access to data
 Interrupts and Interrupt Handling
 Any miscellaneous instructions
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Data Movement
5

These instructions allow for the transfer of data from
one location to another.

In a RISC (Reduced Instruction Set Computer) these
transfers are the only data movement instructions.
Operational instructions are typically register to
register with both operands being in register to start.
In a CISC (Complex Instruction Set Computer) there
are complex instruction that not only perform the
operation on data but also result in complex data
movement and/or storage.

 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Data Movement Instructions
6

These are listed in the table for the 68HC11.
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
CLR
7




Operation: ACCX  0 or M  0
Description: The contents of the accumulator or the
memory location are set to 0s.
CC effects: N, V, C are cleared, Z is set
Forms: CLRA CLRB CLR
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Load data
8




Operation: place the operand data into accumulator
A, B, or D.
Description: Load the accumulator
CC effects: V cleared, N and Z set or cleared
depending on value of data.
Forms: LDAA LDAB LDD
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Example of load
9
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Store data
10




Operation: Store the accumulator at the effective
address.
Forms: STAA
STAB
STD
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
The Stack
11


The stack is an area of RAM used for temporary
storage, typically for subroutine calls and then the
subsequent return. It is also used when servicing
and interrupt.
One of the Programmers Model registers is the
stack pointer register. This is a 16-bit register that
points to the next free location on the stack. The
stack grows down in memory.
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Stack and stack growth
12

Two important facts to
note on stacks.
 Direction
of growth
 What does the stack
pointer point to
 Data
 Free
location
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Push and Pop
13


Two common operations on stacks are to add data,
a Push, and the retrieval of data, a Pop.
For the 68HC11
– Simply store the data at the address pointed
to by the stack pointer. After storing the data,
decrement the stack pointer.
 A POP – Increment the stack pointer. Use the data that
the stack pointer now points to. Location is now
considered free.
 A PUSH
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Push and Pull
14





Operation: A/B  Mem(SP)
Pull
Mem(SP)  A/B Push
Description: Transfers the contents of the
Accumulator to or from the top of the stack.
CC effects: none
Forms: this is an inherent instruction
 PSHA
PSHB PULA PULB
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Store the Accumulator
15




Operation: Mem(ea)  A/B
Description: Store the contents of the given
accumulator in the effective memory address
CC effects: N V Z
Forms: STAA STAB STD
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Transfer register
16







Operation: Transfers allowed are
from A to B or CCR
from B to A
from CCR to A
Description: Transfers the contents of one register
to another.
CC effects: A to B and B to A  N V Z
Forms: only inherent
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Exchange registers
17





Operation: D  X concurrent with X  D
D  Y concurrent with Y D
Description: Exchange the contents of the D
accumulator with the X or Y index register
CC effects: None
Forms: Inherent form instruction
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Lecture summary
18

Have covered
 How
to partition the instruction set when learning an
architecture.
 The data transfer instructions
 Joanne E. DeGroat, OSU
ECE265
4/13/2015
Assignment
19

Read Chapter 3 through section 3.4

Problems
 3.3
 3.4
 3.5
 3.6
 Joanne E. DeGroat, OSU
ECE265
4/13/2015