<html>
    <head>
      <base href="https://llvm.org/bugs/" />
    </head>
    <body><table border="1" cellspacing="0" cellpadding="8">
        <tr>
          <th>Bug ID</th>
          <td><a class="bz_bug_link 
          bz_status_NEW "
   title="NEW --- - LLVM generates SIMD instructions on copying a large object which is slow."
   href="https://llvm.org/bugs/show_bug.cgi?id=27630">27630</a>
          </td>
        </tr>

        <tr>
          <th>Summary</th>
          <td>LLVM generates SIMD instructions on copying a large object which is slow.
          </td>
        </tr>

        <tr>
          <th>Product</th>
          <td>new-bugs
          </td>
        </tr>

        <tr>
          <th>Version</th>
          <td>trunk
          </td>
        </tr>

        <tr>
          <th>Hardware</th>
          <td>PC
          </td>
        </tr>

        <tr>
          <th>OS</th>
          <td>Linux
          </td>
        </tr>

        <tr>
          <th>Status</th>
          <td>NEW
          </td>
        </tr>

        <tr>
          <th>Severity</th>
          <td>normal
          </td>
        </tr>

        <tr>
          <th>Priority</th>
          <td>P
          </td>
        </tr>

        <tr>
          <th>Component</th>
          <td>new bugs
          </td>
        </tr>

        <tr>
          <th>Assignee</th>
          <td>unassignedbugs@nondot.org
          </td>
        </tr>

        <tr>
          <th>Reporter</th>
          <td>congh@google.com
          </td>
        </tr>

        <tr>
          <th>CC</th>
          <td>llvm-bugs@lists.llvm.org
          </td>
        </tr>

        <tr>
          <th>Classification</th>
          <td>Unclassified
          </td>
        </tr></table>
      <p>
        <div>
        <pre>LLVM generates SSE instructions (on x86 each movaps copies 16 bytes) on copying
a large object for the following code, which underperforms GCC's generated code
in which each mov instruction copies 8 bytes:

struct A {
  int a[16];
};

constexpr int N = 10000;
A a[N], b[N];
int main() {
  for (int j = 0; j < 1000; ++j) {
    for (int i = 0; i < N; ++i) {
      a[i] = b[i];
    }
  }
}

Running time (on a Haswell machine):

LLVM: 0.071s
GCC:  0.039s

The performance becomes worse if we don't unroll the loop.</pre>
        </div>
      </p>
      <hr>
      <span>You are receiving this mail because:</span>
      
      <ul>
          <li>You are on the CC list for the bug.</li>
      </ul>
    </body>
</html>