Lines Matching full:updates

64     SmallVectorImpl<DominatorTree::UpdateType> *Updates,
72       if (Updates && UniqueSuccessors.insert(Succ).second)
73         Updates->push_back({DominatorTree::Delete, BB, Succ});
92            "applying corresponding DTU updates.");
112   SmallVector<DominatorTree::UpdateType, 4> Updates;
113   detachDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs);
116     DTU->applyUpdates(Updates);
157       MemDep->removeInstruction(PN);  // Memdep updates AA itself.
238     assert(!DTU && "cannot use both DT and DTU for updates");
249   std::vector<DominatorTree::UpdateType> Updates;
251     assert(!DT && "cannot use both DT and DTU for updates");
256     Updates.reserve(Updates.size() + 2 * succ_size(BB) + 1);
259     // respectively, it is beneficial to have all insert updates first. Deleting
261     // making the blocks reachable again. Such DT updates lead to high compile
267           Updates.push_back({DominatorTree::Insert, PredBB, SuccOfBB});
271         Updates.push_back({DominatorTree::Delete, BB, SuccOfBB});
272     Updates.push_back({DominatorTree::Delete, PredBB, BB});
325     DTU->applyUpdates(Updates);
914     SmallVector<DominatorTree::UpdateType, 3> Updates;
916     Updates.push_back({DominatorTree::Insert, BB, NewBB});
917     Updates.push_back({DominatorTree::Insert, NewBB, Succ});
918     Updates.push_back({DominatorTree::Delete, BB, Succ});
920     DTU.applyUpdates(Updates);
924       MSSAU->applyUpdates(Updates, *DT);
1053     SmallVector<DominatorTree::UpdateType, 8> Updates;
1056     Updates.push_back({DominatorTree::Insert, Old, New});
1057     Updates.reserve(Updates.size() + 2 * succ_size(New));
1060         Updates.push_back({DominatorTree::Insert, New, SuccessorOfOld});
1061         Updates.push_back({DominatorTree::Delete, Old, SuccessorOfOld});
1064     DTU->applyUpdates(Updates);
1161       SmallVector<DominatorTree::UpdateType, 8> Updates;
1163       Updates.push_back({DominatorTree::Insert, NewBB, OldBB});
1164       Updates.reserve(Updates.size() + 2 * Preds.size());
1167           Updates.push_back({DominatorTree::Insert, Pred, NewBB});
1168           Updates.push_back({DominatorTree::Delete, Pred, OldBB});
1170       DTU->applyUpdates(Updates);
1258 /// This also updates AliasAnalysis, if available.
1658   SmallVector<DominatorTree::UpdateType, 8> Updates;
1663     Updates.reserve(4 + 2 * UniqueOrigSuccessors.size());
1706     Updates.emplace_back(DominatorTree::Insert, Head, TrueBlock);
1707     Updates.emplace_back(DominatorTree::Insert, Head, FalseBlock);
1709       Updates.emplace_back(DominatorTree::Insert, TrueBlock, Tail);
1711       Updates.emplace_back(DominatorTree::Insert, FalseBlock, Tail);
1713       Updates.emplace_back(DominatorTree::Insert, Tail, UniqueOrigSuccessor);
1715       Updates.emplace_back(DominatorTree::Delete, Head, UniqueOrigSuccessor);
1716     DTU->applyUpdates(Updates);
2153   SmallVector<DominatorTree::UpdateType, 16> Updates;
2158           Updates.push_back({DominatorTree::Delete, In, Succ});
2178       Updates.push_back({DominatorTree::Insert, In, FirstGuardBlock});
2181       Updates.push_back({DominatorTree::Insert, GuardBlocks[i], Outgoing[i]});
2182       Updates.push_back(
2185     Updates.push_back({DominatorTree::Insert, GuardBlocks[NumGuards - 1],
2187     Updates.push_back({DominatorTree::Insert, GuardBlocks[NumGuards - 1],
2189     DTU->applyUpdates(Updates);