File: nana.sc

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (9 lines) | stat: -rw-r--r-- 544 bytes parent folder | download | duplicates (15) 
1
2
3
4
5
6
7
8
9
 
# Check the decomposition of the topological sort.
# This decomposition is only performed by the incremental scheduler.
# OPTIONS: --no-schedule-whole-component
#
# This test case was contributed by Nana CK <1429802329@qq.com>.
domain: { sync[0:64, 0:32]; stB[0:64, 0:64]; stC[0:64, 0:64] }
validity: { stC[j = 0:64, 0:64] -> sync[j, 0]; stB[j = 0:64, 0:64] -> sync[j, 0] }
proximity: { stC[j = 0:64, 0:64] -> sync[j, 0]; stB[j = 0:64, 0:64] -> sync[j, 0] }
coincidence: { stC[j = 0:64, 0:64] -> sync[j, 0]; stB[j = 0:64, 0:64] -> sync[j, 0] }