File: bilinear.st

package info (click to toggle)
isl 0.25-1.1
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 19,076 kB
  • sloc: ansic: 223,485; python: 17,715; cpp: 6,637; sh: 4,475; makefile: 713; lisp: 148; perl: 9
file content (9 lines) | stat: -rw-r--r-- 434 bytes parent folder | download | duplicates (26) 
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] }"