Lecture 3 instruction set

3,166 views

Published on

Published in: Education, Technology
1 Comment
1 Like
Statistics
Notes
  • blessing_11111@yahoo.com

    My name is Blessing
    i am a young lady with a kind and open heart,
    I enjoy my life,but life can't be complete if you don't have a person to share it
    with. blessing_11111@yahoo.com

    Hoping To Hear From You
    Yours Blessing
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
No Downloads
Views
Total views
3,166
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
188
Comments
1
Likes
1
Embeds 0
No embeds

No notes for slide

Lecture 3 instruction set

  1. 1. INSTRUCTION SETT S PRADEEP KUMARAssistant Professor (SG)VIT University – Chennai Campushttp://www.pradeepkumar.orgtspembedded@gmail.com
  2. 2. Topics to be covered• Instruction Formats• Types of Operations• Addressing Modes
  3. 3. Instruction Format• Elements of a machine instruction • Operation Code – specifies the operation to be performed and this is a binary code. • Source Operand Reference – operands that are inputs • Result Operand reference – operand that are outputs • Next instruction reference - This tells the processor where to fetch the next instruction after the execution of this instruction is complete
  4. 4. Instruction Format• Operand Location • Main or Virtual Memory • Processor Register – a processor contains one or more register. In there is only one, reference is implicit. Else the register number is to be supplied. • Immediate – The value of the operand is contained in a field in the instruction being executed • I/O device - The instruction must specify the I/O module and device for the operation.
  5. 5. Instruction Format• A Simple Instruction Format
  6. 6. Instruction Format
  7. 7. Instruction Format
  8. 8. Operations• Data transfer• Arithmetic• Logical• Conversion• I/O• System control• Transfer of control
  9. 9. Data Transfer OperationOperation Name DescriptionMove (Transfer) Transfer word or block from source to destinationStore Transfer word from processor to memoryLoad (fetch) Transfer word from memory to processorExchange Swap contents of source and destinationClear (Reset) Transfer word of 0s to destinationSet Transfer word of 1s to destinationPUSH Transfer word from source to top of stackPOP Transfer word from top of stack to destination
  10. 10. Arithmetic• ADD• Subtract• Multiply• Divide• Absolute – replace operand by its absolute value• Negate – change sign of operand• Increment – add 1 to operand• Decrement – subtract 1 from operand
  11. 11. Logical• AND, OR, NOT, X OR• Test• Compare• Set control variables• Shift• Rotate
  12. 12. Transfer of Control• Jump (Branch) – load PC with specified address• Jump conditional• Jump to subroutine• Return• Execute• Skip – increment PC to next instruction• Skip conditional• Halt – stop program execution• Wait• No Operation
  13. 13. I/O• Input (read) -Transfer data from specified I/O port or device to destination (e.g., main memory or processor register)• Output (write) -Transfer data from specified source to I/O port Input/Output or device• Start I/O -Transfer instructions to I/O processor to initiate I/O operation• Test I/O -Transfer status information from I/O system to specified destination
  14. 14. Addressing modes• The manner in which target address or effective address is identified within the instruction is called addressing mode• Immediate Addressing• Direct Addressing• Indirect Addressing• Register Addressing• Register Indirect Addressing• Displacement Addressing• Stack Addressing
  15. 15. Immediate addressing
  16. 16. Immediate addressing• Simplest form of addressing• Operand value is present directly • Operand = A• Useful for defining constants or set initial values
  17. 17. Direct addressing
  18. 18. Direct addressing• EA = A• Effective address is just the address of the operand• It only provides limited address space
  19. 19. Indirect addressing
  20. 20. Indirect addressing• EA =(A)• Parentheses specifies the contents of A• Neither the address of the operand nor the operand• Disadvantage: Two memory references to fetch the operand
  21. 21. Register addressing
  22. 22. Register addressing• EA = R• Similar to direct addressing.• Address field refers to register rather than a main memory address• Advantages: only a small address field is needed, no time consuming memory references• Disadvantages: only limited registers are available in any processors when compared to main memory.
  23. 23. Register indirect addressing
  24. 24. Register indirect addressing• EA = (R)• Similar like indirect addressing, but instead of main memory, the reference is the register.
  25. 25. Displacement addressing
  26. 26. Displacement addressing• EA = A + (R)• Combination of direct addressing and register indirect addressing• Very effective• Operates in three modes • Relative addressing • Index addressing • Base register addressing
  27. 27. Stack addressing
  28. 28. Stack addressing• Linear array of locations• Pushdown list or Last in First out List• Elements are appended to the top of the stack• Stack pointer is maintained in a register.• the operation performed at the top of the stack
  29. 29. Together
  30. 30. QUESTIONS???

×