Searched refs:Dom (Results 1 - 10 of 10) sorted by relevance
| /freebsd-12-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | DebugCheckers.cpp | 38 CFGDomTree Dom; local
39 Dom.buildDominatorTree(AC->getCFG());
40 Dom.dump();
64 CFGPostDomTree Dom; local
65 Dom.buildDominatorTree(AC->getCFG());
66 Dom.dump();
90 ControlDependencyCalculator Dom(AC->getCFG());
91 Dom.dump();
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SplitKit.cpp | 1032 DomPair &Dom = NearestDom[ParentVNI->id]; local
1039 Dom = DomPair(ValMBB, VNI->def);
1049 if (!Dom.first) {
1051 Dom = DomPair(ValMBB, VNI->def);
1052 } else if (Dom.first == ValMBB) {
1054 if (!Dom.second.isValid() || VNI->def < Dom.second)
1055 Dom.second = VNI->def;
1059 MDT.findNearestCommonDominator(Dom.first, ValMBB);
1062 Dom
1078 DomPair &Dom = NearestDom[i]; local
1104 const DomPair &Dom = NearestDom[ParentVNI->id]; local
[all...] |
| H A D | ShrinkWrap.cpp | 315 DominanceAnalysis &Dom) {
318 IDom = Dom.findNearestCommonDominator(IDom, BB);
314 FindIDom(MachineBasicBlock &Block, ListOfBBs BBs, DominanceAnalysis &Dom) argument
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/ |
| H A D | SafepointIRVerifier.cpp | 170 SmallVector<BasicBlock *, 8> Dom; local
171 DT->getDescendants(const_cast<BasicBlock*>(D), Dom); local
175 DeadBlocks.insert(Dom.begin(), Dom.end());
178 for (BasicBlock *B : Dom)
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 328 MachineBasicBlock *Dom = CommonDominators[LoopLevel];
330 Dom = DT.findNearestCommonDominator(Dom, MBB);
332 if (!inLoopLevel(*Dom, LoopLevel, Blocks)) {
333 SSAUpdater.AddAvailableValue(Dom, insertUndefLaneMask(*Dom));
337 for (MachineBasicBlock *Pred : Dom->predecessors()) {
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 687 BasicBlock *Dom = cast<BasicBlock>(*I);
690 Dom = B ? DT->findNearestCommonDominator(Dom, B) : nullptr;
691 if (!Dom)
694 LLVM_DEBUG(dbgs() << "computed:" << Dom->getName() << '\n');
695 return Dom;
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MemorySSA.cpp | 785 auto Dom = Paths.begin();
786 for (auto I = std::next(Dom), E = Paths.end(); I != E; ++I)
787 if (!MSSA.dominates(I->Clobber, Dom->Clobber))
788 Dom = I;
790 if (Last != Dom)
791 std::iter_swap(Last, Dom);
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SeparateConstOffsetFromGEP.cpp | 1167 // Dom: LHS+RHS
1169 // If Dom can't sign overflow and Dom dominates I, optimize I to sext(Dom).
1177 if (auto *Dom = findClosestMatchingDominator(Key, I)) {
1178 Instruction *NewSExt = new SExtInst(Dom, I->getType(), "", I);
|
| H A D | GVN.cpp | 2564 SmallVector<BasicBlock *, 8> Dom; local
2565 DT->getDescendants(D, Dom);
2566 DeadBlocks.insert(Dom.begin(), Dom.end());
2569 for (BasicBlock *B : Dom) {
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | PartialInlining.cpp | 416 BasicBlock *Dom = BlockList.front();
417 return BlockList.size() > 1 && Dom->hasNPredecessors(1);
|
Completed in 265 milliseconds