1# This is a generalized version of leyin1.sc, 2# with an extra dependence that simplifies away when N = 32. 3# However, since N is known to be non-negative, this should still 4# produce a similar schedule (with a single band). 5# The exact form of the schedule depends on whether the whole-component or 6# the incremental scheduler is used. 7# This is the incremental scheduler version. 8# OPTIONS: --no-schedule-whole-component 9domain: [N] -> { A[]; B[0:N-1]; C[] } 10context: [N] -> { : N >= 0 } 11validity: [N] -> { A[] -> C[] : N <= 0; 12 A[] -> B[0] : N >= 1; B[N-1] -> C[] : N >= 1 } 13proximity: [N] -> { A[] -> C[] : N <= 0; 14 A[] -> B[0] : N >= 1; B[N-1] -> C[] : N >= 1 } 15