File: bilinear.st

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-- 434 bytes parent folder | download | duplicates (28) 
1
2
3
4
5
6
7
8
9
 
# Check that the generated code does not contain a loop upper bound
# that depends on the loop iterator.
domain: "[d, w] -> { A[i0] : i0 >= 0 and ((d < 0 and 2*floor((1 + d)/2) < w - i0) or (d >= 0 and 2*floor((d)/2) < w - i0)); B[i0] : i0 >= 0 and d < 0 and 2*floor((d)/2) > 2d - w + i0 }"
child:
  schedule: "[d, w] -> [{ A[i0] -> [(i0)]; B[i0] -> [(i0)] }]"
  child:
    sequence:
    - filter: "{ A[x] }"
    - filter: "{ B[x] }"