Re:Bubble sort slower with -O3 than -O2 with GCC
by sroussey on Sunday October 17, 2021 @07:15PM
(#28900606)
Code size always matters. The code cache in the cpu is far from infinite and long jumps will stall. Sometimes vectorization can shrink code, so yay. And, like you said, if performance increases, then yay again regardless of size.
Re:Bubble sort slower with -O3 than -O2 with GCC
by ncmncm on Sunday October 17, 2021 @08:29PM
(#28900983)
Code size always matters, except for all the times when it doesn't. Or when something else matters more.
Code size matters less than it once did, now that we have bigger and smarter caches. But bigger, while sometimes big enough, is never big.
Arguments around code size have been largely irrelevant for quite some time, so long as performance increases.
If I put on a tinfoil hat, I'd suspect Intel was at least an influence. They're the ones adding AVX, AVX2, 512 and providing their own compiler to take advantage of them, while crippling AMD parts. That is until they switched to LLVM.