<html>
    <head>
      <base href="http://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 --- - [Vectorizer] Implement stride access"
   href="http://llvm.org/bugs/show_bug.cgi?id=17677">17677</a>
          </td>
        </tr>

        <tr>
          <th>Summary</th>
          <td>[Vectorizer] Implement stride access
          </td>
        </tr>

        <tr>
          <th>Product</th>
          <td>libraries
          </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>Loop Optimizer
          </td>
        </tr>

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

        <tr>
          <th>Reporter</th>
          <td>renato.golin@linaro.org
          </td>
        </tr>

        <tr>
          <th>CC</th>
          <td>llvmbugs@cs.uiuc.edu
          </td>
        </tr>

        <tr>
          <th>Classification</th>
          <td>Unclassified
          </td>
        </tr></table>
      <p>
        <div>
        <pre>Implement stride access detection for induction variables with Step > 1, with
cost-model support for the (currently unclear) benefits, and make sure that the
vectorization happens later on.

The basic loop in which this should work is:

for (i..N/3) {
  a[3*i] = b[3*i];
  a[3*i+1] = b[3*i+1];
  a[3*i+2] = b[3*i+2];
}

With S = sizeof(a[0]);

Since the loop stride is { 3 * S } and the evolutions are:

{a, +, 3S}
{a+S, +, 3S}
{a+2S, +, 3S}

The reads/writes don't overlap, and they're sequential, so we can vectorize.</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>