search for: vmvn

...as checks. test.c:11: note: === vect_do_peeling_for_loop_bound ===Setting upper bound of nb iterations for epilogue loop to 14 test.c:11: note: LOOP VECTORIZED. The result is a very concise and very dense code: vld1.8 {d28[], d29[]}, [r5] vld3.8 {d16, d18, d20}, [r9]! vld3.8 {d17, d19, d21}, [r9] vmvn q3, q8 vmvn q15, q9 vmvn q8, q10 vsub.i8 q11, q3, q14 vsub.i8 q12, q15, q14 vsub.i8 q13, q8, q14 vst3.8 {d22, d24, d26}, [r8]! vst3.8 {d23, d25, d27}, [r8] cheers, --renato -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-d...

Renato, can you post the c code for the function and the assembly that gcc produces? Your initial example could be well handled by vectorization of strided loops (and the mentioning of VLD3(.8?)/VST3(.8?) lead me to assume that this is what happened). But the LLVM-IR you sent has a store of 0 in there ;) and strides by 4. Thanks, Arnold Vectorization of strided loops: I am using float as the

This is almost ideal for SLP vectorization, except for two problems: 1. We have 4 stores to consecutive locations, but the last element is the constant zero, and not an additional SUB. At the moment we don’t have support for idempotence operations, but this is something that we should add. 2. The values that we are subtracting come from 3 loads. We usually load 4 elements from memory, or

...2.11][21425199] command: yi76 IDLE 16:08:10 [192.168.202.11][21425199] command: 7doe IDLE 16:08:10 [192.168.202.11][21425199] command: 1xzf IDLE 16:08:10 [192.168.202.11][21425199] command: y78i IDLE 16:08:10 [192.168.202.11][21425199] command: 7g2f IDLE 16:08:10 [192.168.202.11][21425199] command: vmvn IDLE 16:08:10 [192.168.202.11][21425199] command: m9z5 IDLE 16:08:10 [192.168.202.11][21425199] command: cq7q IDLE 16:08:11 [192.168.202.11][21425199] command: 3c54 IDLE 16:08:11 [192.168.202.11][21425199] command: otih IDLE 16:08:11 [192.168.202.11][21425199] command: uuhy IDLE 16:08:11 [192.168.2...