OpenCores
URL https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk

Subversion Repositories openrisc_2011-10-31

[/] [openrisc/] [tags/] [gnu-src/] [gcc-4.5.1/] [gcc-4.5.1-or32-1.0rc2/] [gcc/] [testsuite/] [gcc.dg/] [tree-ssa/] [ldist-9.c] - Diff between revs 298 and 384

Only display areas with differences | Details | Blame | View Log

Rev 298 Rev 384
/* { dg-do compile } */
/* { dg-do compile } */
/* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
/* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
 
 
int loop1 (int k)
int loop1 (int k)
{
{
  unsigned int i;
  unsigned int i;
  int a[1000], b[1000];
  int a[1000], b[1000];
 
 
  for (i = 1; i < (1000-1); i ++) {
  for (i = 1; i < (1000-1); i ++) {
    a[i] = a[i+1] + a[i-1]; /* S1 */
    a[i] = a[i+1] + a[i-1]; /* S1 */
    b[i] = a[i-1] + k; /* S2 */
    b[i] = a[i-1] + k; /* S2 */
  }
  }
  /*
  /*
    Dependences:
    Dependences:
    S1->S2 (flow, level 1)
    S1->S2 (flow, level 1)
    S1->S1 (anti, level 1)
    S1->S1 (anti, level 1)
    S1->S1 (flow, level 1)
    S1->S1 (flow, level 1)
 
 
    One partition, because of the cost of cache misses.
    One partition, because of the cost of cache misses.
  */
  */
 
 
  return a[1000-2] + b[1000-1];
  return a[1000-2] + b[1000-1];
}
}
 
 
/* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" } } */
/* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" } } */
/* { dg-final { cleanup-tree-dump "ldist" } } */
/* { dg-final { cleanup-tree-dump "ldist" } } */
 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.