[llvm-dev] GVN pass: does global value numbering remove duplicate computations in loops?

Amos Robinson via llvm-dev llvm-dev at lists.llvm.org
Tue May 3 17:25:59 PDT 2016

I was hoping to get some clarification on the aim of the GVN pass. I have
been reading a bit about global value numbering, and from what I
understand, there are polynomial time algorithms for removing duplicate
computations from loops[1].

I have an example program[2] which computes the sum of an array twice, in
two separate accumulators.
Here, sum0 and sum1 are both sums of the array A.

void b01_sums(int size, int* A)
  int sum0 = 0;
  int sum1 = 0;
  for (int i = 0; i != size; ++i)
    sum0 = sum0 + A[i];
    sum1 = sum1 + A[i];
    printf("sum0: %d\nsum1: %d\n", sum0, sum1);

I would have expected global value numbering to see that sum0 and sum1 are
initialised and updated with the same value, and so merge them into a
single accumulator. However, the assembly output still contains both

$ gcc sums.c -c -O3 -save-temps
. . .
# A[i] (only once)
movl (%r15), %eax
# add sum0 and sum1
addl %eax, %ebx
addl %eax, %r13d

I have tried a few variations on the C code: pulling out the array reads
into a single binding makes no difference, while moving the printf outside
of the loop allows the loop to be vectorised, but there are still two
I am wondering whether I am missing some particular invocation (perhaps to
enable fixpoints over loops in the GVN analysis?), or otherwise, if there
is some reason that means this sort of analysis is impractical for real

I am using the Apple clang 6, but also tried with llvm opt 3.6:

$ gcc --version
Configured with: --prefix=/Library/Developer/CommandLineTools/usr
Apple LLVM version 6.0 (clang-600.0.57) (based on LLVM 3.5svn)
Target: x86_64-apple-darwin13.4.0
Thread model: posix
$ /usr/local/opt/llvm/bin/opt --version
LLVM (http://llvm.org/):
  LLVM version 3.6.2
  Optimized build.
  Built Apr 10 2016 (02:50:09).
  Default target: x86_64-apple-darwin13.4.0
  Host CPU: core-avx2

Amos Robinson

[1]: Gulwani & Necula: A Polynomial-Time Algorithm for Global Value
Numbering http://www.eecs.berkeley.edu/~necula/Papers/gvndet-journal06.pdf

[2]: Example code and assembly output
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160504/0a0a8e24/attachment.html>

More information about the llvm-dev mailing list