687   assert(BarrierChain != nullptr);  in addBarrierChain()
692       SU->addPredBarrier(BarrierChain);  in addBarrierChain()
698   assert(BarrierChain != nullptr);  in insertBarrierChain()
707       if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)  in insertBarrierChain()
710       (*SUItr)->addPredBarrier(BarrierChain);  in insertBarrierChain()
714     if (SUItr != SUEE && *SUItr == BarrierChain)  in insertBarrierChain()
740   BarrierChain = nullptr;  in buildSchedGraph()
896       if (BarrierChain)  in buildSchedGraph()
897         BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
898       BarrierChain = SU;  in buildSchedGraph()
901                         << BarrierChain->NodeNum << ").\n";);  in buildSchedGraph()
916       if (BarrierChain)  in buildSchedGraph()
917         BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
934     if (BarrierChain)  in buildSchedGraph()
935       BarrierChain->addPredBarrier(SU);  in buildSchedGraph()
1071   if (BarrierChain) {  in reduceHugeMemNodeMaps()
1076     if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {  in reduceHugeMemNodeMaps()
1077       BarrierChain->addPredBarrier(newBarrierChain);  in reduceHugeMemNodeMaps()
1078       BarrierChain = newBarrierChain;  in reduceHugeMemNodeMaps()
1080                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1084                         << BarrierChain->NodeNum << ").\n";);  in reduceHugeMemNodeMaps()
1087     BarrierChain = newBarrierChain;  in reduceHugeMemNodeMaps()