brintos

brintos / llvm-project-archived public Read only

0
0
Text · 326 B · 5d16458 Raw
8 lines · plain
1# Check the decomposition of the topological sort.2# This decomposition is only performed by the incremental scheduler.3# OPTIONS: --no-schedule-whole-component4domain: { A[]; B[]; C[]; D[]; E[]; F[]; G[] }5validity:6    { A[] -> C[]; B[] -> C[]; C[] -> E[]; D[] -> E[]; E[] -> F[]; E[] -> G[];7      A[] -> G[]; B[] -> E[] }8