Lines Matching refs:To
28 const auto *To = Update.getTo(); in isUpdateValid() local
35 const bool HasEdge = llvm::is_contained(successors(From), To); in isUpdateValid()
317 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) { in insertEdge() argument
320 assert(isUpdateValid({DominatorTree::Insert, From, To}) && in insertEdge()
328 if (From == To) in insertEdge()
333 DT->insertEdge(From, To); in insertEdge()
335 PDT->insertEdge(From, To); in insertEdge()
339 PendUpdates.push_back({DominatorTree::Insert, From, To}); in insertEdge()
342 void DomTreeUpdater::insertEdgeRelaxed(BasicBlock *From, BasicBlock *To) { in insertEdgeRelaxed() argument
343 if (From == To) in insertEdgeRelaxed()
349 if (!isUpdateValid({DominatorTree::Insert, From, To})) in insertEdgeRelaxed()
354 DT->insertEdge(From, To); in insertEdgeRelaxed()
356 PDT->insertEdge(From, To); in insertEdgeRelaxed()
360 PendUpdates.push_back({DominatorTree::Insert, From, To}); in insertEdgeRelaxed()
363 void DomTreeUpdater::deleteEdge(BasicBlock *From, BasicBlock *To) { in deleteEdge() argument
366 assert(isUpdateValid({DominatorTree::Delete, From, To}) && in deleteEdge()
374 if (From == To) in deleteEdge()
379 DT->deleteEdge(From, To); in deleteEdge()
381 PDT->deleteEdge(From, To); in deleteEdge()
385 PendUpdates.push_back({DominatorTree::Delete, From, To}); in deleteEdge()
388 void DomTreeUpdater::deleteEdgeRelaxed(BasicBlock *From, BasicBlock *To) { in deleteEdgeRelaxed() argument
389 if (From == To) in deleteEdgeRelaxed()
395 if (!isUpdateValid({DominatorTree::Delete, From, To})) in deleteEdgeRelaxed()
400 DT->deleteEdge(From, To); in deleteEdgeRelaxed()
402 PDT->deleteEdge(From, To); in deleteEdgeRelaxed()
406 PendUpdates.push_back({DominatorTree::Delete, From, To}); in deleteEdgeRelaxed()
476 BasicBlock *To = U.getTo(); in dump() local
477 if (To) { in dump()
478 auto S = To->getName(); in dump()
479 if (!To->hasName()) in dump()
481 OS << S << "(" << To << ")\n"; in dump()