677   assert(BarrierChain != nullptr);  in addBarrierChain()
682       SU->addPredBarrier(BarrierChain);  in addBarrierChain()
688   assert(BarrierChain != nullptr);  in insertBarrierChain()
697       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
700       (*SUItr)->addPredBarrier(BarrierChain);  in insertBarrierChain()
704     if (SUItr != SUEE && *SUItr == BarrierChain)  in insertBarrierChain()
730   BarrierChain = nullptr;  in buildSchedGraph()
886       if (BarrierChain)  in buildSchedGraph()
887         BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
888       BarrierChain = SU;  in buildSchedGraph()
891                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
906       if (BarrierChain)  in buildSchedGraph()
907         BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
924     if (BarrierChain)  in buildSchedGraph()
925       BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
1061   if (BarrierChain) {  in reduceHugeMemNodeMaps()
1066     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1067       BarrierChain->addPredBarrier(newBarrierChain);  in reduceHugeMemNodeMaps()
1068       BarrierChain = newBarrierChain;  in reduceHugeMemNodeMaps()
1070                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1074                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1077     BarrierChain = newBarrierChain;  in reduceHugeMemNodeMaps()