1  #include <stdarg.h>
       2  #include "tree-vect.h"
       3  
       4  #define N 128
       5  
       6  int ib[N+7];
       7  int ia[N+1];
       8  
       9  __attribute__ ((noinline))
      10  int main1 ()
      11  {
      12    int i;
      13  
      14    /* Don't peel keeping one load and the store aligned.  */
      15    for (i = 0; i <= N; i++)
      16      {
      17        ia[i] = ib[i] + ib[i+5];
      18      }
      19  
      20    /* check results:  */
      21    for (i = 1; i <= N; i++)
      22      {
      23        if (ia[i] != ib[i] + ib[i+5])
      24          abort ();
      25      }
      26  
      27    return 0;
      28  }
      29  
      30  int main (void)
      31  { 
      32    int i;
      33  
      34    check_vect ();
      35  
      36    for (i = 0; i <= N+6; i++)
      37      {
      38        asm volatile ("" : "+r" (i));
      39        ib[i] = i;
      40      }
      41  
      42    return main1 ();
      43  }
      44  
      45