Lines Matching refs:BarrierChain
696 assert(BarrierChain != nullptr); in addBarrierChain()
701 SU->addPredBarrier(BarrierChain); in addBarrierChain()
707 assert(BarrierChain != nullptr); in insertBarrierChain()
716 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
719 (*SUItr)->addPredBarrier(BarrierChain); in insertBarrierChain()
723 if (SUItr != SUEE && *SUItr == BarrierChain) in insertBarrierChain()
749 BarrierChain = nullptr; in buildSchedGraph()
905 if (BarrierChain) in buildSchedGraph()
906 BarrierChain->addPredBarrier(SU); in buildSchedGraph()
907 BarrierChain = SU; in buildSchedGraph()
910 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
925 if (BarrierChain) in buildSchedGraph()
926 BarrierChain->addPredBarrier(SU); in buildSchedGraph()
943 if (BarrierChain) in buildSchedGraph()
944 BarrierChain->addPredBarrier(SU); in buildSchedGraph()
1083 if (BarrierChain) { in reduceHugeMemNodeMaps()
1088 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1089 BarrierChain->addPredBarrier(newBarrierChain); in reduceHugeMemNodeMaps()
1090 BarrierChain = newBarrierChain; in reduceHugeMemNodeMaps()
1092 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1096 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1099 BarrierChain = newBarrierChain; in reduceHugeMemNodeMaps()