Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/tree-ssa/ldist-2.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children |
line wrap: on
line source
/* { dg-do compile } */ /* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */ void foo (int * __restrict__ a, int * __restrict__ b, int * __restrict__ c) { int i; for (i=1; i < 10; i++) { a[i] += c[i]; b[i] = a[i - 1] + 1; } /* This loop is not distributed because the cost of spliting it: | for (i=1; i < N; i++) | a[i] += c[i]; | | for (i=1; i < N; i++) | b[i] = a[i - 1] + 1; is higher due to data in array A that is written and then read in another task. The cost model should forbid the transformation in this case. */ } /* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" } } */