Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture 4. ARM Instructions #1 Prof. Taeweon Suh Computer Science Education Korea University ECM586 Special Topics in Embedded Systems.

Similar presentations


Presentation on theme: "Lecture 4. ARM Instructions #1 Prof. Taeweon Suh Computer Science Education Korea University ECM586 Special Topics in Embedded Systems."— Presentation transcript:

1 Lecture 4. ARM Instructions #1 Prof. Taeweon Suh Computer Science Education Korea University ECM586 Special Topics in Embedded Systems

2 Korea Univ ARM Instruction Overview 2 ARM is a RISC machine, so the instruction length is fixed  In the ARM mode, the instructions are 32-bit wide  In the Thumb mode, the instructions are 16-bit wide Most ARM instructions can be conditionally executed  It means that they have their normal effect only if the N (Negative), Z (Zero), C (Carry) and V (Overflow) flags in the CPSR satisfy a condition specified in the instruction If the flags do not satisfy this condition, the instruction acts as a NOP (No Operation) In other words, the instruction has no effect and advances to the next instruction

3 Korea Univ ARM Instruction Format 3 Memory Access Instructions (Load/Store) Branch Instructions Software Interrupt Instruction Arithmetic and Logical Instructions

4 Korea Univ Condition Field 4

5 Korea Univ ARM Instructions – ADD ADD will add the two operands, placing the result in the destination register.  Use S suffix to update conditional field For example, to update the Carry flag  Operand 1 is a register, operand 2 can be a register, shifted register, or an immediate value: Examples  ADD R0, R1, R2 ; R0 = R1 + R2  ADD R0, R1, #256 ; R0 = R1 + 256  ADDS R0, R2, R3,LSL#1 ; R0 = R2 + (R3 << 1) and update flags The addition may be performed on signed or unsigned numbers. 5

6 Korea Univ Overflow/Underflow Overflow/Underflow:  The answer to an addition or subtraction exceeds the magnitude that can be represented with the allocated number of bits Overflow/Underflow is a problem in computers because the number of bits to hold a number is fixed  For this reason, computers detect and flag the occurrence of an overflow/underflow. Detection of an overflow/underflow after the addition of two binary numbers depends on whether the numbers are considered to be signed or unsigned 6

7 Korea Univ Overflow/Underflow in Unsigned Numbers When two unsigned numbers are added, an overflow is detected from the end carry out of the most significant position  If the end carry is ‘1’, there is an overflow. When two unsigned numbers are subtracted, an underflow is detected when the end carry is “0” 7

8 Korea Univ Subtraction of Unsigned Numbers Unsigned number is either positive or zero  There is no sign bit  So, a n-bit can represent numbers from 0 to 2 n - 1 For example, a 4-bit can represent 0 to 15 (=2 4 – 1)  To declare an unsigned number in C language, unsigned int a;  x86 allocates a 32-bit for “unsigned int” Subtraction of unsigned integers (M, N)  M – N in binary can be done as follows: M + (2 n – N) = M – N + 2 n If M ≥ N, the sum produces an end carry, which is 2 n  Subtraction result is zero or a positive number If M < N, the sum does not produce an end carry since it is equal to 2 n – (N – M)  Unsigned Underflow: subtraction result is negative and unsigned number can’t represent negative numbers 8

9 Korea Univ Overflow/Underflow in Signed Numbers With signed numbers, an overflow/underflow can’t occur for an addition if one number is positive and the other is negative.  Adding a positive number to a negative number produces a result whose magnitude is equal to or smaller than the larger of the original numbers An overflow may occur if two numbers are both positive in addition  When x and y both have sign bits of 0 (positive numbers) If the sum has sign bit of 1, there is an overflow An underflow may occur if two numbers are both negative in addition  When x and y both have sign bits of 1 (negative numbers) If the sum has sign bit of 0, there is an underflow 9

10 Korea Univ Overflow/Underflow in Signed Numbers 10 01001000 (+72) 00111001 (+57) -------------------- (+129) What is largest positive number represented by 8-bit? 8-bit Signed number addition 10000001 (-127) 11111010 ( -6) -------------------- (-133) 8-bit Signed number addition What is smallest negative number represented by 8-bit? Slide from H.H.Lee, Georgia Tech

11 Korea Univ Overflow/Underflow in Signed Numbers So, we can detect overflow/underflow with the following logic  Suppose that we add two k-bit numbers x k-1 x k-2 … x 0 + y k-1 y k-2 … y 0 = s k-1 s k-2 … s 0 Overflow = x k-1 y k-1 s k-1 + x k-1 y k-1 s k-1 There is an easier formula  Let the carry out of the full adder adding two numbers be c k-1 c k-2 … c 0 Overflow = c k-1 + c k-2  If a 0 (c k-2 ) is carried in, the only way that 1 (c k-1 ) can be carried out is if x k- 1 = 1 and y k-1 = 1 Adding two negative numbers results in a non-negative number  If a 1 (c k-2 ) is carried in, the only way that 0 (c k-1 ) can be carried out is if x k- 1 = 0 and y k-1 = 0 Adding two positive numbers results in a negative number 11

12 Korea Univ Overflow/Underflow Detection in Signed Numbers 12 Full Adder AB Cin Cout S S0 A0B0 Full Adder AB Cin Cout S S1 A1B1 Full Adder AB Cin Cout S S2 A2B2 Full Adder AB Cin Cout S S3 A3B3 Carry Overflow/ Underflow n-bit Adder/Subtractor Overflow/ Underflow Cn Cn-1 Slide from H.H.Lee, Georgia Tech

13 Korea Univ Recap Unsigned numbers  Overflow could occur when 2 unsigned numbers are added An end carry of “1” indicates an overflow  Underflow could occur when 2 unsigned numbers are subtracted An end carry of “0” indicates an underflow.  minuend < subtrahend Signed numbers  Overflow could occur when 2 signed positive numbers are added  Underflow could occur when 2 signed negative numbers are added  Overflow flag indicates both overflow and underflow 13

14 Korea Univ Recap Binary numbers in 2s complement system are added and subtracted by the same basic addition and subtraction rules as used in unsigned numbers  Therefore, computers need only one common hardware circuit to handle both types (signed, unsigned numbers) of arithmetic The programmer must interpret the results of addition or subtraction differently, depending on whether it is assumed that the numbers are signed or unsigned. 14

15 Korea Univ ARM Flags In general, computer has several flags (registers) to indicate state of operations such as addition and subtraction  N: Negative  Z: Zero  C: Carry  V: Overflow We have only one adder inside a computer.  CPU does comparison of signed or unsigned numbers by subtraction using adder  CPU sets the flags depending on the result of operation  These flags provide enough information to judge that one is bigger than or less than the other? 15

16 Korea Univ ARM Flags (Cont) 16

17 Korea Univ ARM Instructions – Sub (Subtraction) SUB subtracts operand 2 from operand 1, placing the result in the destination register.  Use S suffix to update conditional field For example, to update the Carry flag  Operand 1 is a register, operand 2 can be a register, shifted register, or an immediate value: Examples  SUB R0, R1, R2 ; R0 = R1 - R2  SUB R0, R1, #256 ; R0 = R1 - 256  SUB R0, R2, R3,LSL#1 ; R0 = R2 - (R3 << 1) and update flags The subtraction may be performed on signed or unsigned numbers. 17

18 Korea Univ ARM Instructions – AND (Logical AND) AND will perform a logical AND between the two operands, placing the result in the destination register  It is useful for masking the bits  Operand 1 is a register, operand 2 can be a register, shifted register, or an immediate value Example AND R0, R0, #3 ; Keep bits zero and one of R0 and discard the rest 18

19 Korea Univ ARM Instructions – EOR (Exclusive OR) AND will perform a logical Exclusive OR between the two operands, placing the result in the destination register  It is useful for inverting certain bits  Operand 1 is a register, operand 2 can be a register, shifted register, or an immediate value Example EOR R0, R0, #3 ; Invert bits zero and one of R0 19

20 Korea Univ ARM Instructions – MOV (MOVE) MOV loads a value into the destination register from another register, a shifted register, or an immediate value  Operand 1 is a register, operand 2 can be a register, shifted register, or an immediate value Examples MOV R0, R0; move R0 to R0, Thus, no effect MOV R0, R0, LSL#3 ; R0 = R0 * 8 MOV PC, R14; (R14: link register) Used to return to caller MOVS PC, R14; PC <- R14 (lr), CPSR <- SPSR ; Used to return from interrupt or exception 20

21 Korea Univ ARM Instructions – B, BL B (branch) and BL (branch with link) are used for conditional or unconditional branch  BL is used for the subroutine (procedure, function) call  To return from a subroutine, use MOV PC, R14; (R14: link register) Used to return to caller Branch target address  Sign-extend the 24-bit signed immediate (2’s complement) to 30-bits  Left-shift the result by 2 bits  Add it to the current PC (actually, PC+8)  Thus, the branch target could be ±32MB away from the current instruction 21

22 Korea Univ ARM Instructions – LDR (Load Register) 22 The LDR instruction loads a word from a memory location to a register  The memory location (addressing) is specified in a very flexible manner Examples  LDR R0, [R1] // R0 <- [R1]  LDR R0, [R1, #16] // R0 <- [R1+16]

23 Korea Univ ARM Instructions – STR (Store Register) 23 The STR instruction stores a word to a memory location from a register  The memory location (addressing) is specified in a very flexible manner Examples  STR R0, [R1] // [R1] <- R0  STR R0, [R1, #16] // [R1+16] <- R0

24 Korea Univ LDR, STR - Single Data Transfer Single data transfer instructions: STR, LDR  Format: LDR R0, [address] // R0 ← [address] (32-bit data) STR R0, [address] // [address] ← R0 (32-bit data)  [address] can be like below STR R0, [Rbase] // [Rbase] ← R0  Ex) STR R0, [R1] // [R1] ← R0 STR R0, [Rbase, Rindex] // [Rbase+Rindex] ← R0  Ex) STR R0, [R1, R2] // [R1+R2] ← R0 STR R0, [Rbase, #index] // [Rbase+index] ← R0  Ex) STR R0, [R1, #16] // [R1+16] ← R0 STR R0, [Rbase, Rindex]! // [Rbase+Rindex] ← R0 // Rbase ← Rbase + Rindex STR R0, [Rbase, #index]! // [Rbase+index] ← R0 // Rbase ← Rbase + Rindex STR R0, [Rbase], Rindex // [Rbase] ← R0 // Rbase ← Rbase + index STR R0, [Rbase, Rindex, LSL #n] // [Rbase+Rindex << n] ← R0 24

25 Korea Univ ARM Instructions – LDM, STM 25 The LDM (Load Multiple) instruction loads general- purpose registers from sequential memory locations The STM (Store Multiple) instruction stores general- purpose registers to sequential memory locations

26 Korea Univ LDM, STM - Multiple Data Transfer Multiple data transfer instructions (LDM and STM) are used to load and store multiple words of data from/to main memory 26 IA: Increment After IB: Increment Before DA: Decrement After DB: Decrement Before FA: Full Ascending (in stack) FD: Full Descending (in stack) EA: Empty Ascending (in stack) ED: Empty Descending (in stack) StackOtherDescription STMFASTMIBPre-incremental store STMEASTMIAPost-incremental store STMFDSTMDBPre-decremental store STMEDSTMDAPost-decremental store LDMEDLDMIBPre-incremental load LDMFDLDMIAPost-incremental load LDMEALDMDBPre-decremental load LDMFALDMDAPost-decremental load

27 Korea Univ LDM, STM - Multiple Data Transfer  In multiple data transfer, the register list is given in a curly brackets {}  It doesn’t matter which order you specify the registers in They are stored from lowest to highest Examples  STMFD R13! {R0, R1} // R13 is updated  LDMFD R13! {R1, R0} // R13 is updated  A useful shorthand is “-” It specifies the beginning and end of registers Examples  STMFD R13!, {R0-R12} // R13 is updated appropriately  LDMFD R13!, {R0-R12} // R13 is updated appropriately 27

28 Korea Univ ARM Instructions – MSR, MRS 28 MSR: Move the value of a general-purpose register or an immediate constant to the CPSR or SPSR of the current mode  Examples: MSR CPSR_all, R0 ; Copy R0 into CPSR MSR SPSR_all, R0 ; Copy R0 into SPSR MRS: Move the value of the CPSR or the SPSR of the current mode into a general-purpose register  Examples: MRS R0, CPSR_all ; Copy CPSR into R0 MRS R0, SPSR_all ; Copy SPSR into R0 To change the operating mode, use the following code  Example: change to the supervisor mode MRS R0,CPSR ; Read CPSR BIC R0,R0,#0x1F ; Remove current mode with bit clear instruction ORR R0,R0,#0x13 ; Substitute to the Supervisor mode MSR CPSR_c,R0 ; Write the result back to CPSR

29 Korea Univ ARM Instructions – SWI (Software Interrupt) The SWI instruction incurs a software interrupt  It is used by operating systems for system calls  24-bit immediate value is ignored by the ARM processor, but can be used by the SWI exception handler in an operating system to determine what operating system service is being requested Operations  CPSR is saved in SPSR  The next instruction’s PC of swi is saved in lr (R14: Link Register)  PC is changed to 0x0000_0008 Example  swi 0x3 ; SPSR <- CPSR, ; lr (R14) <- PC after swi 0x3 To return from the software interrupt, use MOVS PC, R14; PC <- R14 (lr), CPSR <- SPSR 29

30 Korea Univ Backup Slides 30

31 Korea Univ ARM Instructions – ADC (Add with Carry) ADC will add the two operands, placing the result in the destination register.  It uses a carry bit, so can add numbers larger than 32 bits. The following example will add two 128 bit numbers 128 bit result: registers 0, 1, 2, and 3 128 bit first operand: registers 4, 5, 6, and 7 128 bit second operand: registers 8, 9, 10, and 11  ADDS R0, R4, R8 ; Add low words  ADCS R1, R5, R9 ; Add next word, with carry  ADCS R2, R6, R10 ; Add third word, with carry  ADCS R3, R7, R11 ; Add high word, with carry 31


Download ppt "Lecture 4. ARM Instructions #1 Prof. Taeweon Suh Computer Science Education Korea University ECM586 Special Topics in Embedded Systems."

Similar presentations


Ads by Google