DOCSLIB.ORG

Input/Output Interfaces: Ch 8.1-8.3

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Input/Output Interfaces: Ch 8.1-8.3 Input/Output Interfaces: Ch 8.1-8.3 Problems Algorithms software Prog. Lang & Interfaces H/w – s/w interface Instruction Set Architecture Microarchitecture (Organization) Circuits Devices (Transistors) hardware Bits © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 1 Recall von Neumann model MEMORY MAR MDR INPUT OUTPUT Keyboard Monitor Mouse PROCESSING UNIT Printer Scanner LED Disk ALU TEMP Disk CONTROL UNIT PC IR © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 2 Instruction Sets and von Neumann model Processing unit • Computation Instructions Memory unit • Accessed in Instruction fetch • And load/store instructions Control unit • Controls phases of instruction cycle (fetch, decode .. etc) • Control transfer instructions How does program interact with input/output (I/O) components? © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 3 Special Characteristics of I/O I/O devices allow data to be input/output between computer and outside world Like memory, we need to read from and write to I/O devices For memory, we provide address and read or write Similarly for I/O, we need to identify which device and what operation There is only one memory, so there is no need to specify “which” memory (but only which address) But there are many I/O devices so we need to say which device To make it manageable, there is a uniform interface for all I/O devices: each I/O device is identified by a bunch of device registers © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 4 I/O Device Registers Each I/O device has some number of device registers • Control register: for CPU to specify what operation to do – Read or write or some other (for certain I/O devices) – For disk (permanent memory with storage of large amounts of data), we specify address but keyboard handles only one character at a time so no address • Data register: for holding data to/from CPU • Status register: for showing status of the I/O device – Is the device still busy with the previous operation? – Is there some input for CPU? – Is it safe for CPU to send the next output data or is the previous output data not done yet? © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 5 I/O Device Registers Control and Data registers are analogous to memory where we specified read or write and the data to be transferred But what is this status business? We did not have this for memory • I/O devices are millions of times slower than CPU • And the I/O device speed varies (keyboard typing) • So it is best to have I/O device go on its own speed and not be lock-stepped with the CPU clock – Lock-stepping with CPU clock would mean waiting for millions of cycles which is silly, cumbersome, and wasteful (to use extra hardware to wait for millions of cycles ) © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 6 I/O Device Registers So we use asynchronous interaction between CPU and I/O • Using CPU clock would be synchronous Asynchronous means CPU and I/O work independently When data needs to be sent between CPU and I/O they do handshaking (aka protocol) • Needed because not lock-stepped with CPU • Handshaking works by I/O device making its status known to the CPU (status as in “I have a new input for CPU”, or “I am done with outputting previous data”, etc) • This status is shown in the status register (1-bit keyboard status to show if there is a new character and 1-bit monitor status to show if monitor is done displaying last character) © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 7 I/O Device registers Example: LC3 keyboard (input) and monitor (output) • KBSR – keyboard status register: is there a key ready? • KBDR – keyboard data register: what is the key value? • CRTSR – CRT status register: ready to accept output • CRTDR – CRT data register: write data here for display Device registers are different from “General Purpose Registers” • Not in processing unit • Not used for ordinary instructions So, how do we get access to these device registers? © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 8 When should we access device? Synchronous • Device always becomes ready after a fixed number of processor clock cycles; processor should read/write periodically Asynchronous • No guarantees of device timing • Instead, device has status registers to indicate readiness • Requires processor to do some “synchronization” task to determine when device is ready Asynchronous is far more common © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 9 Accessing Device Registers Option 1: Special instructions • I/O opcode; operands include device number and some command I / O © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 10 Accessing Device Registers Option 2: Memory-mapped I/O • Device registers accessed through regular load and store operations to some specific memory addresses • These addresses are set aside and are not part of memory • In LC3, xFE00 to xFFFF are for I/O device registers • For read/write to these addresses, memory does not do anything and the specific I/O device register is read/written Memory-mapped I/O far more common © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 11 Memory Mapped I/O in LC3 (Page 543) Location I/O Register Function Bit [15] is one when device Display Status ready to display another xFE04 Register (DSR) char on screen. ASCII character written to Display Data Register bits [7:0] will be displayed xFE06 (DDR) on screen. Bit [15] is one when Keyboard Status Reg keyboard has received a xFE00 (KBSR) new character. Keyboard Data Reg xFE02 (KBDR) © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 12 Example: Input from Keyboard When user types a character: • Keyboard places ASCII code in KBDR[7:0] (high bits 0) • Keyboard sets KBSR[15] to 1 (no guarantee on other bits) – How to test if highest bit is 1? • KBSR[15] being 1 disables keyboard – for a very short time where further key strokes are highly unlikely but if they keyboard data occur are ignored15 8 7 0 KBDR 1514 0 ready bit KBSR When program loads KBDR: • Program sets KBSR[15] to 0 •which automatically re-enables Keyboard © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 13 How do we synchronize with device? Polling • Keep checking status register until new data available or device ready to accept new data • “Are we there yet? Are we there yet? Are we there yet?” – Bart Simpson Interrupts • Device sends a special signal called interrupt to CPU which drops what it is doing, handles the interrupt, goes back to what it was doing • “Wake me when we get there.” – Sleep-loving teenager • interrupt disrupts ordinary flow of instruction cycle © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 14 How do we synchronize with device? Polling • Because most I/O devices are much slower than CPU, polling checks result in “not ready yet” • CPU wastes many clock cycles checking unnecessarily when it could be doing other useful work Interrupts • CPU pays attention to I/O device only when there is something – so no wastage of CPU • But interrupts are not free – they do incur some overhead but much less than polling especially for slow I/O devices • Interrupts occur any time in the middle of an instruction, CPU hardware to handle interrupts is complex (ECE437) © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 15 Example: Basic Polling Terminal Program INPOLL LDI R0, KBSRlabel • Why LDI/STI? BRzp INPOLL • Why BRzp? LDI R0, KBDRlabel • What does this OUTPOLL LDI R1, DSRlabel program do? BRzp OUTPOLL • What could happen if STI R0, DDRlabel we read KBDR without ... checking KBSR? KBSRlabel .FILL xFE00 • What could happen if KBDRlabel .FILL xFE02 we write DDR without DSRlabel .FILL xFE04 checking DSR? DDRlabel .FILL xFE06 • Recall Ch.6 character count eg where input came from keyboard © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 16 More on Interrupt-driven I/O Two parts: • Generate the interrupt signal – In hardware – A little bit of details now • Perform service for the interrupt – In software – Details in later courses In 495k, we cover 8.1-8.3 and a little bit of 8.5 Read pages 230-235 (pages 219-229 will be covered later) © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 17 Generating Interrupt signal Program running on CPU may be doing “higher priority” work and not want to be interrupted So each I/O device has a “interrupt enable” (IE) bit in device status register – program clears this bit if it wants I/O device to shut up • If IE is clear device ready bit does not matter • When ready bit and IE bit set, device interrupts CPU interrupt enable bit 151413 0 ready bit KBSR interrupt signal to processor © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 18 Generating Interrupt signal I/O devices and their interrupts are prioritized by their urgency • Internet Explorer vs. missile control • Details can be complex ( we won't go into page 213) CPU must test whether interrupt signal has been set, and respond accordingly • Modify instruction cycle © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 19 Interrupt-Aware Instruction Cycle 1. Fetch instruction from memory 2. Decode instruction 3. Evaluate memory address if needed 4. Fetch operands for computation 5. Execute instruction using operands 6. Store result into specified destination 7. Check if interrupt signal set – If not, go to step #1 for next PC – If so, save aside PC and CCRs; transfer to “interrupt service routine.” More detail in Chapter 10.5 © 2009 Vijaykumar ECE495K Lecture Notes: Chapter 8 20 How is data transferred? For small data, load/store from CPU, for large data 2 options Programmed I/O (PIO) • Computer uses load/store instructions to transfer data between memory-mapped device data registers and memory via GPRs • Wastes CPU to do lowly work of transferring data Direct Memory Access (DMA) • Device directly transfers data from/to specified regions in memory without CPU intervention, so saves CPU time • adds complexity to memory system design • Typically used for bulk data transfers from devices like disks, network interfaces, etc.
Load more

Recommended publications
  • Simple Computer Example Register Structure
    Simple Computer Example Register Structure Read pp. 27-85 Simple Computer • To illustrate how a computer operates, let us look at the design of a very simple computer • Specifications 1. Memory words are 16 bits in length 2. 2 12 = 4 K words of memory 3. Memory can be accessed in one clock cycle 4. Single Accumulator for ALU (AC) 5. Registers are fully connected Simple Computer Continued 4K x 16 Memory MAR 12 MDR 16 X PC 12 ALU IR 16 AC Simple Computer Specifications (continued) 6. Control signals • INCPC – causes PC to increment on clock edge - [PC] +1 PC •ACin - causes output of ALU to be stored in AC • GMDR2X – get memory data register to X - [MDR] X • Read (Write) – Read (Write) contents of memory location whose address is in MAR To implement instructions, control unit must break down the instruction into a series of register transfers (just like a complier must break down C program into a series of machine level instructions) Simple Computer (continued) • Typical microinstruction for reading memory State Register Transfer Control Line(s) Next State 1 [[MAR]] MDR Read 2 • Timing State 1 State 2 During State 1, Read set by control unit CLK - Data is read from memory - MDR changes at the Read beginning of State 2 - Read is completed in one clock cycle MDR Simple Computer (continued) • Study: how to write the microinstructions to implement 3 instructions • ADD address • ADD (address) • JMP address ADD address: add using direct addressing 0000 address [AC] + [address] AC ADD (address): add using indirect addressing 0001 address [AC] + [[address]] AC JMP address 0010 address address PC Instruction Format for Simple Computer IR OP 4 AD 12 AD = address - Two phases to implement instructions: 1.
    [Show full text]
  • MIPS IV Instruction Set
    MIPS IV Instruction Set Revision 3.2 September, 1995 Charles Price MIPS Technologies, Inc. All Right Reserved RESTRICTED RIGHTS LEGEND Use, duplication, or disclosure of the technical data contained in this document by the Government is subject to restrictions as set forth in subdivision (c) (1) (ii) of the Rights in Technical Data and Computer Software clause at DFARS 52.227-7013 and / or in similar or successor clauses in the FAR, or in the DOD or NASA FAR Supplement. Unpublished rights reserved under the Copyright Laws of the United States. Contractor / manufacturer is MIPS Technologies, Inc., 2011 N. Shoreline Blvd., Mountain View, CA 94039-7311. R2000, R3000, R6000, R4000, R4400, R4200, R8000, R4300 and R10000 are trademarks of MIPS Technologies, Inc. MIPS and R3000 are registered trademarks of MIPS Technologies, Inc. The information in this document is preliminary and subject to change without notice. MIPS Technologies, Inc. (MTI) reserves the right to change any portion of the product described herein to improve function or design. MTI does not assume liability arising out of the application or use of any product or circuit described herein. Information on MIPS products is available electronically: (a) Through the World Wide Web. Point your WWW client to: http://www.mips.com (b) Through ftp from the internet site “sgigate.sgi.com”. Login as “ftp” or “anonymous” and then cd to the directory “pub/doc”. (c) Through an automated FAX service: Inside the USA toll free: (800) 446-6477 (800-IGO-MIPS) Outside the USA: (415) 688-4321 (call from a FAX machine) MIPS Technologies, Inc.
    [Show full text]
  • Advanced Computer Architecture
    Computer Architecture MTIT C 103 MIPS ISA and Processor Compiled By Afaq Alam Khan Introduction The MIPS architecture is one example of a RISC architecture The MIPS architecture is a register architecture. All arithmetic and logical operations involve only registers (or constants that are stored as part of the instructions). The MIPS architecture also includes several simple instructions for loading data from memory into registers and storing data from registers in memory; for this reason, the MIPS architecture is called a load/store architecture Register ◦ MIPS has 32 integer registers ($0, $1, ....... $30, $31) and 32 floating point registers ($f0, $f1, ....... $f30, $f31) ◦ Size of each register is 32 bits The $k0, $K1, $at, and $gp registers are reserved for os, assembler and global data And are not used by the programmer Miscellaneous Registers ◦ $PC: The $pc or program counter register points to the next instruction to be executed and is automatically updated by the CPU after instruction are executed. This register is not typically accessed directly by user programs ◦ $Status: The $status or status register is the processor status register and is updated after each instruction by the CPU. This register is not typically directly accessed by user programs. ◦ $cause: The $cause or exception cause register is used by the CPU in the event of an exception or unexpected interruption in program control flow. Examples of exceptions include division by 0, attempting to access in illegal memory address, or attempting to execute an invalid instruction (e.g., trying to execute a data item instead of code). ◦ $hi / $lo : The $hi and $lo registers are used by some specialized multiply and divide instructions.
    [Show full text]
  • The Central Processor Unit
    Systems Architecture The Central Processing Unit The Central Processing Unit – p. 1/11 The Computer System Application High-level Language Operating System Assembly Language Machine level Microprogram Digital logic Hardware / Software Interface The Central Processing Unit – p. 2/11 CPU Structure External Memory MAR: Memory MBR: Memory Address Register Buffer Register Address Incrementer R15 / PC R11 R7 R3 R14 / LR R10 R6 R2 R13 / SP R9 R5 R1 R12 R8 R4 R0 User Registers Booth’s Multiplier Barrel IR Shifter Control Unit CPSR 32-Bit ALU The Central Processing Unit – p. 3/11 CPU Registers Internal Registers Condition Flags PC Program Counter C Carry IR Instruction Register Z Zero MAR Memory Address Register N Negative MBR Memory Buffer Register V Overflow CPSR Current Processor Status Register Internal Devices User Registers ALU Arithmetic Logic Unit Rn Register n CU Control Unit n = 0 . 15 M Memory Store SP Stack Pointer MMU Mem Management Unit LR Link Register Note that each CPU has a different set of User Registers The Central Processing Unit – p. 4/11 Current Process Status Register • Holds a number of status flags: N True if result of last operation is Negative Z True if result of last operation was Zero or equal C True if an unsigned borrow (Carry over) occurred Value of last bit shifted V True if a signed borrow (oVerflow) occurred • Current execution mode: User Normal “user” program execution mode System Privileged operating system tasks Some operations can only be preformed in a System mode The Central Processing Unit – p. 5/11 Register Transfer Language NAME Value of register or unit ← Transfer of data MAR ← PC x: Guard, only if x true hcci: MAR ← PC (field) Specific field of unit ALU(C) ← 1 (name), bit (n) or range (n:m) R0 ← MBR(0:7) Rn User Register n R0 ← MBR num Decimal number R0 ← 128 2_num Binary number R1 ← 2_0100 0001 0xnum Hexadecimal number R2 ← 0x40 M(addr) Memory Access (addr) MBR ← M(MAR) IR(field) Specified field of IR CU ← IR(op-code) ALU(field) Specified field of the ALU(C) ← 1 Arithmetic and Logic Unit The Central Processing Unit – p.
    [Show full text]
  • The Interrupt Program Status Register (IPSR) Contains the Exception Type Number of the Current ISR
    Lab #4: POLLING & INTERRUPTS CENG 255 - iHaz - 2016 Lab4 Objectives Recognize different kinds of exceptions. Understand the behavior of interrupts. Realize the advantages and disadvantages of interrupts relative to polling. Explain what polling is and write code for it. Explain what an Interrupt Service Routine (ISR) is and write code for it. Must be Done Individually Before the Lab. Pre-Lab4 Questions Describe the major difference between polling 1 and interrupt. 2 Explain what APSR, IPSR and EPSR are. 3 Explain how PRIMASK is used. 4 Explain what an exception vector table is. 5 Explain what PORT Control registers are. Must be Done Individually Before the Lab. Polling vs. Interrupt Describe the major difference between polling and interrupt. Polling Interrupt • In polling, the processor continuously • An interrupt is a signal to the microprocessor polls or tests a given device as to whether from a device that requires attention. Upon it requires attention. The polling is receiving an interrupt signal, the microcontroller carried out by a polling program that interrupts whatever it is doing and serves the shares processing time with the currently device. The program which is associated with the running task. A device indicates it interrupt is called the interrupt service routine requires attention by setting a bit in its (ISR) or interrupt handler. device status register. • When ISR is done, the microprocessor continues • Polling the device usually means reading with its original task as if it had never been its status register every so often until the interrupted. This is achieved by pushing the device's status changes to indicate that it contents of all of its internal registers on the has completed the request.
    [Show full text]
  • Computer Organization and Architecture, Rajaram & Radhakrishan, PHI
    CHAPTER I CONTENTS: 1.1 INTRODUCTION 1.2 STORED PROGRAM ORGANIZATION 1.3 INDIRECT ADDRESS 1.4 COMPUTER REGISTERS 1.5 COMMON BUS SYSTEM SUMMARY SELF ASSESSMENT OBJECTIVE: In this chapter we are concerned with basic architecture and the different operations related to explain the proper functioning of the computer. Also how we can specify the operations with the help of different instructions. CHAPTER II CONTENTS: 2.1 REGISTER TRANSFER LANGUAGE 2.2 REGISTER TRANSFER 2.3 BUS AND MEMORY TRANSFERS 2.4 ARITHMETIC MICRO OPERATIONS 2.5 LOGIC MICROOPERATIONS 2.6 SHIFT MICRO OPERATIONS SUMMARY SELF ASSESSMENT OBJECTIVE: Here the concept of digital hardware modules is discussed. Size and complexity of the system can be varied as per the requirement of today. The interconnection of various modules is explained in the text. The way by which data is transferred from one register to another is called micro operation. Different micro operations are explained in the chapter. CHAPTER III CONTENTS: 3.1 INTRODUCTION 3.2 TIMING AND CONTROL 3.3 INSTRUCTION CYCLE 3.4 MEMORY-REFERENCE INSTRUCTIONS 3.5 INPUT-OUTPUT AND INTERRUPT SUMMARY SELF ASSESSMENT OBJECTIVE: There are various instructions with the help of which we can transfer the data from one place to another and manipulate the data as per our requirement. In this chapter we have included all the instructions, how they are being identified by the computer, what are their formats and many more details regarding the instructions. CHAPTER IV CONTENTS: 4.1 INTRODUCTION 4.2 ADDRESS SEQUENCING 4.3 MICROPROGRAM EXAMPLE 4.4 DESIGN OF CONTROL UNIT SUMMARY SELF ASSESSMENT OBJECTIVE: Various examples of micro programs are discussed in this chapter.
    [Show full text]
  • VAX 6000 Platform Technical User's Guide
    VAX 6000 Platform Technical User’s Guide Order Number: EK–600EA–TM-001 This manual serves as a reference for field-level repair or programming for systems based on the VAX 6000 platform. The manual describes the platform architecture, the XMI system bus, the DWMBB XMI-to-VAXBI adapter, and the power and cooling systems found in the H9657-CA/CB/CU cabinet. Digital Equipment Corporation First Printing, May 1991 The information in this document is subject to change without notice and should not be construed as a commitment by Digital Equipment Corporation. Digital Equipment Corporation assumes no responsibility for any errors that may appear in this document. The software, if any, described in this document is furnished under a license and may be used or copied only in accordance with the terms of such license. No responsibility is assumed for the use or reliability of software or equipment that is not supplied by Digital Equipment Corporation or its affiliated companies. Copyright ©1991 by Digital Equipment Corporation All Rights Reserved. Printed in U.S.A. The postpaid READER’S COMMENTS form on the last page of this document requests the user’s critical evaluation to assist in preparing future documentation. The following are trademarks of Digital Equipment Corporation: DEMNA PDP VAXcluster DEC ULTRIX VAXELN DEC LANcontroller UNIBUS VMS DECnet VAX XMI DECUS VAXBI dt This document was prepared using VAX DOCUMENT, Version 1.2 Contents PREFACE xiii CHAPTER 1 THE VAX 6000 PLATFORM OVERVIEW 1–1 1.1 SPECIFICATIONS 1–2 1.2 SYSTEM FRONT VIEW 1–4
    [Show full text]
  • The RISC-V Instruction Set Manual
    The RISC-V Instruction Set Manual Volume II: Privileged Architecture Privileged Architecture Version 1.9.1 Document Version 1.9.1 Warning! This draft specification will change before being accepted as standard by the RISC-V Foundation, so implementations made to this draft specification will likely not conform to the future standard. Andrew Waterman1, Yunsup Lee1, Rimas Aviˇzienis2, David Patterson2, Krste Asanovi´c1;2 1SiFive Inc., 2CS Division, EECS Department, University of California, Berkeley fandrew|[email protected], frimas|pattrsn|[email protected] This document is also available as Technical Report UCB/EECS-2016-161. November 4, 2016 Preface This is version 1.9.1 of the RISC-V privileged architecture proposal. Changes from version 1.9 include: • Numerous additions and improvements to the commentary sections. • Change configuration string proposal to be use a search process that supports various formats including Device Tree String and flattened Device Tree. • Made misa optionally writable to support modifying base and supported ISA extensions. CSR address of misa changed. • Added description of debug mode and debug CSRs. • Added a hardware performance monitoring scheme. Simplified the handling of existing hard- ware counters, removing privileged versions of the counters and the corresponding delta reg- isters. • Fixed description of SPIE in presence of user-level interrupts. i ii 1.9.1: Volume II: RISC-V Privileged Architectures Contents Preface i 1 Introduction 1 1.1 RISC-V Hardware Platform Terminology . .1 1.2 RISC-V Privileged Software Stack Terminology . .2 1.3 Privilege Levels . .3 1.4 Debug Mode . .5 2 Control and Status Registers (CSRs) 7 2.1 CSR Address Mapping Conventions .
    [Show full text]
  • Instruction Set Architecture
    Instruction Set Architecture EE3376 1 –Adapted from notes from BYU ECE124 Topics to Cover… l MSP430 ISA l MSP430 Registers, ALU, Memory l Instruction Formats l Addressing Modes l Double Operand Instructions l Single Operand Instructions l Jump Instructions l Emulated Instructions – http://en.wikipedia.org/wiki/TI_MSP430 2 –Adapted from notes from BYU ECE124 Levels of Transformation –Problems –Algorithms – C Instructions –Language (Program) –Programmable –Assembly Language – MSP 430 ISA –Machine (ISA) Architecture –Computer Specific –Microarchitecture –Manufacturer Specific –Circuits –Devices 3 –Adapted from notes from BYU ECE124 Instruction Set Architecture l The computer ISA defines all of the programmer-visible components and operations of the computer – memory organization l address space -- how may locations can be addressed? l addressibility -- how many bits per location? – register set (a place to store a collection of bits) l how many? what size? how are they used? – instruction set l Opcodes (operation selection codes) l data types (data types: byte or word) l addressing modes (coding schemes to access data) l ISA provides all information needed for someone that wants to write a program in machine language (or translate 4 from a high-level language to machine language). –Adapted from notes from BYU ECE124 MSP430 Instruction Set Architecture l MSP430 CPU specifically designed to allow the use of modern programming techniques, such as: – the computation of jump addresses – data processing in tables – use of high-level languages such as C. l 64KB memory space with 16 16-bit registers that reduce fetches to memory. l Implements RISC architecture with 27 instructions and 7 addressing modes.
    [Show full text]
  • CPU Registers
    Chapter 9 CPU Registers 9-1 CPU Registers 9.1 CPU Registers All of the MSP430 CPU registers can be used with all instructions. 9.1.1 The Program Counter PC One of the main differences from other microcomputer architectures relates to the Program Counter (CPU register R0) that can be used as a normal regis- ter with the MSP430. This means that all of the instructions and addressing modes can be used with the Program Counter too. A branch, for example, is made by simply moving an address into the PC: MOV #LABEL,PC ; Branch to address LABEL MOV LABEL,PC ; Branch to the address contained in address LABEL MOV @R14,PC ; Branch indirect, indirect R14 Note: The Program Counter always points to even addresses. This means that the LSB is always zero. The software has to ensure that no odd addresses are used if the Program Counter is involved. Odd PC addresses will result in non- predictable behavior. 9.1.2 Stack Processing 9.1.2.1 Use of the System Stack Pointer (SP) The system stack pointer (CPU register R1) is a normal register like the others. This means it can use the same addressing modes. This gives good access to all items on the stack, not only to the one on the top of the stack. The system stack pointer (SP) is used for the storage of the following items: - Interrupt return addresses and status register contents - Subroutine return addresses - Intermediate results - Variables for subroutines, floating point package etc. When using the system stack, remember that the microcomputer hardware also uses the stack pointer for interrupts and subroutine calls.
    [Show full text]
  • Lecture 04 RISC-V ISA
    Lecture 04 RISC-V ISA CSCE 513 Computer Architecture Department of Computer Science and Engineering Yonghong Yan [email protected] https://passlab.github.io/CSCE513 1 Acknowledgement • Slides adapted from – Computer Science 152: Computer Architecture and Engineering, Spring 2016 by Dr. George Michelogiannakis from UCB • Reference contents – CAQA A.9 – COD textbook, chapter 2 2 Review: ISA Principles -- Iron-code Summary • Section A.2—Use general-purpose registers with a load-store architecture. • Section A.3—Support these addressing modes: displacement (with an address offset size of 12 to 16 bits), immediate (size 8 to 16 bits), and register indirect. • Section A.4—Support these data sizes and types: 8-, 16-, 32-, and 64-bit integers and 64-bit IEEE 754 floating-point numbers. – Now we see 16-bit FP for deep learning in GPU • http://www.nextplatform.com/2016/09/13/nvidia-pushes-deep-learning-inference- new-pascal-gpus/ • Section A.5—Support these simple instructions, since they will dominate the number of instructions executed: load, store, add, subtract, move register- register, and shift. • Section A.6—Compare equal, compare not equal, compare less, branch (with a PC- relative address at least 8 bits long), jump, call, and return. • Section A.7—Use fixed instruction encoding if interested in performance, and use variable instruction encoding if interested in code size. • Section A.8—Provide at least 16 general-purpose registers, be sure all addressing modes apply to all data transfer instructions, and aim for a minimalist IS – Often use separate floating-point registers. – The justification is to increase the total number of registers without raising problems in the instruction format or in the speed of the general-purpose register file.
    [Show full text]
  • Common Special-Purpose Registers
    Common Special-Purpose Registers • Program counter (PC): address of memory from which the next instruction will be fetched • Status register (SR): stores basic state of the processor • Instruction register: stores the recently fetched instruction Atmel Mega8 Status register • Many machine instructions affect the state of this register Mega8 Status Register Interrupt enable • If ‘1’, the currently executing program can be interrupted by another event (e.g., a byte arriving through the serial port) Mega8 Status Register Half carry flag • Set if an arithmetic operation resulted in a carry from the first nybble to the next Mega8 Status Register Two’s complement overflow flag • Set if an arithmetic operation resulted in an overflow in two’s complement (e.g., incrementing an 8-bit number whose value is 127) Mega8 Status Register Negative flag • Set if an arithmetic operation resulted in a negative value Mega8 Status Register Zero flag • Set if an arithmetic operation resulted in a value of zero Mega8 Status Register Carry flag • Set if an arithmetic operation resulted in a carry (with an unsigned value) Some Mega8 Memory Operations We refer to this as LDS Rd, k “Assembly Language” • Load SRAM memory location k into register Rd • Rd <- (k) STS Rd, k • Store value of Rd into SRAM location k • (k) <- Rd Some Mega8 Memory Operations LD Rd, Ry • Load SRAM memory location indicated by Ry into register Rd • Rd <- (Ry) ST Rd, Ry • Store value of Rd into SRAM location indicated by the value of Ry • (Ry) <- Rd Some Mega8 Arithmetic and Logical Instructions
    [Show full text]