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