File: sor1d-part.st

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (10 lines) | stat: -rw-r--r-- 545 bytes parent folder | download | duplicates (37) 
1
2
3
4
5
6
7
8
9
10
 
# Check that a proper upper bound is generated for the outer loop.
# Earlier versions of isl would generate an incorrect bound.
domain: "[M, N] -> { S2[i0, i1] : i1 >= 0 and  200i1 >= -193 - N + 100i0 and i0 >= 0 and 200i1 <= -204 + 2M + N and 2i1 <= -1 + i0 and 100i1 >= -94 - N + 50i0 and 100i1 >= -94 - N }"
child:
  context: "[M, N] -> { [] : M >= 0 and N >= 4 }"
  child:
    schedule: "[M, N] -> [{ S2[i0, i1] -> [(i0 + i1)]}]"
    options: "[M, N] -> { separate[i0] }"
    child:
          schedule: "[M, N] -> [{ S2[i0, i1] -> [(i1)]}]"