1. Chapter # 8 Figure 8-1 Major components of CPU Control Register Set [ Register Set [ Arithmetic Logic unit (ALU) [ Arithmetic Logic unit (ALU) [

2. Chapter # 8 Figure 8-2 Register set with common ALU R1 R2 R3 R4 R5 R6 R7 MUX INPUT Arithmetic logic unit (ALU) OPR SELA SELB 3 X 8 decoder output

3. Chapter # 8 Table 8-1 Encoding of Register Selection Fields. Binary CodeSELASELBSELD 000InputInputNone 001R1R1R1 010R2R2R2 011R3R3R3 100R4R4R4 101R5R5R5 110R6R6R6 111R7R7R7

4. Chapter # 8 Table 8-2 Encoding of ALU operations. OPR SelectOperationSymbol 00000Transfer ATSFA 00001Increment AINCA 00010Add A + BADD 00101Subtract A – BSUB 00110Decrement ADECA 01000AND A and BAND 01010OR A and BOR 01100XOR A and BXOR 01110Complement ACOMA 10000Shift right ASHRA 11000Shift left ASHLA

5. Chapter # 8 Binary Code for Subtract Micro operation. Field:SELASELBSELDOPR Symbol:R2R3R1SUB Control Word01001100100001 R1  R2 – R3

6. Chapter # 8 Table 8-3 Examples of Micro operations for the CPU. Symbolic Designation Micro operationSELASELBSELDOPR Control Word R1  R2 – R3R2R3R1SUB010 011 001 00101 R4  R4  R5R4R5R4OR100 101 100 01010 R6  R6 + 1R6-R6INCA110 000 110 00001 R7  R1R1-R7TSFA001 000 111 00000 Output  R2R2-NoneTSFA010 000 000 00000 Output  InputInput-NoneTSFA000 000 000 00000 R4  shl R4R4-R4SHLA100 000 100 11000 R5  0R5R5R5XOR101 101 101 01100

7. Chapter # 8 Figure 8-3 Block Diagram of a 64-word stack. FULLEMTY A B C SP 1 0 2 3 4 63 DR Address

8. Chapter # 8 Push and Pop Micro operations Push SP  SP + 1Increment stack pointer M[SP]  DRWrite item on top of the stack If (SP = 0) then (FULL  1)Check if stack is full EMTY  0Mark the stack not empty Pop DR  M[SP]Read item from the top of stack SP  SP – 1Decrement stack pointer If (SP = 0) then (EMTY  1)Check if stack is empty FULL  0Mark the stack not Full

9. Chapter # 8 Figure 8-4 Computer memory with program, data, and stack segments. Memory Unit SP AR PC DR 1000 2000 3000 3997 3998 3999 4000 4001

10. Chapter # 8 Figure 8-5 Stack operations to evaluate 3. 4 + 5. 6 3 3 3 4 12 5 4 5 6 30 42. 56. +

11. Chapter # 8 The most common fields in instruction formats 1. An operation code field that specifies the operation to be performed. 2. An address field that designates a memory address or a processor register 3. A mode field that specifies the way the operand or the effective address is determined Three types of CPU organization 1. Single accumulator organization. 2. General register organization. 3. Stack organization.

12. Chapter # 8 Three Address Instructions Expression: X= (A + B) * (C + D) Assembly language program. ADDR1, A, BR1  M[A] + M[B] ADDR2, C, DR2  M[C] + M[D] ADDX, R1, R2M[X]  R1 * R2

13. Chapter # 8 Two-Address Instructions Expression: X= (A + B) * (C + D) Assembly language program. MOVR1, AR1  M[A] ADDR1, BR1  R1 + M[B] MOVR2, CR2  M [C] ADD R2, DR2  R2 + M[D] MULR1, R2R1  R1 * R2 MOVX, R1M[X]  R1

14. Chapter # 8 One-Address Instructions Expression: X= (A + B) * (C + D) Assembly language program. LOADAAC  M[A] ADDBAC  AC + M[B] STORETM[T]  AC LOAD CAC  M[C] ADDDAC  AC + M[D] MULTAC  AC * M[T] STOREXM[X]  AC

15. Chapter # 8 Zero-Address Instruction. Expression: X= (A + B) * (C + D) Assembly language program. PUSHATOS  A PUSHBTOS  B ADDTOS  (A + B ) PUSH CTOS  C PUSHDTOS  D ADDTOS  (C + D) MULTOS  (A + B)*(C + D) POPXM[X]  TOS NOTE: TOS stands for top of stack

16. Chapter # 8 RISC Instructions Expression: X= (A + B) * (C + D) Assembly language program. LOADR1, AR1  M[A] LOADR2, BR2  M[B] LOADR3, CR3  M[C] LOAD R4, DR4  M[D] ADDR1, R1,R2R1  R1+R2 ADDR3, R3,R2R3  R3+R4 MULR1, R1, R3R1  R1 * R3 STOREX,R1M[X]  R1

17. Chapter # 8 Addressing Modes 1.Implied Mode 2.Immediate Mode 3.Register Mode 4.Register Indirect Mode 5.Auto increment or Auto decrement Mode 6.Direct Address Mode 7.Indirect Address Mode 8.Relative Address Mode 9.Indexed Addressing Mode 10.Base Register Addressing Mode

18. Chapter # 8 Figure 8-7 Numerical example for addressing modes Mode Load to AC 200 201 202 Address = 500 Next instruction 399 450 400 700 500 800 600900 702 325 800 300 PC=200 R1=400 XR= 100 AC MemoryAddress

19. Chapter # 8 Table 8-4 Tabular List of Numerical Example Addressing ModeEffective AddressContent of AC Direct Address500800 Immediate operand201500 Indirect Address800300 Relative Address702325 Indexed Address600900 Register-400 Register Indirect400700 Auto increment400700 Auto decrement399450

20. Chapter # 8 Table 8-5 Typical Data Transfer Instructions. NameMnemonic LoadLD StoreST MoveMOV ExchangeXCH InputIN OutputOUT PushPUSH PopPOP

21. Chapter # 8 Table 8-6 Eight Addressing Modes for the Load Instruction. Assembly Mode ConventionRegister Transfer Direct addressLD ADRAC  M[ADR] Indirect addressLD @ADRAC  M[M [ADR] ] Register relativeLD $ADRAC  M[PC + ADR] Immediate operandLD # NBRAC  NBR Index addressingLD ADR(X)AC  M[ADR + XR] RegisterLD R1AC  R1 Register indirectLD (R1)AC  M[R1] Auto incrementLD (R1)+AC  M[R1], R1  R1 + 1

22. Chapter # 8 Table 8-7 Typical Arithmetic instructions NameMnemonic IncrementINC DecrementDEC AddADD SubtractSUB MultiplyMUL DivideDIV Add with carryADDC Subtract with borrowSUBB Negate(2’s Comp )NEG

23. Chapter # 8 Table 8-8 Typical Logical and Bit Manipulation Instructions. NameMnemonic ClearCLR ComplementCOMANDOR Exclusive-ORXOR Clear carryCLRC Set carrySETC Complement carryCOMC Enable interruptEI Disable interruptDI

24. Chapter # 8 Table 8-9 Typical Shift Instructions NameMnemonic Logical shift rightSHR Logical shift leftSHL Arithmetic shift rightSHRA Arithmetic shift leftSHRL Rotate rightROR Rotate leftROL Rotate right through carryRORC Rotate left through carry ROLC

25. Chapter # 8 Table 8-9 Typical Program Control Instructions NameMnemonic BranchBR JumpJMP SkipSKP CallCALL ReturnRET Compare (by subtraction)CMP Test (by ANDing)TST

26. Chapter # 8 Shift Bit Conditions.  Bit C (carry) is set to 1 if the end carry C 8 is 1. It is cleared to 0 if the carry is 0.  Bit S (sign) is set to 1 if the highest-order bit F 7 is 1. It is set to 0 if the bit is 0.  Bit Z (zero) is set to 1 if the output of ALU contains all 0’s. It is cleared to 0 otherwise. In other words, Z=1 if the out put is zero and Z=0 if the output is not zero.  Bit V (overflow) is set to 1 if the exclusive-OR of the last two carries is equal to 1, and cleared to 0 otherwise. This is the condition for an overflow when negative number are in 2’s complement. For the 8-bit ALU, V=1 if the output is greater than +127 or less than -128.

27. Chapter # 8 Figure 8-8 Status register bits. 8-bit ALU F 7 – F 0 A B 8 8 C7C7 C8C8 Output F Check for zero output V ZSC F7F7 8

28. Chapter # 8 Table 8-11 Conditional Branch Instructions MnemonicBranch conditionTested condition BZBranch if zeroZ = 1 BNZBranch if not zeroZ = 0 BCBranch if carryC = 1 BNC Branch if not carryC = 0 BPBranch if plusS = 1 BMBranch if minusS = 1 BVBranch if overflowV = 1 BNVBranch if not overflowV = 0 Unsigned compare conditions (A - B) BHIBranch if higherA > B BHEBranch if higher or equalA ≥ B BLOBranch if lowerA < B BLOEBranch if lower or equalA ≤ B (continue)

29. Chapter # 8 Table 8-11 Conditional Branch Instructions (continued) MnemonicBranch conditionTested condition BEBranch if equalA = B BNEBranch if not equalA ≠ B Signed compare conditions (A - B) BGTBranch if greater than A > B BGEBranch if greater or equalA ≥ B BLTBranch if less than A < B BLE Branch if less or equal A ≤ B BEBranch if equalA = B BNEBranch if not equalA ≠ B

30. Chapter # 8 Subroutine Call and Micro operations SP  Sp – 1 Decrement stack pointer M[SP]  PC Push content of PC onto stack PC  effective address Transfer control to the subroutine Instruction from last subroutine is implement by following micro operations PC  M[SP] Pop stack and transfer to PC SP  SP + 1 Increment stack pointer

31. Chapter # 8 State of CPU at the end of EXEC. Cycle (when the interrupt is recognized) is determined from. 1.The content of the program counter. 2.The content of all processor registers. 3.The content of certain status conditions.

32. Chapter # 8 Types of Interrupts 1.External interrupts. 2.Internal interrupts. 3.Software interrupts.

33. Chapter # 8 Major characteristics of CISC architecture. 1.A large number of instructions-typically from100 to 250 instructions. 2.Some instructions that performs specialized tasks and are used infrequently. 3.A large variety of addressing mode-typically from 5 to 20 different modes. 4.Variable-length instruction formats. 5.Instructions that manipulate operands in memory

34. Chapter # 8 Major Characteristics of RISC architecture. 1.Relatively few instructions. 2.Relatively few addressing modes. 3.Memory access limited to load and store instructions. 4.All operations done within the registers of the CPU. 5.Fixed-length, easily decoded instruction format. 6.Single-cycle instruction execution. 7.Hardwired rather than micro programmed control.

35. Chapter # 8 Figure 8-9 Overlapped register windows. R15 R10 R73 R54 R63 R58 R57 R48 R47 R42 R41 R32 R31 R26 R25 R16 R15 R10 R9 R0 Common to D and A Local to D Proc D Common to C and D Local to B Common to B and C Proc C Local to C Common to A and B Local to A Common to A and D Proc B Proc A Common to all procedures Global Registers

36. Chapter # 8 Figure 8-10 Berkeley RISC I instruction formats. opcodeRdRs 0Not usedS2 4 0 12 51318 14 23 19 31 24 8 5 5 1 8 5 (a) Register mode: (S2 specifies a register) opcodeRdRs 1S2 0 1213 18 14 23 19 31 24 8 5 5 1 13 (a) Register-immediate mode: (S2 specifies a register) opcodeCOND Y 018 23 19 31 24 8 5 19 (a) PC relative mode