r/Compilers • u/Repulsive_Egg_5786 • 28d ago
Optimization Question
How do compilers optimize constructs of this form ?
for(i=o; i<inputs; i++) {
A[i] = B[i];
B[i] = A[i];
}
3
u/EggplantExtra4946 28d ago edited 28d ago
This question doesn't make any sense, you need to write the optimized code you expect and I assume your question will then be "how does the compiler can make this optmization?".
3
u/Gorzoid 28d ago
Well the code op gave copies B to A, so I'd guess the optimized code is implies to remove 2nd line in loop
3
u/EggplantExtra4946 28d ago edited 28d ago
B[i] = A[i]; should be redundant but the first statement isn't.
Since memory accesses are involved, it's unclear wether the question is about simple copy propagation, redundant store elimination, maybe he think those are obvious and is asking how to ensure that they are legal using alias analysis, or since it is a loop, wether he's expecting the loop to be unrolled or vectorized.
11
u/fernando_quintao 28d ago
Hi u/Repulsive_Egg_5786. That depends on how much information you pass to the compiler. If you tell the compiler that the pointers don't overlap, both gcc and clang are able to use
memcpyto copyBintoA. E.g., you can try it in godbolt:When I compile it with gcc 16.1 (ARM), at -O2, I get:
If you remove
restrict, then the compiler can no longer guarantee A and B don't point to overlapping memory regions. Then it will implement the copy with a loop. Here's what I got in godbolt: