• Home
  • Raw
  • Download

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()
316 void DomTreeUpdater::insertEdge(BasicBlock *From, BasicBlock *To) { in insertEdge() argument
319 assert(isUpdateValid({DominatorTree::Insert, From, To}) && in insertEdge()
327 if (From == To) in insertEdge()
332 DT->insertEdge(From, To); in insertEdge()
334 PDT->insertEdge(From, To); in insertEdge()
338 PendUpdates.push_back({DominatorTree::Insert, From, To}); in insertEdge()
341 void DomTreeUpdater::insertEdgeRelaxed(BasicBlock *From, BasicBlock *To) { in insertEdgeRelaxed() argument
342 if (From == To) in insertEdgeRelaxed()
348 if (!isUpdateValid({DominatorTree::Insert, From, To})) in insertEdgeRelaxed()
353 DT->insertEdge(From, To); in insertEdgeRelaxed()
355 PDT->insertEdge(From, To); in insertEdgeRelaxed()
359 PendUpdates.push_back({DominatorTree::Insert, From, To}); in insertEdgeRelaxed()
362 void DomTreeUpdater::deleteEdge(BasicBlock *From, BasicBlock *To) { in deleteEdge() argument
365 assert(isUpdateValid({DominatorTree::Delete, From, To}) && in deleteEdge()
373 if (From == To) in deleteEdge()
378 DT->deleteEdge(From, To); in deleteEdge()
380 PDT->deleteEdge(From, To); in deleteEdge()
384 PendUpdates.push_back({DominatorTree::Delete, From, To}); in deleteEdge()
387 void DomTreeUpdater::deleteEdgeRelaxed(BasicBlock *From, BasicBlock *To) { in deleteEdgeRelaxed() argument
388 if (From == To) in deleteEdgeRelaxed()
394 if (!isUpdateValid({DominatorTree::Delete, From, To})) in deleteEdgeRelaxed()
399 DT->deleteEdge(From, To); in deleteEdgeRelaxed()
401 PDT->deleteEdge(From, To); in deleteEdgeRelaxed()
405 PendUpdates.push_back({DominatorTree::Delete, From, To}); in deleteEdgeRelaxed()
475 BasicBlock *To = U.getTo(); in dump() local
476 if (To) { in dump()
477 auto S = To->getName(); in dump()
478 if (!To->hasName()) in dump()
480 OS << S << "(" << To << ")\n"; in dump()