HomeSort by: relevance | last modified time | path
    Searched refs:Dom (Results 1 - 10 of 10) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
DebugCheckers.cpp 38 CFGDomTree Dom;
39 Dom.buildDominatorTree(AC->getCFG());
40 Dom.dump();
64 CFGPostDomTree Dom;
65 Dom.buildDominatorTree(AC->getCFG());
66 Dom.dump();
90 ControlDependencyCalculator Dom(AC->getCFG());
91 Dom.dump();
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
SplitKit.cpp 1036 DomPair &Dom = NearestDom[ParentVNI->id];
1043 Dom = DomPair(ValMBB, VNI->def);
1053 if (!Dom.first) {
1055 Dom = DomPair(ValMBB, VNI->def);
1056 } else if (Dom.first == ValMBB) {
1058 if (!Dom.second.isValid() || VNI->def < Dom.second)
1059 Dom.second = VNI->def;
1063 MDT.findNearestCommonDominator(Dom.first, ValMBB);
1066 Dom = DomPair(ValMBB, VNI->def)
    [all...]
ShrinkWrap.cpp 315 DominanceAnalysis &Dom) {
318 IDom = Dom.findNearestCommonDominator(IDom, BB);
338 else if (MPDT->getNode(&MBB)) // If the block is not in the post dom tree, it
  /src/external/apache2/llvm/dist/llvm/lib/IR/
SafepointIRVerifier.cpp 171 SmallVector<BasicBlock *, 8> Dom;
172 DT->getDescendants(const_cast<BasicBlock*>(D), Dom);
176 DeadBlocks.insert(Dom.begin(), Dom.end());
179 for (BasicBlock *B : Dom)
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SILowerI1Copies.cpp 317 MachineBasicBlock *Dom = CommonDominators[LoopLevel];
319 Dom = DT.findNearestCommonDominator(Dom, MBB);
321 if (!inLoopLevel(*Dom, LoopLevel, Blocks)) {
322 SSAUpdater.AddAvailableValue(Dom, insertUndefLaneMask(*Dom));
326 for (MachineBasicBlock *Pred : Dom->predecessors()) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SeparateConstOffsetFromGEP.cpp 1207 // Dom: LHS+RHS
1209 // If Dom can't sign overflow and Dom dominates I, optimize I to sext(Dom).
1216 if (auto *Dom = findClosestMatchingDominator(Key, I, DominatingAdds)) {
1217 Instruction *NewSExt = new SExtInst(Dom, I->getType(), "", I);
1228 if (auto *Dom = findClosestMatchingDominator(Key, I, DominatingSubs)) {
1229 Instruction *NewSExt = new SExtInst(Dom, I->getType(), "", I);
GVN.cpp 2922 SmallVector<BasicBlock *, 8> Dom;
2923 DT->getDescendants(D, Dom);
2924 DeadBlocks.insert(Dom.begin(), Dom.end());
2927 for (BasicBlock *B : Dom) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp 677 BasicBlock *Dom = cast<BasicBlock>(*I);
680 Dom = B ? DT->findNearestCommonDominator(Dom, B) : nullptr;
681 if (!Dom)
684 LLVM_DEBUG(dbgs() << "computed:" << Dom->getName() << '\n');
685 return Dom;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
MemorySSA.cpp 796 auto Dom = Paths.begin();
797 for (auto I = std::next(Dom), E = Paths.end(); I != E; ++I)
798 if (!MSSA.dominates(I->Clobber, Dom->Clobber))
799 Dom = I;
801 if (Last != Dom)
802 std::iter_swap(Last, Dom);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/
CoroFrame.cpp 2288 DominatorTree Dom(F);
2298 Dom.dominates(CoroBegin, Inst))
2309 if (Dom.dominates(CoroBegin, Inst))
2318 llvm::sort(InsertionList, [&Dom](Instruction *A, Instruction *B) -> bool {
2320 return Dom.dominates(A, B);

Completed in 25 milliseconds