@@ From Tuleap issue 857, submitted by jchauzi There are some possible (simple) optimizations. For example, (1 << n) - 1 = lslx -1 n (we gain one instruction, yeepee)
Activity
dpu: llvm: Optimization of memory access to Register + GlobalAddress
dpu: llvm: Optimization of memory access to Register + GlobalAddress
dpu: llvm: Optimization of memory access to Register + GlobalAddress
dpu: llvm: Optimization of memory access to Register + GlobalAddress