brintos

brintos / llvm-project-archived public Read only

0
0
Text · 432 B · c37ad5b Raw
8 lines · plain
1# Check that nodes are fused when not maximizing coincidence.2# This option is only effective for the incremental scheduler.3# OPTIONS: --no-schedule-whole-component --no-schedule-maximize-coincidence4domain: [n] -> { A[i,j,k] : 0 <= i,j,k < n; B[i,j,k] : 0 <= i,j,k < n }5validity: { A[i,j,k] -> B[i,k,j] }6proximity: { A[i,j,k] -> A[i,j,k+1]; A[i,j,k] -> B[i,k,j] }7coincidence: { A[i,j,k] -> A[i,j,k+1]; B[i,j,k] -> B[i,j,k+1] }8