The 26-bit Architectures ARM DDI 0100E Copyright © 1996-2000 ARM Limited. All rights reserved. A8-11 26-bit configuration 1. If PROG32 is not active, the processor is locked into 26-bit modes (that is, cannot be placed into a 32-bit mode by any means) and handles exceptions in 26-bit modes. This is called a 26-bit configuration. In this configuration, CMNP, CMPP, TEQP and TSTP instructions, or the MSR instruction can be used to switch to 26-bit modes. Attempts to write CPSR bits[4:2] (M[4:2]) are ignored, stopping any attempts to switch to a 32-bit mode, and SVC_26 mode is used to handle memory aborts and Undefined Instruction exceptions. The PC is limited to 24 bits, limiting the addressable program memory to 64MB. 2. If PROG32 is not active, DATA32 has the following actions: •If DATA32 is not active, all data addresses are checked to ensure that they are between 0 and 64MB. If a data address is produced with a 1 in any of the top 6 bits, an address exception is generated. •If DATA32 is active, full 32-bit addresses can be produced and are not checked for address exceptions. This allows 26-bit programs to access data in the full 32-bit address space. 8.5.2 Vector exceptions When the processor is in a 32-bit configuration (PROG32 is active) and in a 26-bit mode (CPSR[4] == 0), data access (but not instruction fetches) to the exception vectors (address 0x0 to 0x1F) causes a data abort. This is known as a vector exception. Vector exceptions are always produced if the exception vectors are written in a 32-bit configuration and a 26-bit mode. It is IMPLEMENTATION DEFINED whether reading the exception vectors in a 32-bit configuration and a 26-bit mode also causes a vector exception. Vector exceptions are provided to support 26-bit backwards compatibility. When a vector exception is generated, it indicates that a 26-bit mode process is trying to install a (26-bit) vector handler. Because the processor is in a 32-bit configuration, exceptions are handled in a 32-bit mode, so a veneer must be used to change from the 32-bit exception mode to a 26-bit mode before calling the 26-bit exception handler. This veneer can be installed on each vector and can switch to a 26-bit mode before calling any 26-bit handlers. The return from the 26-bit exception handler might also need to be veneered. Some SWI handlers return status information in the processor flags, and this information needs to be transferred from the link register to the SPSR with a return veneer for the SWI handler. Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. The 26-bit Architectures A8-12 Copyright © 1996-2000 ARM Limited. All rights reserved. ARM DDI 0100E Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM DDI 0100E Copyright © 1996-2000 ARM Limited. All rights reserved. A9-1 Chapter A9 ARM Code Sequences The ARM instruction set is a powerful tool for generating high-performance microprocessor systems. Used to its full extent, the ARM instruction set allows algorithms to be coded in a very compact and efficient way. This chapter describes some sample routines that provide insight into the ARM instruction set. It contains the following sections: • Arithmetic instructions on page A9-2 • Branch instructions on page A9-5 • Load and Store instructions on page A9-7 • Load and Store Multiple instructions on page A9-10 • Semaphore instructions on page A9-11 • Other code examples on page A9-12. Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM Code Sequences A9-2 Copyright © 1996-2000 ARM Limited. All rights reserved. ARM DDI 0100E 9.1 Arithmetic instructions The following subsections illustrate some ways of using ARM data-processing instructions. The examples illustrate: • Bit field manipulation • Multiplication by constant • Multi-precision arithmetic on page A9-3 • Swapping endianness on page A9-4. 9.1.1 Bit field manipulation The ARM shift and logical instructions can be used for bit field manipulation: ; Extract 8 bits from the top of R2 and insert them into ; the bottom of R3, shifting up the data in R3 ; R0 is a temporary value MOV R0, R2, LSR #24 ; extract top bits from R2 into R0 ORR R3, R0, R3, LSL #8 ; shift up R3 and insert R0 9.1.2 Multiplication by constant Combinations of shifts, add with shifts, and reverse subtract with shift can be used to perform multiplications by constants: ; multiplication of R0 by 2^n MOV R0, R0, LSL #n ; R0 = R0 << n ; multiplication of R0 by 2^n + 1 ADD R0, R0, R0, LSL #n ; R0 = R0 + (R0 << n) ; multiplication of R0 by 2^n - 1 RSB R0, R0, R0, LSL #n ; R0 = (R0 << n) - R0 ; R0 = R0 * 10 + R1 ADD R0, R0, R0, LSL #2 ; R0 = R0 * 5 ADD R0, R1, R0, LSL #1 ; R0 = R1 + R0 * 2 ; R0 = R0 * 100 + R1 ADD R0, R0, R0, LSL #2 ; R0 = R0 * 5 ADD R0, R0, R0, LSL #2 ; R0 = R0 * 5 (R0 = R0 * 25) ADD R0, R1, R0, LSL #2 ; R0 = R1 + R0 * 4 Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM Code Sequences ARM DDI 0100E Copyright © 1996-2000 ARM Limited. All rights reserved. A9-3 9.1.3 Multi-precision arithmetic Arithmetic instructions allow efficient arithmetic on 64-bit or larger objects: • Add, and Add with Carry perform multi-precision addition • Subtract, and Subtract with Carry perform subtraction • Compare can be used for comparison. ; On entry : R0 and R1 hold a 64-bit number ; : (R0 is least significant) ; : R2 and R3 hold a second 64-bit number ; On exit : R0 and R1 hold 64-bit sum (or difference) of the 2 numbers add64 ADDS R0, R0, R2 ; add lower halves and update Carry flag ADC R1, R1, R3 ; add the high halves and Carry flag sub64 SUBS R0, R0, R2 ; subtract lower halves, update Carry SBC R1, R1, R3 ; subtract high halves and Carry ; This routine compares two 64-bit numbers ; On entry : As above ; On exit : N, Z, and C flags updated correctly cmp64 CMP R1, R3 ; compare high halves, if they are CMPEQ R0, R2 ; equal, then compare lower halves Be aware that in the above example, the V flag is not updated correctly. For example: R1 = 0x00000001, R0 = 0x80000000 R3 = 0x00000001, R2 = 0x7FFFFFFF R0 – R2 overflows as a 32-bit signed number, so the CMPEQ instruction sets the V flag. But (R1, R0) – (R3, R2) does not overflow as a 64-bit number. An alternative routine exists which updates the V flag correctly, but not the Z flag: ; This routine compares two 64-bit numbers ; On entry: as above ; On exit: N, V and C set correctly ; R4 is destroyed cmp64 SUBS R4, R0, R2 SBCS R4, R1, R3 Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM Code Sequences A9-4 Copyright © 1996-2000 ARM Limited. All rights reserved. ARM DDI 0100E 9.1.4 Swapping endianness Swapping the order of bytes in a word (the endianness) can be performed in two ways: • This method is best for single words: ; On entry : R0 holds the word to be swapped ; On exit : R0 holds the swapped word, R1 is destroyed byteswap ; R0 = A , B , C , D EOR R1, R0, R0, ROR #16 ; R1 = A^C,B^D,C^A,D^B BIC R1, R1, #0xFF0000 ; R1 = A^C, 0 ,C^A,D^B MOV R0, R0, ROR #8 ; R0 = D , A , B , C EOR R0, R0, R1, LSR #8 ; R0 = D , C , B , A • This method is best for swapping the endianness of a large number of words: ; On entry : R0 holds the word to be swapped ; On exit : R0 holds the swapped word, ; : R1, R2 and R3 are destroyed byteswap ; first the two-instruction initialization MOV R2, #0xFF ; R2 = 0xFF ORR R2, R2, #0xFF0000 ; R2 = 0x00FF00FF ; repeat the following code for each word to swap ; R0 = A B C D AND R1, R2, R0 ; R1 = 0 B 0 D AND R0, R2, R0, ROR #24 ; R0 = 0 C 0 A ORR R0, R0, R1, ROR #8 ; R0 = D C B A Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM Code Sequences ARM DDI 0100E Copyright © 1996-2000 ARM Limited. All rights reserved. A9-5 9.2 Branch instructions The following subsections show some different ways of controlling the flow of execution in ARM code. 9.2.1 Procedure call and return The BL (Branch and Link) instruction makes a procedure call by preserving the address of the instruction after the BL in R14 (the link register, LR), and then branching to the target address. Returning from a procedure is achieved by moving R14 to the PC: BL function ; call ‘function’ ; procedure returns to here function ; function body MOV PC, LR ; Put R14 into PC to return Another method to return from a called procedure is given in Procedure entry and exit on page A9-10. 9.2.2 Conditional execution Conditional execution allows if-then-else statements to be collapsed into sequences that do not require forward branches: /* C code for Euclid’s Greatest Common Divisor (GCD)*/ /* Returns the GCD of its two parameters */ int gcd(int a, int b) { while (a != b) if (a > b ) a = a - b ; else b = b - a ; return a ; } ; ARM assembler code for Euclid’s Greatest Common Divisor ; On entry: R0 holds ‘a’, R1 holds ‘b’ ; On exit : R0 hold GCD of A and B gcd CMP R0, R1 ; compare ‘a’ and ‘b’ SUBGT R0, R0, R1 ; if (a>b) a=a-b (if a==b do nothing) SUBLT R1, R1, R0 ; if (b>a) b=b-a (if a==b do nothing) BNE gcd ; if (a!=b) then keep going MOV PC, LR ; return to caller Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM Code Sequences A9-6 Copyright © 1996-2000 ARM Limited. All rights reserved. ARM DDI 0100E 9.2.3 Conditional compare instructions Compare instructions can be conditionally executed to implement more complicated expressions: if (a==0 || b==1) c = d + e ; CMP R0, #0 ; compare a with 0 CMPNE R1, #1 ; if a is not 0, compare b to 1 ADDEQ R2, R3, R4 ; if either was true c = d + e 9.2.4 Loop variables The Subtract instruction can be used to both decrement a loop counter and set the condition codes to test for a zero: MOV R0, #loopcount ; initialize the loop counter loop ; loop body SUBS R0, R0, #1 ; subtract 1 from counter ; and set condition codes BNE loop ; if not zero, continue looping 9.2.5 Multi-way branch A very simple multi-way branch can be implemented with a single instruction. The following code dispatches the control of execution to any number of routines, with the restriction that the code to handle each case of the multi-way branch is the same size, and that size is a power of two bytes: ; Multi-way branch ; On entry: R0 holds the branch index CMP R0, #maxindex ; checks the index is in range ADDLO PC, PC, R0, LSL #RoutineSizeLog2 ; scale index by the log of the size of ; each handler, add to the PC, which points ; 2 instructions beyond this one ; (at Index0Handler), then jump there B IndexOutOfRange ; jump to the error handler Index0Handler Index1Handler Index2Handler Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM Code Sequences ARM DDI 0100E Copyright © 1996-2000 ARM Limited. All rights reserved. A9-7 9.3 Load and Store instructions Load and Store instructions are the best way to load or store a single word. They are also the only instructions that can load or store a byte or halfword. 9.3.1 Linked lists The following code searches for an element in a linked list that has two elements (a single byte value and a pointer to the next record) in each record. A null next pointer indicates this is the last element in the list: ; Linked list search ; On entry : R0 holds a pointer to the first record in the list ; : R1 holds the byte we are searching for ; : Call this code with a BL ; On exit : R0 holds the address of the first record matched ; : or a null pointer if no match was found ; : R2 is destroyed llsearch CMP R0, #0 ; null pointer? LDRNEB R2, [R0] ; load the byte value from this record CMPNE R1, R2 ; compare with the looked-for value LDRNE R0, [R0, #4] ; if not found, follow the link to the BNE llsearch ; next record and then keep looking MOV PC, LR ; return with pointer in R0 9.3.2 Simple string compare The following code performs a very simple string compare on two zero-terminated strings: ; String compare ; On entry : R0 points to the first string ; : R1 points to the second string ; : Call this code with a BL ; On exit : R0 is < 0 if the first string is less than the second ; : R0 is = 0 if the first string is equal to the second ; : R0 is > 0 if the first string is greater than the second ; : R1, R2 and R3 are destroyed strcmp LDRB R2, [R0], #1 ; Get a byte from the first string LDRB R3, [R1], #1 ; Get a byte from the second string CMP R2, #0 ; Have we reached the end of either CMPNE R3, #0 ; string? BEQ return ; Go to return code if so CMP R2, R3 ; Are the strings the same so far? BEQ strcmp ; Repeat for next character if so return SUB R0, R2, R3 ; Calculate result value and return MOV PC, LR ; by copying R14 (LR) into the PC Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. ARM Code Sequences A9-8 Copyright © 1996-2000 ARM Limited. All rights reserved. ARM DDI 0100E The following code performs a more optimized string compare: int strcmp(char *s1, char *s2) { unsigned int ch1, ch2; do { ch1 = *s1++; ch2 = *s2++; } while (ch1 >= 1 && ch1 == ch2); return ch1 - ch2; } This code uses an unsigned comparison with 1 to test for a null character, rather than the normal comparison with 0. The corresponding ARM code is: strcmp LDRB R2,[R0],#1 LDRB R3,[R1],#1 CMP R2,#1 CMPCS R2,R3 BEQ strcmp SUB R0,R2,R3 MOV PC,LR The change in the way that null characters are detected allows the condition tests to be combined: • If R2 == 0, the CMP instruction sets Z = 0, C = 0. Neither the CMPCS instruction nor the BEQ instruction is executed, and the loop terminates. • If R2 != 0 and R3 == 0, the CMP instruction sets C = 1, then the CMPCS instruction is executed and sets Z = 0. So, the BEQ instruction is not executed and the loop terminates. • If R2 != 0 and R3 != 0, the CMP instruction sets C = 1, then the CMPCS instruction is executed and sets Z according to whether R2 == R3. So, the BEQ instruction is executed if R2 == R3 and the loop terminates if R2 != R3. Much faster string comparison routines are possible by loading one word of each string at a time and comparing all four bytes. Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. [...]... transfer two ARM register values to or from the coprocessor rather than just one They can be used when designing coprocessors which require more ARM- coprocessor bandwidth than is available from the MCR and MRC instructions The instructions are: MCRR Transfers two ARM register values to a coprocessor MRRC Transfers values from a coprocessor to two ARM registers ARM DDI 0100E Copyright © 1996-2000 ARM Limited... from the correct places in the PCB Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark ARM DDI 0100E Chapter A10 Enhanced DSP Extension This chapter describes the enhanced DSP additions to the ARM programmer’s model and instruction set, included in E variants of ARM architecture versions 5 and above It contains the following... by the LDRD instruction The address of the higher word is generated by adding 4 to this address Architecture version E variants of version 5 and above, excluding ARMv5TExP A10-8 Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark ARM DDI 0100E Enhanced DSP Extension Exceptions Data abort Operation if ConditionPassed(cond) then... names are p0, p1, …, p15 Is a coprocessor-specific opcode Is the first ARM register whose value is transferred to the coprocessor If R15 is specified for , the result is UNPREDICTABLE Is the second ARM register whose value is transferred to the coprocessor If R15 is specified for , the result is UNPREDICTABLE Is the destination coprocessor register Architecture version... swapping the addressing modes between the conditional load instructions and the conditional store instructions A9-14 Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark ARM DDI 0100E ARM Code Sequences 9.6.4 Interrupt prioritization This code dispatches up to 32 interrupt sources to their appropriate handler routines This... SPSR MSR SPSR_cxsf, r12 ; Put the SPSR back LDMFD r13!, {r12, PC}^ ; Restore last working register and return Priority1Handler ARM DDI 0100E Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark A9-15 ARM Code Sequences where: R13 IntBase Holds the base address of the interrupt handler IntLevel 9.6.5 Is assumed to point to a... Control Block (PCB), which stores its register values while it is not running The format of a PCB is shown in Figure 9-1 Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark ARM DDI 0100E ARM Code Sequences CPSR Restart address Increasing addresses R0 R1 R2 R3 R4 R5 R6 R7 R8 R9 R10 R11 R12 R13 R14 Figure 9-1 PCB layout On entry... entry and by execution of the normal interrupt processing code, so this fully restores the context of the interrupted process ARM DDI 0100E Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark A9-17 ARM Code Sequences If the normal interrupt processing code instead switches to another User mode process, it puts pointers to... procedure (by checking the condition with a compare instruction and then conditionally executing the Load Multiple) A9-10 Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark ARM DDI 0100E ARM Code Sequences 9.5 Semaphore instructions This code controls the entry and exit from a critical section of code The semaphore instruction... instructions which transfer 64 bits of data directly between the ARM processor and the coprocessor, in order to assist the design of coprocessors which will further improve the performance of DSP algorithms A10-2 Copyright © 1996-2000 ARM Limited All rights reserved Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark ARM DDI 0100E Enhanced DSP Extension 10.2 Saturated integer arithmetic . remove this watermark. ARM DDI 0100E Copyright © 1996-2000 ARM Limited. All rights reserved. A9-1 Chapter A9 ARM Code Sequences The ARM instruction set is. to remove this watermark. The 26-bit Architectures A8-12 Copyright © 1996-2000 ARM Limited. All rights reserved. ARM DDI 0100E Please purchase PDF Split-Merge