bilinear.st revision 1.1
1 1.1 mrg # Check that the generated code does not contain a loop upper bound 2 1.1 mrg # that depends on the loop iterator. 3 1.1 mrg 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 }" 4 1.1 mrg child: 5 1.1 mrg schedule: "[d, w] -> [{ A[i0] -> [(i0)]; B[i0] -> [(i0)] }]" 6 1.1 mrg child: 7 1.1 mrg sequence: 8 1.1 mrg - filter: "{ A[x] }" 9 1.1 mrg - filter: "{ B[x] }" 10
Indexes created Mon Mar 02 05:31:46 UTC 2026