ARM NEON optimization

haidaowang

1 z- [2 [4 Y, ?' p9 s+ f0 c2 u1. Introduction
, T& c: ^8 e# f  B  L5 P3 yAfter reading the article ARM NEON programming quick reference, I believe you have a basic understanding of ARM NEON programming. But when applying ARM NEON to a real-world applications, there are many programming skills to observe.This article aims to introduce some common NEON optimization skills which come from development practice. The issue of NEON assembly and intrinsics will also be discussed.
: u, B! m" f& X/ p% r
2. NEON optimization skills
- u, U9 C' f! s3 o# I6 YWhen using NEON to optimize applications, there are some commonly used optimization skills as follows.
8 O7 [1 d5 E  q* L/ x0 `) ^
- `/ Z& u% [. B8 K* N2.1. Remove data dependencies
On the ARMv7-A platform, NEON instructions usually take more cycles than ARM instructions. To reduce instruction latency, it’s better to avoid using the destination register of current instruction as the source register of next instruction.

; g3 q0 g3 p- q* z5 g& rExample:
, W' Q- g& `: |C code:

• float SumSquareError_C(const float* src_a, const float* src_b, int count)
• {
•   float sse = 0u;
•   int i;
•   for (i = 0; i < count; ++i) {
•     float diff = src_a - src_b;
•     sse += (float)(diff * diff);
•   }
•   return sse;
• }
  

+ n% t% a, P( y) V
+ b; E& y" Q3 ]* L. N
. D& y6 g" R/ C7 s
' C4 G4 R; V9 O; U2 cNEON implementation 1

8 M9 p7 u6 j  O5 G

• float SumSquareError_NEON1(const float* src_a, const float* src_b, int count)
• {
•   float sse;
•   asm volatile (
•     // Clear q8, q9, q10, q11
•     "veor    q8, q8, q8                            \n"
•     "veor    q9, q9, q9                            \n"
•     "veor    q10, q10, q10                     \n"
•     "veor    q11, q11, q11                     \n"
•   "1:                                                           \n"
•     "vld1.32     {q0, q1}, [%[src_a]]!       \n"
•     "vld1.32     {q2, q3}, [%[src_a]]!       \n"
•     "vld1.32     {q12, q13}, [%[src_b]]!  \n"
•     "vld1.32     {q14, q15}, [%[src_b]]!  \n"
• "subs %[count], %[count], #16  \n"
• // q0, q1, q2, q3 are the destination of vsub.
• // they are also the source of vmla.
•     "vsub.f32 q0, q0, q12                      \n"
•     "vmla.f32   q8, q0, q0                        \n"
•     "vsub.f32   q1, q1, q13                      \n"
•     "vmla.f32   q9, q1, q1                       \n"
•     "vsub.f32   q2, q2, q14                    \n"
•     "vmla.f32   q10, q2, q2                    \n"
•     "vsub.f32   q3, q3, q15                    \n"
•     "vmla.f32   q11, q3, q3                    \n"
•     "bgt        1b                                        \n"
•     "vadd.f32   q8, q8, q9                      \n"
•     "vadd.f32   q10, q10, q11               \n"
•     "vadd.f32   q11, q8, q10                 \n"
•     "vpadd.f32  d2, d22, d23                \n"
•     "vpadd.f32  d0, d2, d2                     \n"
•     "vmov.32    %3, d0[0]                      \n"
•     : "+r"(src_a),
•       "+r"(src_b),
•       "+r"(count),
•       "=r"(sse)
•     :
•     : "memory", "cc", "q0", "q1", "q2", "q3", "q8", "q9", "q10", "q11",
•       "q12", "q13","q14", "q15");
•   return sse;
• }
  

8 {- P1 D: Y; u2 [% z* T2 o

/ a6 a# E9 ], {NEON implementation 2
$ e- Q3 X* c5 ^+ n, s9 E
8 }/ I) {9 ?- e' z& _% S

• float SumSquareError_NEON2(const float* src_a, const float* src_b, int count)
• {
•   float sse;
•   asm volatile (
•     // Clear q8, q9, q10, q11
•     "veor    q8, q8, q8                            \n"
•     "veor    q9, q9, q9                            \n"
•     "veor    q10, q10, q10                     \n"
•     "veor    q11, q11, q11                     \n"
•   "1: \n"
•     "vld1.32     {q0, q1}, [%[src_a]]!       \n"
•     "vld1.32     {q2, q3}, [%[src_a]]!       \n"
•     "vld1.32     {q12, q13}, [%[src_b]]!  \n"
•     "vld1.32     {q14, q15}, [%[src_b]]!  \n"
•     "subs       %[count], %[count], #16  \n"
•     "vsub.f32 q0, q0, q12                      \n"
•     "vsub.f32   q1, q1, q13                     \n"
•     "vsub.f32   q2, q2, q14                     \n"
•     "vsub.f32   q3, q3, q15                     \n"
•     "vmla.f32   q8, q0, q0                      \n"
•     "vmla.f32   q9, q1, q1                      \n"
•     "vmla.f32   q10, q2, q2                    \n"
•     "vmla.f32   q11, q3, q3                    \n"
•     "bgt        1b                                         \n"
•     "vadd.f32   q8, q8, q9                      \n"
•     "vadd.f32   q10, q10, q11                \n"
•     "vadd.f32   q11, q8, q10                  \n"
•     "vpadd.f32  d2, d22, d23                 \n"
•     "vpadd.f32  d0, d2, d2                      \n"
•     "vmov.32    %3, d0[0]                       \n"
•     : "+r"(src_a),
•       "+r"(src_b),
•       "+r"(count),
•       "=r"(sse)
•     :
•     : "memory", "cc", "q0", "q1", "q2", "q3", "q8", "q9", "q10", "q11",
•       "q12", "q13","q14", "q15");
•   return sse;
• }
  9 e& {. P( J' N0 y

; y% G& [, q, x* V9 L
5 A7 o& ?- z3 Q0 e9 z: z

  U9 m, c# `! EIn NEON implementation 1, the destination register is used as source register immediately; In NEON implementation 2, instructions are rescheduled and given the latency as much as possible. The test result indicates that implementation 2 is ~30% faster than implementation 1. Thus, reducing data dependencies can improve peRFormance significantly. A good news is that compiler can fine-tune NEON intrinsics automatically to avoid data dependencies which is really one of the big advantages.
! v4 R  a* E# C+ \& h9 v+ K, h
Note: this test runs on Cortex-A9. The result may be different on other platforms.

, x% L, L2 z6 l" f: r
2.2 Reduce branches
There isn’t branch jump instruction in NEON instruction set. When the branch jump is needed, jump instructions of ARM are used. In ARM processors, branch prediction techniques are widely used. But once the branch prediction fails, the punishment is rather high. So it’s better to avoid the using jump instructions. In fact, logical operations can be used to replace branch in some cases.
" n6 A2 F* c- q2 ~; e, j0 l
Example:
1 P5 j' S$ b5 z; n+ U% r5 A: R
C implementation
8 G3 V* a' u& J/ i" K" d

• if( flag )
• {
•         dst[x * 4]       = a;
•         dst[x * 4 + 1] = a;
•         dst[x * 4 + 2] = a;
•         dst[x * 4 + 3] = a;
• }
• else
• {
•         dst[x * 4]       = b;
•         dst[x * 4 + 1] = b;
•         dst[x * 4 + 2] = b;
•         dst[x * 4 + 3] = b;
• }
  

NEON implementation
% T. O; |3 i0 P- U* J2 K7 a3 n
# V* V3 x- z! E0 D! _$ z- ~

• //dst[x * 4]       = (a&Eflag) | (b&~Eflag);
• //dst[x * 4 + 1] = (a&Eflag) | (b&~Eflag);
• //dst[x * 4 + 2] = (a&Eflag) | (b&~Eflag);
• //dst[x * 4 + 3] = (a&Eflag) | (b&~Eflag);
• VBSL qFlag, qA, qB
  7 B" |0 b. [- n& O. d

7 A% _4 e* X( O9 M) I1 E


- r) S5 ]/ N7 ~+ Q. _* y$ JARM NEON instruction set provides the instructions as follows to help users implement the logical operation above:
5 M0 w7 p; t$ _6 {# A

• VCEQ, VCGE, VCGT, VCLE, VCLT
• VBIT, VBIF, VBSL
  

, h# y: c$ ]% iReducing branches is not specific to NEON only. It is a commonly used trick. Even in a C program, this trick is also worth the effort.


  \4 }  F8 b* c& u5 N" D! b2.3 Preload data-PLD
) _5 z, t8 Q8 G5 f! {1 `
5 Q, x0 p7 p; i4 \* dARM processors are a load/store system. Except load/store instructions, all operations perform on registers. Therefore increasing the efficiency of load/store instructions is very important for optimizing application.

Preload instruction allows the processor to signal the memory system that a data load from an address is likely in the near future. If the data is preloaded into cache correctly, it would be helpful to improve the rate of cache hit which can boost performance significantly. But the preload is not a panacea. It’s very hard to use on recent processors and it can be harmful too. A bad preload will reduce performance.
4 y2 X" v! P. F: i4 a6 F; d
+ |8 C% V- _9 E3 f* N) b; l) HPLD syntax:
% o( S# z7 y6 E

• PLD{cond} [Rn {, #offset}]
•     PLD{cond} [Rn, +/-Rm {, shift}]
•     PLD{cond} label
  

, @4 p9 N$ S8 a7 ?' O9 S' z( l
6 X3 g: F. g3 [- U' i4 L. O

Where:
- {* N" Y, Z5 w, E( N
) ^, \) K; n8 v3 g" t+ rCond - is an optional condition code.
Rn - is the register on which the memory address is based.
Offset - is an immediate offset. If offset is omitted, the address is the value in Rn.
Rm - contains an offset value and must not be PC (or SP, in Thumb state).
% e  a# @0 g# |1 h- oShift - is an optional shift.
Label - is a PC-relative expression.

: ?% n0 |& Q8 Q) u' ]+ G: bThe PLD operation features:
5 e/ j7 l$ v! A6 m& ?$ ]2 _5 k

• Independent of load and store instruction execution
• Happens in the background while the processor continues to execute other instructions.
• The offset is specified to real cases.
  

2.4 Misc

$ Q4 f) ], y  \9 bIn ARM NEON programming, Different instruction sequences can be used to perform the same operation. But fewer instructions do not always produce better performance. It depends on benchmark and profiling result of specific cases. Below listed are some special cases in development practice.
/ T$ |6 z6 Q( [9 b! R2 H
2.4.1 Floating-point VMLA/VMLS instruction

This example is specific for Cortex-A9. For other platforms, the result needs to be verified again.
1 X2 g- W# g- W; Y/ z6 u# ~
Usually, VMUL+VADD/VMUL+VSUB can be replaced by VMLA/VMLS because fewer instructions are used. But compared to floating-point VMUL, floating-point VMLA/VMLS has a longer instruction delay. If there aren’t other instructions that can be inserted into delay slot, using floating-point VMUL+VADD/VMUL+VSUB will show a better performance.
4 f5 _+ k' [! k
& O, S" `9 O" M/ e$ M! H$ aA real-world example is floating-point FIR function in Ne10. The code snippets are as follows:

Implementation 1: there is only one instruction “VEXT” between two “VMLA” which needs 9 execution cycles according to the table of NEON floating-point instructions timing.
# q% M+ p$ G1 v* c, J

• VEXT qTemp1,qInp,qTemp,#1
• VMLA qAcc0,qInp,dCoeff_0[0]
• VEXT qTemp2,qInp,qTemp,#2
• VMLA qAcc0,qTemp1,dCoeff_0[1]
• VEXT qTemp3,qInp,qTemp,#3
• VMLA qAcc0,qTemp2,dCoeff_1[0]
• VMLA qAcc0,qTemp3,dCoeff_1[1]
  

0 ^5 O3 X' j9 O2 s! S2 R

Implementation 2: there is still data dependency on qAcc0. But VADD/VMUL needs 5 execution cycles only.
. }. x) _$ U) \, d+ `

• VEXT qTemp1,qInp,qTemp,#1
• VMLA qAcc0,qInp,dCoeff_0[0] ]
• VMUL qAcc1,qTemp1,dCoeff_0[1]
• VEXT qTemp2,qInp,qTemp,#2
• VMUL qAcc2,qTemp2,dCoeff_1[0]
• VADD qAcc0, qAcc0, qAcc1
• VEXT qTemp3,qInp,qTemp,#3
• VMUL qAcc3,qTemp3,dCoeff_1[1]
• VADD qAcc0, qAcc0, qAcc2
• VADD qAcc0, qAcc0, qAcc3
  

5 P' l/ C0 Z; l' v$ R. `
% N0 d/ ?: w$ K- R' H/ u% h9 m
/ _$ [( A+ d* Y8 h: x. Q/ ]
6 _! \3 b2 \" W1 mThe benchmark shows that implementation 2 has a better performance.

  o; J- m2 |& k/ ~4 HFor more code details, see GitHub.

NEON floating-point instructions timing:

+ C& U  w. u: G: O, z

* C5 b  F- c8 I; h" ]/ n6 UThe table is from appendix[ii]。

* A7 o0 `6 s7 D' [& s. WWhere:

; A& y3 M& N2 H. r1 d5 f  \' M

• Cycles: instruction issue
• Result: instruction execute
  1 r+ A# V3 Q3 d+ W, e" k1 T' Z

, o% d5 ?) R; Y2 |* K
2.5 Summary
# L1 Q, J+ \4 D" ]& m
7 j3 p4 k/ C  O6 kNEON optimization techniques are summarized as follows:
6 W% R3 D: o! _) P# K

• Utilize the delay slot of instruction as much as possible.
• Avoid branches.
• Pay attention to cache hit.
  

% O1 n5 z, b9 B& L. i
3. NEON assembly and intrinsics

+ V% Q+ B0 t7 N& \1 ]In “ARM NEON programming quick guide”, there is a simple comparison of the pros and cons of NEON assembly and intrinsics:

. I& s4 k4 O3 K
" }9 W3 \8 i( f8 q& J; q: z
5 L! G5 ]$ q/ U+ L9 d6 Q  }. n! mBut the reality is far more complex than many of these, especially when it comes to ARMv7-A/v8-A cross-platform. In the following sections, this issue will be analyzed further with some examples.
& G* S2 i- F1 a# a
3.1 Programming
1 F' H( U" X& P+ M& X" q2 J( D
) y# K. c. P' V2 a3 P, E! UFor NEON beginners, intrinsics are easier to use than assembly. But experienced developers may be more familiar with NEON assembly programming. They need time to adapt to the intrinsics coding. Some issues that may occur in real development are described in the following.

3.1.1 Flexibility of instruction

& _5 n4 i( m8 L( V8 ^From the perspective of using instructions, assembly instruction is more flexible than intrinsics. It is mainly reflected in the data load / store.
# p7 H( h& K4 I1 S
Example:


( t5 D2 e( A7 z* m
; N7 D! U% w6 U  N$ Q$ n% tThis issue will be fixed with upgrading the compiler in the future. Sometimes, the compiler has been able to translate two intrinsics instructions into one assembly instruction, such as:
1 O( B9 k  B! L4 l7 f

compiler translating two intrinsics instructions into one assembly instruction

Therefore, it’s expected that intrinsics instruction will have the same flexibility with assembly instructions, with the upgrade of the ARMv8 toolchain.

3.1.2 Register allocation

7 w  |0 X( P1 m% YWhen programming in NEON assembly, registers have to be allocated by users. It must be known clearly which registers are occupied. One of benefits of programming in intrinsics is that users only need to define variables. The compiler will allocate registers automatically. This is an advantage, but it might be a weakness in some cases. Practice has proved that using too many NEON registers simultaneously in the intrinsics programming will bring gcc compiler register allocation issue. When this issue happens, many data are pushed into the stack, which will greatly affect performance of the program. Therefore, users should pay attention to this issue when intrinsics programming. When there is performance exception (such as the performance of C is better than it of NEON), you need to check the disassembly to see if there is register allocation issue firstly. For ARMv8-A AArch64, there are more registers (32 128-bit NEON registers). The impact of this issue is significantly reduced.

. c6 m8 y1 y, t3.2 Performance and compiler

On one platform, the performance of NEON assembly is only decided by implementation, and has nothing to do with the compiler. The benefit is that you can predict and control the performance of program when you hand-tune the codes, but there isn’t surprise.

Conversely, the performance of NEON intrinsics is greatly dependent on the compiler used. Different compilers may bring very different performance. In general, the older the compiler, the worse the performance. When compatibility with older compilers is needed, it must be considered carefully whether the intrinsics will fit the need. In addition, when fine-tuning the code, it’s hard for user to predict the change of performance with the intervention of the compiler. But there may be surprise. Sometimes the intrinsics might bring better performance than assembly. This is very rare, but does occur.
% u9 q" w4 n' ^3 w7 I  ?$ F
4 r( o( }, z2 u: t$ S1 [Compiler will have an impact on the process of NEON optimization. The following figure describes the general process of NEON implementation and optimization.

/ m; w, j+ J3 ^$ r2 o- w* |) W   process of NEON implementation and optimization.

) x/ n8 U' ?/ U( U0 k% S6 Y
3 J8 \& C- _" t  _$ @% VNEON assembly and intrinsics have the same process of implementation, coding - debugging – performance test. But they have different process of optimization step.The methods of assembly fine-tuning are:

• Change implementations, such as changing the instructions, adjusting the parallelism.
• Adjust the instruction sequence to reduce data dependency.
• Try the skills described in section 2.
  

When fine-tuning assembly, a sophisticated way is that:

• Know the number of used instructions exactly
• Get the execution cycles of program by using the PMU (Performance Monitoring Unit).
• Adjust the sequence of instructions based on the timing of used instructions. And try to minimize the instruction delay as possible as you can
  - @  a$ r- a# S' C  {; _

9 m/ J. ~5 e; pThe disadvantage of this approach is that the changes are specific to one micro-architecture. When the platform is switched, performance improvement achieved might be lost. This is also very time-consuming to do for often comparatively small gains.Fine-tuning of NEON intrinsics is more difficult.
' ^! J* i0 n9 @, y+ T
6 U% B& C4 T, R( j

• Try the methods used in NEON assembly optimization.
• Look at the generated assembly and check the data dependencies and register usage.
• Check whether the performance meets the expectation. If yes, the work of optimization is done. Then the performance with other compilers needs to be verified again.
  

# F, w/ B. ~2 M3 VWhen porting the assembly code of ARMv7-A with intrinsics for ARMv7-A/v8-A compatibility, performance of assembly can be used as a reference of performance. So it is easy to check whether the work is done.  However, when intrinsics are used to optimize ARMv8-A code, there is not a performance reference. It is difficult to determine whether the performance is optimal. Based on the experience on ARMv7-A, there might be a doubt whether the assembly has the better performance. I think the impact of this issue will become smaller and smaller with the maturity of the ARMv8-A environment.
, Z$ a0 i1 M  K% f* z: ~
3 \$ X* K+ m5 t3.3 Cross-platform and portability
% B2 P# G' o( W  N/ x2 C
Now, most of the existing NEON assembly codes can only run on the platforms of ARMv7-A/ARMv8-A AArch32 mode. If you want to run them on platforms of ARMv8-A AArch64 mode, you must rewrite these codes, which take a lot of work. In such situation, if the codes are programmed with NEON intrinsics, they can be run directly on platforms of ARMv8-A AArch64 mode. Cross-platform is one of great advantages. Meanwhile, you just need to maintain on set of code for different platform by using intrinsics, which also significantly reduces the maintenance effort. However, due to the different hardware resources on ARMv7-A/ARMv8-A platform, sometimes there still might be two sets of code even with intrinsics. The FFT implementation in Ne10 project is an example:

& {& G3 s8 r3 S  k5 g3 @

• // radix 4 butterfly with twiddlesscratch[0].r = scratch_in[0].r;scratch[0].i = scratch_in[0].i;scratch[1].r = scratch_in[1].r * scratch_tw[0].r - scratch_in[1].i * scratch_tw[0].i;scratch[1].i = scratch_in[1].i * scratch_tw[0].r + scratch_in[1].r * scratch_tw[0].i;scratch[2].r = scratch_in[2].r * scratch_tw[1].r - scratch_in[2].i * scratch_tw[1].i;scratch[2].i = scratch_in[2].i * scratch_tw[1].r + scratch_in[2].r * scratch_tw[1].i;scratch[3].r = scratch_in[3].r * scratch_tw[2].r - scratch_in[3].i * scratch_tw[2].i;scratch[3].i = scratch_in[3].i * scratch_tw[2].r + scratch_in[3].r * scratch_tw[2].i;
  

; b2 c$ c4 ~! r- Q! a' o
8 K( U7 [1 l* K4 N* p
' b- K. J9 q0 VThe above code snippet lists the basic element of FFT---- radix4 butterfly. From the code, the following can be concluded:

• 20 64-bit NEON registers are needed if 2 radix4 butterflies are executed in one loop.
• 20 128-bit NEON registers are needed if 4 radix4 butterflies are executed in one loop.
  7 [0 _! J6 @% k' l

" `( j" ]) j% p6 `0 l7 _7 qAnd, for ARMv7-A/v8-A AArch32 and v8-A AArch64,

! S  J: u8 Z8 z. s

• There are 32 64-bit or 16 128-bit NEON registers for ARMv7-A/v8-A AArch32.
• There are 32 128-bit NEON registers for ARMv8-A AArch64.
  , z: a* c! T7 j3 k# i/ h. l

Considering the above factors, the FFT implementation of Ne10 eventually has an assembly version, in which 2 radix4 butterflies are executed in one loop, for ARMv7-A/v8-A AAch32, and an intrinsic version, in which 4 radix4 butterflies are executed in one loop, for ARMv8-A AArch64.The above example can illustrate that you need to pay attention to some exceptions when maintaining one set of code across ARMv7-A/v8-A platform,

8 v1 o( u$ Q1 n6 b+ |3.4 Future

/ T% a$ f2 l5 P" z3 mMany issues about using NEON assembly and intrinsics have been discussed. But these issues are temporary. In the long term, intrinsics will be better. By using intrinsics, you can reap the benefits of hardware and compiler upgrade without reprogramming. That means some classical algorithms just need to be implemented once.

5 j, j( b% B' u8 b6 mThe compiler will help to adjust these codes for new hardware, which reduces the workload significantly. Pffft is an example.The following figure describes the performance of pffft and Ne10 real FFT on the ARM Cortex-A9 platform with gcc. X-axis represents the length of FFT. Y-axis represents the time of execution, the smaller the better. Pffft is implemented with NEON intrinsics. Ne10 real FFT is implemented with NEON assembly. They don’t use the same algorithm, but they have similar performance.  

3 @, a2 s, ?; X3 ~7 A  V

' q9 ^) \# H" h" o- [" p: `In the ARMv8-A AArch64 mode, the Ne10 real FFT is rewritten with both NEON assembly and intrinsics. Section 3.3 has explained that ARMv8-A can process 4 butterflies in parallel, but ARMv7-A can only process 2 butterflies in parallel. So theoretically, the effect of FFT optimization on ARMv8-A would be better than that on ARMv7-A. However, based on the following figure, it’s clear that pffft has the best performance. The result illustrates that the compiler should have done very good optimizations specified for ARMv8 architecture.



4 Z/ x3 Q7 I% M3 LFrom this example, it is concluded that: pffft, the performance of which isn’t the best on the ARMv7-A, shows a very good performance in the ARMv8-A AArch64 mode. That proves the point: compiler can adjust intrinsics automatically for ARMv8-A to achieve a good performance.In the long run, existing NEON assembly code have to be rewritten for ARMv8. If NEON is upgraded in the future, the code has to be rewritten again and again. But for NEON intrinsics code, it is expected that it may show good performance on ARMv8-A with the help of compilers. Even if NEON is upgraded, you can also look forward to the upgrade of compilers.

3.5 Summary

! _+ }3 y7 @: SIn this section, the pros and cons of NEON assembly and intrinsics have been analyzed with some examples. The benefits of intrinsics far outweigh drawbacks. Compared to assembly, Intrinsics are more easily programmed, and have better compatibility between ARMv7 and ARMv8.Some tips for NEON intrinsics are summarized as follows:
' X: y/ a4 x4 B' j/ f- n% o" e

• The number of registers used
• Compiler
• Do look at the generated assembly
  3 P7 {7 ^3 l0 n/ F

4. End
; p" S& X- V- g. w5 T7 @
This blog mainly discusses some common NEON optimization skills and analyzes the pros and cons of NEON assembly and intrinsics with some examples. Hope that these can help NEON developers in actual developmen

xiaogegepcb

ARM NEON optimization

youOK

ARM NEON optimization

Hello_Mr.li

ARM NEON optimization