Unformatted text preview:

inst eecs berkeley edu cs61c Review CS61C Machine Structures In MIPS Assembly Language Lecture 9 Introduction to MIPS Data Transfer Decisions I Registers replace C variables One Instruction simple operation per line Simpler is Better Smaller is Faster Lecturer PSOE Dan Garcia www cs berkeley edu ddgarcia Future HVD 1 TB disks The future of digital storage past the DVD Blu Ray and HD DVD may be the Holographic Versatile Disc A massive 1 TB on each 200 DVDs add addi sub New Registers 1TB www zdnet com au news hardware 0 2000061702 39180148 00 htm CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 1 New Instructions Garcia U CB Assembly Operands Memory C Variables s0 s7 Temporary Variables t0 t7 Zero zero CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 2 Anatomy 5 components of any Computer C variables map onto registers what about large data structures like arrays Registers are in the datapath of the processor if operands are in memory we must transfer them to the processor to operate on them and then transfer back to memory when done Personal Computer 1 of 5 components of a computer memory contains such data structures Computer But MIPS arithmetic instructions only operate on registers never directly on memory Processor Data transfer instructions transfer data between registers and memory Datapath Registers Memory to register Control brain Memory Devices Input Store to Load from Output These are data transfer instructions Register to memory CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 3 Garcia U CB Garcia U CB CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 4 Data Transfer Memory to Reg 1 4 Data Transfer Memory to Reg 2 4 To transfer a word of data we need to specify two things To specify a memory address to copy from specify two things Register specify this by 0 31 or symbolic name s0 t0 Memory address more difficult Think of memory as a single onedimensional array so we can address it simply by supplying a pointer to a memory address Other times we want to be able to offset from this pointer Garcia U CB A register containing a pointer to memory A numerical offset in bytes The desired memory address is the sum of these two values Example 8 t0 specifies the memory address pointed to by the value in t0 plus 8 bytes Remember Load FROM memory CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 5 Garcia U CB CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 6 Garcia U CB Data Transfer Memory to Reg 3 4 Data Transfer Memory to Reg 4 4 Load Instruction Syntax Data flow 1 2 3 4 where Example lw t0 12 s0 1 operation name 2 register that will receive value 3 numerical offset in bytes 4 register containing pointer to memory Notes s0 is called the base register 12 is called the offset offset is generally used in accessing elements of array or structure base reg points to beginning of array or structure MIPS Instruction Name lw meaning Load Word so 32 bits or one word are loaded at a time CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 7 This instruction will take the pointer in s0 add 12 bytes to it and then load the value from the memory pointed to by this calculated sum into register t0 Garcia U CB CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 8 Garcia U CB Data Transfer Reg to Memory Pointers v Values Also want to store from register into memory Key Concept A register can hold any 32 bit value That value can be a signed int an unsigned int a pointer memory address and so on Store instruction syntax is identical to Load s MIPS Instruction Name sw meaning Store Word so 32 bits or one word are loaded at a time If you write add t2 t1 t0 then t0 and t1 better contain values Data flow Example sw t0 12 s0 If you write lw t2 0 t0 then t0 better contain a pointer This instruction will take the pointer in s0 add 12 bytes to it and then store the value from register t0 into that memory address Don t mix these up Remember Store INTO memory CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 9 Garcia U CB Addressing Byte vs word Every word in memory has an address similar to an index in an array Early computers numbered words like C numbers elements of an array Memory 0 Memory 1 Memory 2 Called the address of a word Garcia U CB Compilation with Memory What offset in lw to select A 5 in C 4x5 20 to select A 5 byte v word Compile by hand using registers g h A 5 g s1 h s2 s3 base address of A 1st transfer from memory to register Computers needed to access 8 bit bytes as well as words 4 bytes word lw t0 20 s3 Today machines address memory as bytes i e Byte Addressed hence 32bit 4 byte word addresses differ by 4 Memory 0 Memory 4 Memory 8 CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 11 CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 10 Garcia U CB t0 gets A 5 Add 20 to s3 to select A 5 put into t0 Next add it to h and place in g add s1 s2 t0 s1 h A 5 CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 12 Garcia U CB Notes about Memory Pitfall Forgetting that sequential word addresses in machines with byte addressing do not differ by 1 Many an assembly language programmer has toiled over errors made by assuming that the address of the next word can be found by incrementing the address in a register by 1 instead of by the word size in bytes So remember that for both lw and sw the sum of the base address and the offset must be a multiple of 4 to be word aligned CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 13 Garcia U CB Role of Registers vs Memory What if more variables than registers Compiler tries to keep most frequently used variable in registers Less common in memory spilling More Notes about Memory Alignment MIPS requires that all words start at byte addresses that are multiples of 4 bytes Last hex digit 0 1 2 3 of address is Aligned 0 4 8 or Chex 1 5 9 or Dhex Not Aligned 2 6 A or Ehex 3 7 B or Fhex Called Alignment objects must fall on address that is multiple of their size CS61C L09 Introduction to MIPS D ata Transfer D ecisions I 14 Garcia U CB Administrivia HW3 due Wed 23 59 Project 1 up soon due in 10 days Hope you remember your Scheme Why not keep all variables in memory Smaller is faster registers are faster than memory …


View Full Document

Berkeley COMPSCI 61C - Lecture Notes

Documents in this Course
SIMD II

SIMD II

8 pages

Midterm

Midterm

7 pages

Lecture 7

Lecture 7

31 pages

Caches

Caches

7 pages

Lecture 9

Lecture 9

24 pages

Lecture 1

Lecture 1

28 pages

Lecture 2

Lecture 2

25 pages

VM II

VM II

4 pages

Midterm

Midterm

10 pages

Load more
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?