694   assert(BarrierChain != nullptr);  in addBarrierChain()
699       SU->addPredBarrier(BarrierChain);  in addBarrierChain()
705   assert(BarrierChain != nullptr);  in insertBarrierChain()
714       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
717       (*SUItr)->addPredBarrier(BarrierChain);  in insertBarrierChain()
721     if (SUItr != SUEE && *SUItr == BarrierChain)  in insertBarrierChain()
747   BarrierChain = nullptr;  in buildSchedGraph()
903       if (BarrierChain)  in buildSchedGraph()
904         BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
905       BarrierChain = SU;  in buildSchedGraph()
908                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
923       if (BarrierChain)  in buildSchedGraph()
924         BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
941     if (BarrierChain)  in buildSchedGraph()
942       BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
1081   if (BarrierChain) {  in reduceHugeMemNodeMaps()
1086     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1087       BarrierChain->addPredBarrier(newBarrierChain);  in reduceHugeMemNodeMaps()
1088       BarrierChain = newBarrierChain;  in reduceHugeMemNodeMaps()
1090                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1094                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1097     BarrierChain = newBarrierChain;  in reduceHugeMemNodeMaps()