xref: /llvm-project/polly/lib/External/isl/test_inputs/schedule/nana.sc (revision a749e09e184b2b0b6dde71af01c82dd427b3e3e2)
1# Check the decomposition of the topological sort.
2# This decomposition is only performed by the incremental scheduler.
3# OPTIONS: --no-schedule-whole-component
4#
5# This test case was contributed by Nana CK <1429802329@qq.com>.
6domain: { sync[0:64, 0:32]; stB[0:64, 0:64]; stC[0:64, 0:64] }
7validity: { stC[j = 0:64, 0:64] -> sync[j, 0]; stB[j = 0:64, 0:64] -> sync[j, 0] }
8proximity: { stC[j = 0:64, 0:64] -> sync[j, 0]; stB[j = 0:64, 0:64] -> sync[j, 0] }
9coincidence: { stC[j = 0:64, 0:64] -> sync[j, 0]; stB[j = 0:64, 0:64] -> sync[j, 0] }
10