File: sor1d-part.st

package info (click to toggle)
llvm-toolchain-18 1%3A18.1.8-18
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,908,340 kB
  • sloc: cpp: 6,667,937; ansic: 1,440,452; asm: 883,619; python: 230,549; objc: 76,880; f90: 74,238; lisp: 35,989; pascal: 16,571; sh: 10,229; perl: 7,459; ml: 5,047; awk: 3,523; makefile: 2,987; javascript: 2,149; xml: 892; fortran: 649; cs: 573
file content (10 lines) | stat: -rw-r--r-- 545 bytes parent folder | download | duplicates (42) 
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)]}]"