| ▲ | maccard 8 hours ago | ||||||||||||||||
To back up the other commenter - it's not the same. https://godbolt.org/z/r6e443x1c shows that if you write imperfect C++ clang is perfectly capable of optimizing it. | |||||||||||||||||
| ▲ | cogman10 7 hours ago | parent | next [-] | ||||||||||||||||
What's strange is I'm finding that gcc really struggles to correctly optimize this. This was my function
clang emits basically the same thing yours does. But gcc ends up just really struggling to vectorize for large numbers of array.Here's gcc for 42 elements: https://godbolt.org/z/sjz7xd8Gs and here's clang for 42 elements: https://godbolt.org/z/frvbhrnEK Very bizarre. Clang pretty readily sees that it can use SIMD instructions and really optimizes this while GCC really struggles to want to use it. I've even seen strange output where GCC will emit SIMD instructions for the first loop and then falls back on regular x86 compares for the rest. Edit: Actually, it looks like for large enough array sizes, it flips. At 256 elements, gcc ends up emitting simd instructions while clang does pure x86. So strange. | |||||||||||||||||
| |||||||||||||||||
| ▲ | btdmaster 5 hours ago | parent | prev [-] | ||||||||||||||||
I see yeah that makes sense. I wanted to highlight that "magic" will, on average, give the optimizer a harder time. Explicit offset loops like that are generally avoided in many C++ styles in favor of iterators. | |||||||||||||||||
| |||||||||||||||||